TY - GEN
T1 - Efficient top-k queries for orthogonal ranges
AU - Rahul, Saladi
AU - Gupta, Prosenjit
AU - Janardan, Ravi
AU - Rajan, K. S.
PY - 2011
Y1 - 2011
N2 - Advances in sensing and data gathering technologies have resulted in an explosion in the volume of data that is being generated, processed, and archived. In particular, this information overload calls for new methods for querying large spatial datasets, since users are often not interested in merely retrieving a list of all data items satisfying a query, but would, instead, like a more informative "summary" of the retrieved items. An example is the so-called top-k problem, where the goal is to retrieve from a set of n weighted points in IRd the k most significant points, ranked by their weights, that lie in an orthogonal query box in IRd (rather than get a list of all points lying in the query box). In this paper, efficient and output-sensitive solutions are presented for this problem in two settings. In the first setting, the k points are reported in arbitrary order and the underlying set can be updated dynamically through insertions and deletions of points. In the second setting, the k points are reported in sorted order of their weights.
AB - Advances in sensing and data gathering technologies have resulted in an explosion in the volume of data that is being generated, processed, and archived. In particular, this information overload calls for new methods for querying large spatial datasets, since users are often not interested in merely retrieving a list of all data items satisfying a query, but would, instead, like a more informative "summary" of the retrieved items. An example is the so-called top-k problem, where the goal is to retrieve from a set of n weighted points in IRd the k most significant points, ranked by their weights, that lie in an orthogonal query box in IRd (rather than get a list of all points lying in the query box). In this paper, efficient and output-sensitive solutions are presented for this problem in two settings. In the first setting, the k points are reported in arbitrary order and the underlying set can be updated dynamically through insertions and deletions of points. In the second setting, the k points are reported in sorted order of their weights.
UR - http://www.scopus.com/inward/record.url?scp=79952295757&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=79952295757&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-19094-0_13
DO - 10.1007/978-3-642-19094-0_13
M3 - Conference contribution
AN - SCOPUS:79952295757
SN - 9783642190933
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 110
EP - 121
BT - WALCOM
T2 - 5th Annual Workshop on Algorithms and Computation, WALCOM 2011
Y2 - 18 February 2011 through 20 February 2011
ER -