The Internet Archive has a preservation copy of this work in our general collections.
The file type is
Let D be a database of N objects where each object has m fields. The objects are given in m sorted lists (where the ith list is sorted according to the ith field). Our goal is to find the top k objects according to a monotone aggregation function t, while minimizing access to the lists. The problem arises in several contexts. In particular Fagin (JCSS 1999) considered it for the purpose of aggregating information in a multimedia database system. We are interested in instance optimality, i.e.arXiv:cs/0204046v1 fatcat:rpvwxpoykbfs3fhmb6hsdp6xy4