The onion technique: indexing for linear optimization queries
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Optimal aggregation algorithms for middleware
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
PREFER: a system for the efficient execution of multi-parametric ranked queries
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Top-k selection queries over relational databases: Mapping strategies and performance evaluation
ACM Transactions on Database Systems (TODS)
Proceedings of the 17th International Conference on Data Engineering
Evaluating Top-k Selection Queries
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Optimizing Multi-Feature Queries for Image Databases
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
A Sampling-Based Estimator for Top-k Query
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Evaluating top-k queries over web-accessible databases
ACM Transactions on Database Systems (TODS)
Merging retrieval results in hierarchical peer-to-peer networks
Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval
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
Robust Cardinality and Cost Estimation for Skyline Operator
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
Continuous monitoring of top-k queries over sliding windows
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Adaptive rank-aware query optimization in relational databases
ACM Transactions on Database Systems (TODS)
Branch-and-bound processing of ranked queries
Information Systems
Efficient top-k processing in large-scaled distributed environments
Data & Knowledge Engineering
Multi-objective query processing for database systems
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Best position algorithms for top-k queries
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
On efficient top-k query processing in highly distributed environments
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
A survey of top-k query processing techniques in relational database systems
ACM Computing Surveys (CSUR)
Skyline-based Peer-to-Peer Top-k Query Processing
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
Identifying the most influential data objects with reverse top-k queries
Proceedings of the VLDB Endowment
Pareto-Based Dominant Graph: An Efficient Indexing Structure to Answer Top-K Queries
IEEE Transactions on Knowledge and Data Engineering
Efficient distributed top-k query processing with caching
DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications: Part II
Monitoring reverse top-k queries over mobile devices
Proceedings of the 10th ACM International Workshop on Data Engineering for Wireless and Mobile Access
Monochromatic and Bichromatic Reverse Top-k Queries
IEEE Transactions on Knowledge and Data Engineering
Federated search of text-based digital libraries in hierarchical peer-to-peer networks
ECIR'05 Proceedings of the 27th European conference on Advances in Information Retrieval Research
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 |
Recently, a trend has been observed towards supporting rank-aware query operators, such as top-k, that enable users to retrieve only a limited set of the most interesting data objects. As data nowadays is commonly stored distributed over multiple servers, a challenging problem is to support rank-aware queries in distributed environments. In this paper, we propose a novel approach, called DiTo, for efficient top-k processing over multiple servers, where each server stores autonomously a fraction of the data. Towards this goal, we exploit the inherent relationship of top-k and skyline objects, and we employ the skyline objects of servers as a data summarization mechanism for efficiently identifying the servers that store top-k results. Relying on a thresholding scheme, DiTo retrieves the top-k result set progressively, while the number of queried servers and transferred data is minimized. Furthermore, we extend DiTo to support data summarizations of bounded size, thus restricting the cost of summary distribution and maintenance. To this end, we study the challenging problem of finding an abstraction of the skyline set of fixed size that influences the performance of DiTo only slightly. Our experimental evaluation shows that DiTo performs efficiently and provides a viable solution when a high degree of distribution is required.