Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
Searching distributed collections with inference networks
SIGIR '95 Proceedings of the 18th annual international ACM SIGIR conference on Research and development in information retrieval
Answering queries using views (extended abstract)
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Optimizing queries over multimedia repositories
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Combining fuzzy information from multiple systems (extended abstract)
PODS '96 Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Approximation algorithms for NP-hard problems
Approximation algorithms for NP-hard problems
STARTS: Stanford proposal for Internet meta-searching
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Answering recursive queries using views
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Fuzzy queries in multimedia database systems
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Rewriting aggregate queries using views
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Query rewriting for semistructured data
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
A framework for expressing and combining preferences
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
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
Incorporating User Preferences in Multimedia Queries
ICDT '97 Proceedings of the 6th International Conference on Database Theory
Merging Ranks from Heterogeneous Internet Sources
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Contrast Plots and P-Sphere Trees: Space vs. Time in Nearest Neighbour Searches
VLDB '00 Proceedings of the 26th 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
Querying Heterogeneous Information Sources Using Source Descriptions
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Answering queries using views: A survey
The VLDB Journal — The International Journal on Very Large Data Bases
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
Aggregate nearest neighbor queries in spatial databases
ACM Transactions on Database Systems (TODS)
Continuous monitoring of top-k queries over sliding windows
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Branch-and-bound processing of ranked queries
Information Systems
Semantic optimization techniques for preference queries
Information Systems
Probe Minimization by Schedule Optimization: Supporting Top-K Queries with Expensive Predicates
IEEE Transactions on Knowledge and Data Engineering
Efficient Skyline and Top-k Retrieval in Subspaces
IEEE Transactions on Knowledge and Data Engineering
Efficient top-k aggregation of ranked inputs
ACM Transactions on Database Systems (TODS)
Database querying under changing preferences
Annals of Mathematics and Artificial Intelligence
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Region clustering based evaluation of multiple top-N selection queries
Data & Knowledge Engineering
Probabilistic ranked queries in uncertain databases
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
A survey of top-k query processing techniques in relational database systems
ACM Computing Surveys (CSUR)
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
Information Sciences: an International Journal
View usability and safety for the answering of top-k queries via materialized views
Proceedings of the ACM twelfth international workshop on Data warehousing and OLAP
Continuous Processing of Preference Queries in Data Streams
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
Processing top-N relational queries by learning
Journal of Intelligent Information Systems
Maintenance of top-k materialized views
Distributed and Parallel Databases
Probabilistic inverse ranking queries in uncertain databases
The VLDB Journal — The International Journal on Very Large Data Bases
An optimal strategy for monitoring top-k queries in streaming windows
Proceedings of the 14th International Conference on Extending Database Technology
Efficient top-k retrieval for user preference queries
Proceedings of the 2011 ACM Symposium on Applied Computing
FIFO indexes for decomposable problems
Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Sharing work in keyword search over databases
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Efficient and generic evaluation of ranked queries
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
A survey on representation, composition and application of preferences in database systems
ACM Transactions on Database Systems (TODS)
MTopS: scalable processing of continuous top-k multi-query workloads
Proceedings of the 20th ACM international conference on Information and knowledge management
Efficient processing of ranked queries with sweeping selection
PKDD'05 Proceedings of the 9th European conference on Principles and Practice of Knowledge Discovery in Databases
Iterative modification and incremental evaluation of preference queries
FoIKS'06 Proceedings of the 4th international conference on Foundations of Information and Knowledge Systems
Processing ranked queries with the minimum space
FoIKS'06 Proceedings of the 4th international conference on Foundations of Information and Knowledge Systems
Chapter 11: rank-join algorithms for search computing
Search Computing
Representing and reasoning with qualitative preferences for compositional systems
Journal of Artificial Intelligence Research
Efficient approximation of the maximal preference scores by lightweight cubic views
Proceedings of the 15th International Conference on Extending Database Technology
Subspace top-k query processing using the hybrid-layer index with a tight bound
Data & Knowledge Engineering
Computing immutable regions for subspace top-k queries
Proceedings of the VLDB Endowment
Shortlisting top-K assignments
Proceedings of the 25th International Conference on Scientific and Statistical Database Management
Context-aware top-K processing using views
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
| Hi-index | 0.00 |
Ranked queries return the top objects of a database according to a preference function. We present and evaluate (experimentally and theoretically) a core algorithm that answers ranked queries in an efficient pipelined manner using materialized ranked views. We use and extend the core algorithm in the described PREFER and MERGE systems. PREFER precomputes a set of materialized views that provide guaranteed query performance. We present an algorithm that selects a near optimal set of views under space constraints. We also describe multiple optimizations and implementation aspects of the downloadable version of PREFER. Then we discuss MERGE, which operates at a metabroker and answers ranked queries by retrieving a minimal number of objects from sources that offer ranked queries. A speculative version of the pipelining algorithm is described.