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
Combining fuzzy information: an overview
ACM SIGMOD Record
FQAS '02 Proceedings of the 5th International Conference on Flexible Query Answering Systems
Fast Evaluation Techniques for Complex Similarity Queries
Proceedings of the 27th International Conference on Very Large Data Bases
A General and Efficient Approach for Solving Nearest Neighbor Problem in the Vague Query System
WAIM '02 Proceedings of the Third International Conference on Advances in Web-Age Information Management
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
ISA - An Incremental Hyper-sphere Approach for Efficiently Solving Complex Vague Queries
DEXA '02 Proceedings of the 13th International Conference on Database and Expert Systems Applications
Optimal aggregation algorithms for middleware
Journal of Computer and System Sciences - Special issu on PODS 2001
Optimizing Top-k Selection Queries over Multimedia Repositories
IEEE Transactions on Knowledge and Data Engineering
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
Probabilistic information retrieval approach for ranking of database query results
ACM Transactions on Database Systems (TODS)
Supporting stratum access for fuzzy queries
DBA'06 Proceedings of the 24th IASTED international conference on Database and applications
The Threshold Algorithm: From Middleware Systems to the Relational Engine
IEEE Transactions on Knowledge and Data Engineering
Probe Minimization by Schedule Optimization: Supporting Top-K Queries with Expensive Predicates
IEEE Transactions on Knowledge and Data Engineering
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
Probabilistic ranking of database query results
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Rewriting fuzzy queries using imprecise views
ADBIS'11 Proceedings of the 15th international conference on Advances in databases and information systems
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
| Hi-index | 0.00 |
A distributed multimedia information system allows users to access data of different modalities, from different data sources, ranked by various combinations of criteria. In [6], Fagin gives an algorithm for efficiently merging multiple ordered streams of ranked results, to form a new stream ordered by a combination of those ranks. In this paper, we describe the implementation of Fagin's algorithm in an actual multimedia middleware system, including a novel, incremental version of the algorithm that supports dynamic exploration of data. We show that the algorithm would perform well as part of a single multimedia server, and can even be effective in the distributed environment (for a limited set of queries), but that the assumptions it makes about random access limit its applicability dramatically. Our experience provides a better understanding of an important algorithm, and exposes an open problem for distributed multimedia information systems.