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
Journal of Computer and System Sciences
Optimal aggregation algorithms for middleware
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Optimizing Multi-Feature Queries for Image Databases
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Supporting Incremental Join Queries on Ranked Inputs
Proceedings of the 27th International Conference on Very Large Data Bases
Using Fagin's Algorithm for Merging Ranked Results in Multimedia Middleware
COOPIS '99 Proceedings of the Fourth IECIS International Conference on Cooperative Information Systems
Query Processing Issues in Image(Multimedia) Databases
ICDE '99 Proceedings of the 15th International Conference on Data Engineering
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
A new paradigm for ranking pages on the world wide web
WWW '03 Proceedings of the 12th international conference on World Wide Web
Efficient similarity search and classification via rank aggregation
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Group Nearest Neighbor Queries
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Information integration: A research agenda
IBM Systems Journal
Aggregate nearest neighbor queries in spatial databases
ACM Transactions on Database Systems (TODS)
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
VLDB '05 Proceedings of the 31st international conference on Very large data bases
IO-Top-k: index-access optimized top-k query processing
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
SRI: exploiting semantic information for effective query routing in a PDMS
WIDM '06 Proceedings of the 8th annual ACM international workshop on Web information and data management
Progressive and selective merge: computing top-k with ad-hoc ranking functions
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
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
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
Effective top-k computation in retrieving structured documents with term-proximity support
Proceedings of the sixteenth ACM conference on Conference on information and knowledge management
iTrails: pay-as-you-go information integration in dataspaces
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Flipstone: managing storage with fail-in-place and deferred maintenance service models
ACM SIGOPS Operating Systems Review
Efficient online top-K retrieval with arbitrary similarity measures
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
Towards Vague Query Answering in Logic Programming for Logic-Based Information Retrieval
IFSA '07 Proceedings of the 12th international Fuzzy Systems Association world congress on Foundations of Fuzzy Logic and Soft Computing
Top-k Retrieval in Description Logic Programs Under Vagueness for the Semantic Web
SUM '07 Proceedings of the 1st international conference on Scalable Uncertainty Management
Efficient network aware search in collaborative tagging sites
Proceedings of the VLDB Endowment
Can phrase indexing help to process non-phrase queries?
Proceedings of the 17th ACM conference on Information and knowledge management
A Top-Down Query Answering Procedure for Normal Logic Programs Under the Any-World Assumption
ECSQARU '07 Proceedings of the 9th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Managing uncertainty and vagueness in description logics for the Semantic Web
Web Semantics: Science, Services and Agents on the World Wide Web
Top-k aggregation using intersections of ranked inputs
Proceedings of the Second ACM International Conference on Web Search and Data Mining
Inverted index compression and query processing with optimized document ordering
Proceedings of the 18th international conference on World wide web
Selective-NRA Algorithms for Top-k Queries
APWeb/WAIM '09 Proceedings of the Joint International Conferences on Advances in Data and Web Management
Effective top-k computation with term-proximity support
Information Processing and Management: an International Journal
Factor Analysis of Incidence Data via Novel Decomposition of Matrices
ICFCA '09 Proceedings of the 7th International Conference on Formal Concept Analysis
Toward personalized peer-to-peer top-k processing
Proceedings of the Second ACM EuroSys Workshop on Social Network Systems
CoPhIR Image Collection under the Microscope
SISAP '09 Proceedings of the 2009 Second International Workshop on Similarity Search and Applications
Group recommendation: semantics and efficiency
Proceedings of the VLDB Endowment
Revisiting globally sorted indexes for efficient document retrieval
Proceedings of the third ACM international conference on Web search and data mining
Early exit optimizations for additive machine learned ranking systems
Proceedings of the third ACM international conference on Web search and data mining
Gossiping personalized queries
Proceedings of the 13th International Conference on Extending Database Technology
Relational algebra for ranked tables with similarities: properties and implementation
IDA'07 Proceedings of the 7th international conference on Intelligent data analysis
Query systems in similarity-based databases: logical foundations, expressive power, and completeness
Proceedings of the 2010 ACM Symposium on Applied Computing
Adaptive relaxation for querying heterogeneous XML data sources
Information Systems
Efficient top-k search across heterogeneous XML data sources
DASFAA'08 Proceedings of the 13th international conference on Database systems for advanced applications
The gist of everything new: personalized top-k processing over web 2.0 streams
CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
Efficient term proximity search with term-pair indexes
CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
Space efficiency in group recommendation
The VLDB Journal — The International Journal on Very Large Data Bases
Ranking with uncertain scoring functions: semantics and sensitivity measures
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Complex pattern ranking (CPR): evaluating top-k pattern queries over event streams
Proceedings of the 5th ACM international conference on Distributed event-based system
Faster top-k document retrieval using block-max indexes
Proceedings of the 34th international ACM SIGIR conference on Research and development in Information Retrieval
Collaborative personalized top-k processing
ACM Transactions on Database Systems (TODS)
Similarity of query results in similarity-based databases
RSKT'11 Proceedings of the 6th international conference on Rough sets and knowledge technology
Towards top-k query answering in description logics: the case of DL-Lite
JELIA'06 Proceedings of the 10th European conference on Logics in Artificial Intelligence
Efficient monitoring of personalized hot news over Web 2.0 streams
Computer Science - Research and Development
Toward consistent evaluation of relevance feedback approaches in multimedia retrieval
AMR'05 Proceedings of the Third international conference on Adaptive Multimedia Retrieval: user, context, and feedback
Efficient top-k document retrieval using a term-document binary matrix
AIRS'11 Proceedings of the 7th Asia conference on Information Retrieval Technology
Combining top-k query in road networks
WAIM'11 Proceedings of the 2011 international conference on Web-Age Information Management
Attribute implications in similarity-based databases: semantic entailment and nonredundant bases
Proceedings of the 27th Annual ACM Symposium on Applied Computing
A top-k query answering procedure for fuzzy logic programming
Fuzzy Sets and Systems
Processing continuous text queries featuring non-homogeneous scoring functions
Proceedings of the 21st ACM international conference on Information and knowledge management
An efficient reasoning method for dependencies over similarity and ordinal data
MDAI'12 Proceedings of the 9th international conference on Modeling Decisions for Artificial Intelligence
Optimizing top-k document retrieval strategies for block-max indexes
Proceedings of the sixth ACM international conference on Web search and data mining
An incremental approach to efficient pseudo-relevance feedback
Proceedings of the 36th international ACM SIGIR conference on Research and development in information retrieval
A candidate filtering mechanism for fast top-k query processing on modern cpus
Proceedings of the 36th international ACM SIGIR conference on Research and development in information retrieval
Top-k diversity queries over bounded regions
ACM Transactions on Database Systems (TODS)
| Hi-index | 0.00 |
Assume that each object in a database has m grades, or scores, one for each of m attributes. For example, an object can have a color grade, that tells how red it is, and a shape grade, that tells how round it is. For each attribute, there is a sorted list, which lists each object and its grade under that attribute, sorted by grade (highest grade first). Each object is assigned an overall grade, that is obtained by combining the attribute grades using a fixed monotone aggregation function, or combining rule, such as min or average. In this overview, we discuss and compare algorithms for determining the top k objects, that is, k objects with the highest overall grades.