Filtered document retrieval with frequency-sorted indexes
Journal of the American Society for Information Science
Combining fuzzy information from multiple systems
Journal of Computer and System Sciences
Optimal aggregation algorithms for middleware
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Minimal probing: supporting expensive predicates for top-k queries
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Searching in metric spaces with user-defined and approximate distances
ACM Transactions on Database Systems (TODS)
Query Processing Issues in Image(Multimedia) Databases
ICDE '99 Proceedings of the 15th International Conference on Data Engineering
Optimal aggregation algorithms for middleware
Journal of Computer and System Sciences - Special issu on PODS 2001
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Towards Efficient Multi-Feature Queries in Heterogeneous Environments
ITCC '01 Proceedings of the International Conference on Information Technology: Coding and Computing
Evaluating Top-k Queries over Web-Accessible Databases
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Index-driven similarity search in metric spaces (Survey Article)
ACM Transactions on Database Systems (TODS)
Evaluating top-k queries over web-accessible databases
ACM Transactions on Database Systems (TODS)
Optimizing Top-k Selection Queries over Multimedia Repositories
IEEE Transactions on Knowledge and Data Engineering
Efficient top-K query calculation in distributed networks
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Progressive Distributed Top-k Retrieval in Peer-to-Peer Networks
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
KLEE: a framework for distributed top-k query algorithms
VLDB '05 Proceedings of the 31st international conference on Very large data bases
A Sampling-Based Approach to Optimizing Top-k Queries in Sensor Networks
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Monitoring Top-k Query inWireless Sensor Networks
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Reducing network traffic in unstructured P2P systems using Top-k queries
Distributed and Parallel Databases
Finding and approximating top-k answers in keyword proximity search
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Continuous monitoring of top-k queries over sliding windows
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Answering top-k queries using views
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
IO-Top-k: index-access optimized top-k query processing
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
An integrated efficient solution for computing frequent and top-k elements in data streams
ACM Transactions on Database Systems (TODS)
Data currency in replicated DHTs
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Optimized query execution in large search engines with global page ordering
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Approximate NN queries on streams with guaranteed error/performance bounds
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Processing Top-k Queries in Distributed Hash Tables
Euro-Par '07 Proceedings of the 13th European international conference on Parallel Processing
Probabilistic ranked queries in uncertain databases
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
On efficient top-k query processing in highly distributed environments
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Efficient Processing of Continuous Join Queries Using Distributed Hash Tables
Euro-Par '08 Proceedings of the 14th international Euro-Par conference on Parallel Processing
On Top-k Search with No Random Access Using Small Memory
ADBIS '08 Proceedings of the 12th East European conference on Advances in Databases and Information Systems
SUM '08 Proceedings of the 2nd international conference on Scalable Uncertainty Management
Anonymizing moving objects: how to hide a MOB in a crowd?
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Skyline View: Efficient Distributed Subspace Skyline Computation
DaWaK '09 Proceedings of the 11th International Conference on Data Warehousing and Knowledge Discovery
Distributed processing of continuous join queries using DHT networks
Proceedings of the 2009 EDBT/ICDT Workshops
Efficient processing of exact top-k queries over disk-resident sorted lists
The VLDB Journal — The International Journal on Very Large Data Bases
Fast top-k simple shortest paths discovery in graphs
CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
Top-k vectorial aggregation queries in a distributed environment
Journal of Parallel and Distributed Computing
Supporting early pruning in top-k query processing on massive data
Information Processing Letters
Fragmenting Steiner tree browsers based on Ajax
Proceedings of the 5th International Conference on Ubiquitous Information Management and Communication
Efficient top-k retrieval for user preference queries
Proceedings of the 2011 ACM Symposium on Applied Computing
Best position algorithms for efficient top-k query processing
Information Systems
Efficient and generic evaluation of ranked queries
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Efficient distributed top-k query processing with caching
DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications: Part II
Trajectory anonymity in publishing personal mobility data
ACM SIGKDD Explorations Newsletter
DEXA'11 Proceedings of the 22nd international conference on Database and expert systems applications - Volume Part II
A general top-k algorithm for web data sources
DEXA'11 Proceedings of the 22nd international conference on Database and expert systems applications - Volume Part I
Privacy-preserving distributed network troubleshooting—bridging the gap between theory and practice
ACM Transactions on Information and System Security (TISSEC)
Intelligent Social Media Indexing and Sharing Using an Adaptive Indexing Search Engine
ACM Transactions on Intelligent Systems and Technology (TIST)
Supporting efficient distributed skyline computation using skyline views
Information Sciences: an International Journal
Distributed top-k query processing by exploiting skyline summaries
Distributed and Parallel Databases
TJJE: An efficient algorithm for top-k join on massive data
Information Sciences: an International Journal
Subspace top-k query processing using the hybrid-layer index with a tight bound
Data & Knowledge Engineering
Efficient top-k query answering using cached views
Proceedings of the 16th International Conference on Extending Database Technology
Branch-and-bound algorithm for reverse top-k queries
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Top-k queries over web applications
The VLDB Journal — The International Journal on Very Large Data Bases
As-Soon-As-Possible top-k query processing in p2p systems
Transactions on Large-Scale Data- and Knowledge-centered systems IX
Hi-index | 0.00 |
The general problem of answering top-k queries can be modeled using lists of data items sorted by their local scores. The most efficient algorithm proposed so far for answering top-k queries over sorted lists is the Threshold Algorithm (TA). However, TA may still incur a lot of useless accesses to the lists. In this paper, we propose two new algorithms which stop much sooner. First, we propose the best position algorithm (BPA) which executes top-k queries more efficiently than TA. For any database instance (i.e. set of sorted lists), we prove that BPA stops as early as TA, and that its execution cost is never higher than TA. We show that the position at which BPA stops can be (m-1) times lower than that of TA, where m is the number of lists. We also show that the execution cost of our algorithm can be (m-1) times lower than that of TA. Second, we propose the BPA2 algorithm which is much more efficient than BPA. We show that the number of accesses to the lists done by BPA2 can be about (m-1) times lower than that of BPA. Our performance evaluation shows that over our test databases, BPA and BPA2 achieve significant performance gains in comparison with TA.