Department of Mathematics
 Search | Help | Login | pdf version | printable version

Math @ Duke



Publications [#235551] of Pankaj K. Agarwal

Papers Published

  1. Yu, A; Agarwal, PK; Yang, J, Processing a large number of continuous preference top-k queries, Proceedings of the Acm Sigmod International Conference on Management of Data (2012), pp. 397-408, ISSN 0730-8078 [doi]
    (last updated on 2018/10/16)

    Given a set of objects, each with multiple numeric attributes, a (preference) top-k query retrieves the k objects with the highest scores according to a user preference, defined as a linear combination of attribute values. We consider the problem of processing a large number of continuous top-k queries, each with its own preference. When objects or user preferences change, the query results must be updated. We present a dynamic index that supports the reverse top k query, which is of independent interest. Combining this index with another one for top-k queries, we develop a scalable solution for processing many continuous top-k queries that exploits the clusteredness in user preferences. We also define an approximate version of the problem and present a solution significantly more efficient than the exact one with little loss in accuracy. © 2012 ACM.
ph: 919.660.2800
fax: 919.660.2821

Mathematics Department
Duke University, Box 90320
Durham, NC 27708-0320