Secure kNN computation on encrypted databases
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Ranking strategies and threats: a cost-based pareto optimization approach
Distributed and Parallel Databases
Efficient processing of exact top-k queries over disk-resident sorted lists
The VLDB Journal — The International Journal on Very Large Data Bases
Continuous probabilistic skyline queries over uncertain data streams
DEXA'10 Proceedings of the 21st international conference on Database and expert systems applications: Part I
Design and analysis of a ranking approach to private location-based services
ACM Transactions on Database Systems (TODS)
Efficient and generic evaluation of ranked queries
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Efficient approximate top-k query algorithm using cube index
APWeb'11 Proceedings of the 13th Asia-Pacific web conference on Web technologies and applications
Answering top-k queries over a mixture of attractive and repulsive dimensions
Proceedings of the VLDB Endowment
Efficient approximation of the maximal preference scores by lightweight cubic views
Proceedings of the 15th International Conference on Extending Database Technology
Efficient entity matching using materialized lists
Information Sciences: an International Journal
Hi-index | 0.00 |
Given a record set D and a query score function F, a top-k query returns k records from D, whose values of function F on their attributes are the highest. In this paper, we investigate the intrinsic connection between top-k queries and dominant relationship between records, and based on which, we propose an efficient layer-based indexing structure, Dominant Graph (DG), to improve the query efficiency. Specifically, DG is built offline to express the dominant relationship between records and top-k query is implemented as a graph traversal problem, i.e. Traveler algorithm. We prove theoretically that the size of search space (that is the number of retrieved records from the record set to answer top-k query) in our basic algorithm is directly related to the cardinality of skyline points in the record set (see Theorem 3.2). Based on the cost analysis, we propose the optimization technique, pseudo record, to improve the search efficiency. In order to handle the top-k query in the high dimension record set, we also propose N-Way Traveler algorithm. Finally, extensive experiments demonstrate that our proposed methods have significant improvement over its counterparts, including both classical and state art of top-k algorithms. For example, the search space in our algorithm is less than 1/5 of that in AppRI (Xin et al., 2006), one of state art of top-k algorithms. Furthermore, our method can support any aggregate monotone query function.