Please use this identifier to cite or link to this item:
|Title:||Consistent top-k queries over time|
|Authors:||Lee, M.L. |
|Source:||Lee, M.L.,Hsu, W.,Li, L.,Tok, W.H. (2009). Consistent top-k queries over time. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 5463 : 51-65. ScholarBank@NUS Repository. https://doi.org/10.1007/978-3-642-00887-0_5|
|Abstract:||Top-k queries have been well-studied in snapshot databases and data streams. We observe that decision-makers are often interested in a set of objects that exhibit a certain degree of consistent behavior over time. We introduce a new class of queries called consistent top-k to retrieve k objects that are always amongst the top at every time point over a specified time interval. Applying top-kmethods at each time point leads to large intermediate results and wasted computations. We design two methods, rank-based and bitmap, to address these shortcomings. Experiment results indicate that the proposed methods are efficient and scalable, and consistent top-k queries are practical in real world applications.|
|Source Title:||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 18, 2017
checked on Dec 16, 2017
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.