Combining fuzzy information: an overview
ACM SIGMOD Record
Searching web databases by structuring keyword-based queries
Proceedings of the eleventh international conference on Information and knowledge 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
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
Keyword-based queries over web databases
Effective databases for text & document management
Algorithms and applications for answering ranked queries using ranked views
The VLDB Journal — The International Journal on Very Large Data Bases
Evaluating top-k queries over web-accessible databases
ACM Transactions on Database Systems (TODS)
Conditional selectivity for statistics on query expressions
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Optimizing Top-k Selection Queries over Multimedia Repositories
IEEE Transactions on Knowledge and Data Engineering
Supporting top-k join queries in relational databases
The VLDB Journal — The International Journal on Very Large Data Bases
A Bayesian network approach to searching Web databases through keyword-based queries
Information Processing and Management: an International Journal - Special issue: Bayesian networks and information retrieval
Progressive Distributed Top-k Retrieval in Peer-to-Peer Networks
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
The threshold join algorithm for top-k queries in distributed sensor networks
DMSN '05 Proceedings of the 2nd international workshop on Data management for sensor networks
SVM selective sampling for ranking with application to data retrieval
Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
An efficient and versatile query engine for TopX search
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Progressive skylining over web-accessible databases
Data & Knowledge Engineering
Answering top-k queries using views
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Probabilistic information retrieval approach for ranking of database query results
ACM Transactions on Database Systems (TODS)
Distributed spatio-temporal similarity search
CIKM '06 Proceedings of the 15th ACM international conference on Information and knowledge management
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)
Enabling soft queries for data retrieval
Information Systems
Flexible integration of multimedia sub-queries with qualitative preferences
Multimedia Tools and Applications
Reverse Nearest Neighbors Search in Ad Hoc Subspaces
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
Progressive ranking of range aggregates
Data & Knowledge Engineering
Efficient top-k processing in large-scaled distributed environments
Data & Knowledge 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
Efficient approximation of optimization queries under parametric aggregation constraints
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
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
Anytime measures for top-k algorithms
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
ARCube: supporting ranking aggregate queries in partially materialized data cubes
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Extracting k most important groups from data efficiently
Data & Knowledge Engineering
A survey of top-k query processing techniques in relational database systems
ACM Computing Surveys (CSUR)
A user-friendly interface for evaluating preference queries over tabular data
Proceedings of the 26th annual ACM international conference on Design of communication
A Context-Sensitive Approach for Web Database Query Results Ranking
WI-IAT '08 Proceedings of the 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Volume 01
Anytime measures for top-k algorithms on exact and fuzzy data sets
The VLDB Journal — The International Journal on Very Large Data Bases
Consistent Top-k Queries over Time
DASFAA '09 Proceedings of the 14th International Conference on Database Systems for Advanced Applications
Finding the K highest-ranked answers in a distributed network
Computer Networks: The International Journal of Computer and Telecommunications Networking
Distributed top-k aggregation queries at large
Distributed and Parallel Databases
Optimal algorithms for evaluating rank joins in database systems
ACM Transactions on Database Systems (TODS)
Efficient retrieval of the top-k most relevant spatial web objects
Proceedings of the VLDB Endowment
Towards efficient ranked query processing in peer-to-peer networks
Proceedings of the 2005 joint Chinese-German conference on Cognitive systems
Efficient top-k search across heterogeneous XML data sources
DASFAA'08 Proceedings of the 13th international conference on Database systems for advanced applications
Distributed threshold querying of general functions by a difference of monotonic representation
Proceedings of the VLDB Endowment
Power efficiency through tuple ranking in wireless sensor network monitoring
Distributed and Parallel Databases
Distributed adaptive top-k monitoring in wireless sensor networks
Journal of Systems and Software
Selective sampling techniques for feedback-based data retrieval
Data Mining and Knowledge Discovery
Exact indexing for support vector machines
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Faster top-k document retrieval using block-max indexes
Proceedings of the 34th international ACM SIGIR conference on Research and development in Information Retrieval
A self-adaptive cross-domain query approach on the deep web
WAIM'11 Proceedings of the 12th international conference on Web-age information management
Variable-strength conditional preferences for ranking objects in ontologies
ESWC'06 Proceedings of the 3rd European conference on The Semantic Web: research and applications
Approximate top-k queries in sensor networks
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Progressive ranking of range aggregates
DaWaK'05 Proceedings of the 7th international conference on Data Warehousing and Knowledge Discovery
A scalable randomized method to compute link-based similarity rank on the web graph
EDBT'04 Proceedings of the 2004 international conference on Current Trends in Database Technology
Approaching the efficient frontier: cooperative database retrieval using high-dimensional skylines
DASFAA'05 Proceedings of the 10th international conference on Database Systems for Advanced Applications
Robust query processing for personalized information access on the semantic web
FQAS'06 Proceedings of the 7th international conference on Flexible Query Answering Systems
Chapter 11: rank-join algorithms for search computing
Search Computing
Efficient approximation of the maximal preference scores by lightweight cubic views
Proceedings of the 15th International Conference on Extending Database Technology
Optimal algorithms for crawling a hidden database in the web
Proceedings of the VLDB Endowment
Indexing methods for efficient protein 3D surface search
Proceedings of the ACM sixth international workshop on Data and text mining in biomedical informatics
Evaluating top-k skyline queries over relational databases
DEXA'07 Proceedings of the 18th international conference on Database and Expert Systems Applications
Subspace top-k query processing using the hybrid-layer index with a tight bound
Data & Knowledge Engineering
A framework for efficient spatial web object retrieval
The VLDB Journal — The International Journal on Very Large Data Bases
Fast protein 3D surface search
Proceedings of the 7th International Conference on Ubiquitous Information Management and Communication
SMashQ: spatial mashup framework for k-NN queries in time-dependent road networks
Distributed and Parallel Databases
Provisional reporting for rank joins
Journal of Intelligent Information Systems
Rank discovery from web databases
Proceedings of the VLDB Endowment
As-Soon-As-Possible top-k query processing in p2p systems
Transactions on Large-Scale Data- and Knowledge-centered systems IX
iKernel: Exact indexing for support vector machines
Information Sciences: an International Journal
Hi-index | 0.00 |
A query to a web search engine usually consists of a list of keywords, to which the search engine responds with the best or ``top" k pages for the query. This top-k query model is prevalent over multimedia collections in general, but also over plain relational data for certain applications. For example, consider a relation with information on available restaurants, including their location, price range for one diner, and overall food rating. A user who queries such a relation might simply specify the user's location and target price range, and expect in return the best 10 restaurants in terms of some combination of proximity to the user, closeness of match to the target price range, and overall food rating. Processing such top-k queries efficiently is challenging for a number of reasons. One critical such reason is that, in many web applications, the relation attributes might not be available other than through external web-accessible form interfaces, which we will have to query repeatedly for a potentially large set of candidate objects. In this paper, we study how to process top-k queries efficiently in this setting, where the attributes for which users specify target values might be handled by external, autonomous sources with a variety of access interfaces. We present several algorithms for processing such queries, and evaluate them thoroughly using both synthetic and real web-accessible data.