Optimal aggregation algorithms for middleware
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Combining fuzzy information: an overview
ACM SIGMOD Record
On Real-Time Top k Querying for Mobile Services
On the Move to Meaningful Internet Systems, 2002 - DOA/CoopIS/ODBASE 2002 Confederated International Conferences DOA, CoopIS and ODBASE 2002
Optimal aggregation algorithms for middleware
Journal of Computer and System Sciences - Special issu on PODS 2001
Algorithms and applications for answering ranked queries using ranked views
The VLDB Journal — The International Journal on Very Large Data Bases
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Supporting top-k join queries in relational databases
The VLDB Journal — The International Journal on Very Large Data Bases
Optimizing Access Cost for Top-k Queries over Web Sources: A Unified Cost-Based Approach
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Efficient and self-tuning incremental query expansion for top-k query processing
Proceedings of the 28th annual international ACM SIGIR conference on Research and development in information retrieval
Filter ranking in high-dimensional space
Data & Knowledge Engineering
Adaptive rank-aware query optimization in relational databases
ACM Transactions on Database Systems (TODS)
Optimizing top-k queries for middleware access: A unified cost-based approach
ACM Transactions on Database Systems (TODS)
Reverse Nearest Neighbors Search in Ad Hoc Subspaces
IEEE Transactions on Knowledge and Data Engineering
Efficient top-k aggregation of ranked inputs
ACM Transactions on Database Systems (TODS)
Pruning policies for two-tiered inverted index with correctness guarantee
SIGIR '07 Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval
Joining ranked inputs in practice
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
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
Supporting top-K join queries in relational databases
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Top-k query evaluation with probabilistic guarantees
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
Semantic query Cache using Dynamic Facts (SCDF): a novel approach to efficient information retrieval
International Journal of Metadata, Semantics and Ontologies
A survey of top-k query processing techniques in relational database systems
ACM Computing Surveys (CSUR)
Optimizing Distributed Top-k Queries
WISE '08 Proceedings of the 9th international conference on Web Information Systems Engineering
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
Selective-NRA Algorithms for Top-k Queries
APWeb/WAIM '09 Proceedings of the Joint International Conferences on Advances in Data and Web Management
Distributed top-k aggregation queries at large
Distributed and Parallel Databases
Probabilistic ranking over relations
Proceedings of the 13th International Conference on Extending Database Technology
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
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
R2DF framework for ranked path queries over weighted RDF graphs
Proceedings of the International Conference on Web Intelligence, Mining and Semantics
A new approach for processing ranked subsequence matching based on ranked union
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)
Complex pattern ranking (CPR): evaluating top-k pattern queries over event streams
Proceedings of the 5th ACM international conference on Distributed event-based system
Parallel data access for multiway rank joins
ICWE'11 Proceedings of the 11th international conference on Web engineering
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
Efficient non-blocking top-k query processing in distributed networks
DASFAA'06 Proceedings of the 11th international conference on Database Systems for Advanced Applications
Top-k skyline: a unified approach
OTM'05 Proceedings of the 2005 OTM Confederated international conference on On the Move to Meaningful Internet Systems
Proceedings of the VLDB Endowment
Evaluating top-k skyline queries over relational databases
DEXA'07 Proceedings of the 18th international conference on Database and Expert Systems Applications
TJJE: An efficient algorithm for top-k join on massive data
Information Sciences: an International Journal
| Hi-index | 0.00 |
Abstract: Applications like multimedia databases or enterprise-wide information management systems have to meet the challenge of efficiently retrieving best matching objects from vast collections of data. We present a new algorithm Stream-Combine for processing multi-feature queries on heterogeneous data sources. Stream-Combine is self-adapting to different data distributions and to the specific kind of the combining function. Furthermore we present a new retrieval strategy that will essentially speed up the output of relevant objects.