Processing a large number of continuous preference top-k queries

@inproceedings{Yu2012ProcessingAL,
  title={Processing a large number of continuous preference top-k queries},
  author={Albert Yu and Pankaj K. Agarwal and Jun Yang},
  booktitle={SIGMOD Conference},
  year={2012}
}
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… CONTINUE READING
Highly Cited
This paper has 66 citations. REVIEW CITATIONS

12 Figures & Tables

Topics

Statistics

01020201320142015201620172018
Citations per Year

67 Citations

Semantic Scholar estimates that this publication has 67 citations based on the available data.

See our FAQ for additional information.