Amortized efficiency of list update and paging rules
Communications of the ACM
One, two, three . . . infinity: lower bounds for parallel computation
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Automatic text processing: the transformation, analysis, and retrieval of information by computer
Automatic text processing: the transformation, analysis, and retrieval of information by computer
Randomized algorithms
Optimizing queries over multimedia repositories
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Approximation algorithms for NP-hard problems
Approximation algorithms for NP-hard problems
Online computation and competitive analysis
Online computation and competitive analysis
Combining fuzzy information from multiple systems
Journal of Computer and System Sciences
R × W: a scheduling approach for large-scale on-demand data broadcast
IEEE/ACM Transactions on Networking (TON)
Adaptive set intersections, unions, and differences
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
An Optimal Algorithm for Monte Carlo Estimation
SIAM Journal on Computing
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
Towards heterogeneous multimedia information systems: the Garlic approach
RIDE '95 Proceedings of the 5th International Workshop on Research Issues in Data Engineering-Distributed Object Management (RIDE-DOM'95)
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
Group Modeling: Selecting a Sequence of Television Items to Suit a Group of Viewers
User Modeling and User-Adapted Interaction
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Evaluating top-k queries over web-accessible databases
ACM Transactions on Database Systems (TODS)
On the memory requirements of XPath evaluation over XML streams
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Buffering in query evaluation over XML streams
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
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
The SphereSearch engine for unified ranked retrieval of heterogeneous XML and web documents
VLDB '05 Proceedings of the 31st international conference on Very large data bases
An efficient and versatile query engine for TopX search
VLDB '05 Proceedings of the 31st international conference on Very large data bases
KLEE: a framework for distributed top-k query algorithms
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Optimizing cursor movement in holistic twig joins
Proceedings of the 14th ACM international conference on Information and knowledge management
Proceedings of the 15th international conference on World Wide Web
Reducing network traffic in unstructured P2P systems using Top-k queries
Distributed and Parallel Databases
Filter ranking in high-dimensional space
Data & Knowledge Engineering
Ranking objects based on relationships
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Veracity radius: capturing the locality of distributed computations
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Type less, find more: fast autocompletion search with a succinct index
SIGIR '06 Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval
IO-Top-k: index-access optimized top-k query processing
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
The database research group at the Max-Planck Institute for Informatics
ACM SIGMOD Record
On the memory requirements of XPath evaluation over XML streams
Journal of Computer and System Sciences
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
ACM Transactions on the Web (TWEB)
Reverse Nearest Neighbors Search in Ad Hoc Subspaces
IEEE Transactions on Knowledge and Data Engineering
Rank Aggregation for Automatic Schema Matching
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
Efficient top-k processing in large-scaled distributed environments
Data & Knowledge Engineering
A time machine for text search
SIGIR '07 Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval
Efficiency-quality tradeoffs for vector score aggregation
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
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
Sum-max monotonic ranked joins for evaluating top-k twig queries on weighted data graphs
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
A general framework for modeling and processing optimization queries
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
A rank algebra to support multimedia mining applications
Proceedings of the 8th international workshop on Multimedia data mining: (associated with the ACM SIGKDD 2007)
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
Multi-dimensional search for personal information management systems
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
Ad-hoc aggregations of ranked lists in the presence of hierarchies
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Stretch 'n' shrink: resizing queries to user preferences
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Evaluating rank joins with optimal cost
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Probabilistic top-k and ranking-aggregate queries
ACM Transactions on Database Systems (TODS)
Efficient top-k querying over social-tagging networks
Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval
To tag or not to tag -: harvesting adjacent metadata in large-scale tagging systems
Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval
A survey of top-k query processing techniques in relational database systems
ACM Computing Surveys (CSUR)
Semantic representation of multimedia content: Knowledge representation and semantic indexing
Multimedia Tools and Applications
POT: an efficient top-k monitoring method for spatially correlated sensor readings
Proceedings of the 5th workshop on Data management for sensor networks
Efficient Computation of Statistical Significance of Query Results in Databases
SSDBM '08 Proceedings of the 20th international conference on Scientific and Statistical Database Management
Smooth Interpolating Histograms with Error Guarantees
BNCOD '08 Proceedings of the 25th British national conference on Databases: Sharing Data, Information and Knowledge
Efficient Top-k Data Sources Ranking for Query on Deep Web
WISE '08 Proceedings of the 9th international conference on Web Information Systems Engineering
Optimizing Distributed Top-k Queries
WISE '08 Proceedings of the 9th international conference on Web Information Systems Engineering
Extending Fagin's Algorithm for More Users Based on Multidimensional B-Tree
ADBIS '08 Proceedings of the 12th East European conference on Advances in Databases and Information Systems
The VLDB Journal — The International Journal on Very Large Data Bases
Authenticating the query results of text search engines
Proceedings of the VLDB Endowment
Efficient search for the top-k probable nearest neighbors in uncertain databases
Proceedings of the VLDB Endowment
Scalable ranked publish/subscribe
Proceedings of the VLDB Endowment
Relaxation in text search using taxonomies
Proceedings of the VLDB Endowment
Efficient network aware search in collaborative tagging sites
Proceedings of the VLDB Endowment
Making SENSE: socially enhanced search and exploration
Proceedings of the VLDB Endowment
Similarity-based prediction of travel times for vehicles traveling on known routes
Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems
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
The geometry of binary search trees
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Top-k aggregation using intersections of ranked inputs
Proceedings of the Second ACM International Conference on Web Search and Data Mining
Foundations and Trends in Databases
MINERVA∞: a scalable efficient peer-to-peer search engine
Proceedings of the ACM/IFIP/USENIX 2005 International Conference on Middleware
Anonymizing moving objects: how to hide a MOB in a crowd?
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
AlphaSum: size-constrained table summarization using value lattices
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Efficient skyline retrieval with arbitrary similarity measures
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
A search-based method for forecasting ad impression in contextual advertising
Proceedings of the 18th international conference on World wide web
Anytime measures for top-k algorithms on exact and fuzzy data sets
The VLDB Journal — The International Journal on Very Large Data Bases
Instance optimal query processing in spatial networks
The VLDB Journal — The International Journal on Very Large Data Bases
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Ontology-Based Service Discovery Front-End Interface for GloServ
ESWC 2009 Heraklion Proceedings of the 6th European Semantic Web Conference on The Semantic Web: Research and Applications
Distributed top-k aggregation queries at large
Distributed and Parallel Databases
Engineering search computing applications: vision and challenges
Proceedings of the the 7th joint meeting of the European software engineering conference and the ACM SIGSOFT symposium on The foundations of software engineering
Fast shortest path distance estimation in large networks
Proceedings of the 18th ACM conference on Information and knowledge management
Evaluating top-k queries over incomplete data streams
Proceedings of the 18th ACM conference on Information and knowledge management
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
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
Proceedings of the VLDB Endowment
A fair assignment algorithm for multiple preference queries
Proceedings of the VLDB Endowment
Subspace Discovery for Promotion: A Cell Clustering Approach
DS '09 Proceedings of the 12th International Conference on Discovery Science
Comparison of Scoring and Order Approach in Description Logic $\mathcal{EL(D)}$
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
Revisiting globally sorted indexes for efficient document retrieval
Proceedings of the third ACM international conference on Web search and data mining
Maintenance of top-k materialized views
Distributed and Parallel Databases
Probabilistic ranking over relations
Proceedings of the 13th International Conference on Extending Database Technology
Top-k query processing in the APPA P2P system
VECPAR'06 Proceedings of the 7th international conference on High performance computing for computational science
Efficient processing of relational queries with sum constraints
APWeb/WAIM'07 Proceedings of the joint 9th Asia-Pacific web and 8th international conference on web-age information management conference on Advances in data and web management
Threshold-based probabilistic top-k dominating queries
The VLDB Journal — The International Journal on Very Large Data Bases
Efficient text proximity search
SPIRE'07 Proceedings of the 14th international conference on String processing and information retrieval
HiPC'07 Proceedings of the 14th international conference on High performance computing
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Durable top-k search in document archives
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Constructing and exploring composite items
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Efficient processing of exact top-k queries over disk-resident sorted lists
The VLDB Journal — The International Journal on Very Large Data Bases
Breaking out of the box of recommendations: from items to packages
Proceedings of the fourth ACM conference on Recommender systems
On continuous monitoring top-k unsafe moving objects
Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems
Energy-efficient top-k query processing in wireless sensor networks
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
Efficient wikipedia-based semantic interpreter by exploiting top-k processing
CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
Subspace similarity search: efficient k-NN queries in arbitrary subspaces
SSDBM'10 Proceedings of the 22nd international conference on Scientific and statistical database management
A framework for corroborating answers from multiple web sources
Information Systems
Navigating in complex mashed-up applications
Proceedings of the VLDB Endowment
Proceedings of the VLDB Endowment
Retrieving top-k prestige-based relevant spatial web objects
Proceedings of the VLDB Endowment
Efficient and effective similarity search over probabilistic data based on earth mover's distance
Proceedings of the VLDB Endowment
Proceedings of the VLDB Endowment
Optimal top-k query evaluation for weighted business processes
Proceedings of the VLDB Endowment
Efficient RkNN retrieval with arbitrary non-metric similarity measures
Proceedings of the VLDB Endowment
Efficient processing of top-k spatial preference queries
Proceedings of the VLDB Endowment
Unified structure and content search for personal information management systems
Proceedings of the 14th International Conference on Extending Database Technology
TopRecs: Top-k algorithms for item-based collaborative filtering
Proceedings of the 14th International Conference on Extending Database Technology
Efficient reverse skyline retrieval with arbitrary non-metric similarity measures
Proceedings of the 14th International Conference on Extending Database Technology
RanKloud: a scalable ranked query processing framework on hadoop
Proceedings of the 14th International Conference on Extending Database Technology
Hyper-local, directions-based ranking of places
Proceedings of the VLDB Endowment
Supporting early pruning in top-k query processing on massive data
Information Processing Letters
Search computing
Proximity rank join in search computing
Search computing
Best position algorithms for efficient top-k query processing
Information Systems
Peer-to-peer web search: euphoria, achievements, disillusionment, and future opportunities
From active data management to event-based systems and more
Maximizing conjunctive views in deletion propagation
Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Reverse spatial and textual k nearest neighbor search
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
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
SNFS: the design and implementation of a social network file system
Proceedings of the 4th Workshop on Social Network Systems
Index design and query processing for graph conductance search
The VLDB Journal — The International Journal on Very Large Data Bases
Efficient similarity joins for near-duplicate detection
ACM Transactions on Database Systems (TODS)
Improving local search ranking through external logs
Proceedings of the 34th international ACM SIGIR conference on Research and development in Information Retrieval
Preference-based top-k spatial keyword queries
Proceedings of the 1st international workshop on Mobile location-based service
Parallel data access for multiway rank joins
ICWE'11 Proceedings of the 11th international conference on Web engineering
Trajectory anonymity in publishing personal mobility data
ACM SIGKDD Explorations Newsletter
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 approximate similarity search using random projection learning
WAIM'11 Proceedings of the 12th international conference on Web-age information management
Upper-bound approximations for dynamic pruning
ACM Transactions on Information Systems (TOIS)
Factorization-based lossless compression of inverted indices
Proceedings of the 20th ACM international conference on Information and knowledge management
Finding information nebula over large networks
Proceedings of the 20th ACM international conference on Information and knowledge management
Adding structure to top-k: from items to expansions
Proceedings of the 20th ACM international conference on Information and knowledge management
TEXplorer: keyword-based object search and exploration in multidimensional text databases
Proceedings of the 20th ACM international conference on Information and knowledge management
Query efficiency prediction for dynamic pruning
Proceedings of the 9th workshop on Large-scale and distributed informational retrieval
Top-k query processing for combinatorial objects using Euclidean distance
Proceedings of the 15th Symposium on International Database Engineering & Applications
Building wavelet histograms on large data in MapReduce
Proceedings of the VLDB Endowment
High-performance processing of text queries with tunable pruned term and term pair indexes
ACM Transactions on Information Systems (TOIS)
INEX'05 Proceedings of the 4th international conference on Initiative for the Evaluation of XML Retrieval
Information Sciences: an International Journal
Proximity measures for rank join
ACM Transactions on Database Systems (TODS)
Expressiveness and performance of full-text search languages
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
Optimized top-k processing with global page scores on block-max indexes
Proceedings of the fifth ACM international conference on Web search and data mining
Fast top-k retrieval for model based recommendation
Proceedings of the fifth ACM international conference on Web search and data mining
Nearest neighbor search on vertically partitioned high-dimensional data
DaWaK'05 Proceedings of the 7th international conference on Data Warehousing and Knowledge Discovery
Finding the plateau in an aggregated time series
WAIM '06 Proceedings of the 7th international conference on Advances in Web-Age Information Management
OverCite: a cooperative digital research library
IPTPS'05 Proceedings of the 4th international conference on Peer-to-Peer Systems
Relation-collapse: an optimisation technique for the similarity algebra SA
ADBIS'05 Proceedings of the 9th East European conference on Advances in Databases and Information Systems
A service-oriented grid infrastructure for multimedia management and search
DELOS'04 Proceedings of the 6th Thematic conference on Peer-to-Peer, Grid, and Service-Orientation in Digital Library Architectures
Incrementally computing ordered answers of acyclic conjunctive queries
NGITS'06 Proceedings of the 6th international conference on Next Generation Information Technologies and Systems
Chapter 11: rank-join algorithms for search computing
Search Computing
MINERVA∞: a scalable efficient peer-to-peer search engine
Middleware'05 Proceedings of the ACM/IFIP/USENIX 6th international conference on Middleware
Optimally adaptive integration of univariate lipschitz functions
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Supporting efficient distributed skyline computation using skyline views
Information Sciences: an International Journal
On the complexity of package recommendation problems
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
Optimal top-k generation of attribute combinations based on ranked lists
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
Efficient approximation of the maximal preference scores by lightweight cubic views
Proceedings of the 15th International Conference on Extending Database Technology
On the semantics of top-k ranking for objects with uncertain data
Computers & Mathematics with Applications
On optimality-ratio and coverage in ranking of joined search results
Distributed and Parallel Databases
Distributed top-k full-text content dissemination
Distributed and Parallel Databases
Social networks profile mapping using games
WebApps'12 Proceedings of the 3rd USENIX conference on Web Application Development
Learning to predict response times for online query scheduling
SIGIR '12 Proceedings of the 35th international ACM SIGIR conference on Research and development in information retrieval
Proceedings of the VLDB Endowment
Maximizing Conjunctive Views in Deletion Propagation
ACM Transactions on Database Systems (TODS)
Processing top-k queries in distributed hash tables
Euro-Par'07 Proceedings of the 13th international Euro-Par conference on Parallel Processing
Being picky: processing top-k queries with set-defined selections
Proceedings of the 21st ACM international conference on Information and knowledge management
TJJE: An efficient algorithm for top-k join on massive data
Information Sciences: an International Journal
User-oriented product search based on consumer values and lifestyles
PKAW'12 Proceedings of the 12th Pacific Rim conference on Knowledge Management and Acquisition for Intelligent Systems
A framework for efficient spatial web object retrieval
The VLDB Journal — The International Journal on Very Large Data Bases
A preference-aware query model for data web services
ER'12 Proceedings of the 31st international conference on Conceptual Modeling
Efficient and effective retrieval using selective pruning
Proceedings of the sixth ACM international conference on Web search and data mining
Efficient and Effective Aggregate Keyword Search on Relational Databases
International Journal of Data Warehousing and Mining
Computing immutable regions for subspace top-k queries
Proceedings of the VLDB Endowment
Actively soliciting feedback for query answers in keyword search-based data integration
Proceedings of the VLDB Endowment
Efficient top-k query answering using cached views
Proceedings of the 16th International Conference on Extending Database Technology
Determining the relative accuracy of attributes
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Faster upper bounding of intersection sizes
Proceedings of the 36th international ACM SIGIR conference on Research and development in information retrieval
Top-k queries over web applications
The VLDB Journal — The International Journal on Very Large Data Bases
Generating informative snippet to maximize item visibility
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Context-aware top-K processing using views
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Efficient identification and approximation of k-nearest moving neighbors
Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
BNCOD'13 Proceedings of the 29th British National conference on Big Data
User-Contributed relevance and nearest neighbor queries
SSTD'13 Proceedings of the 13th international conference on Advances in Spatial and Temporal Databases
Diversified top-k graph pattern matching
Proceedings of the VLDB Endowment
Bitlist: new full-text index for low space cost and efficient keyword search
Proceedings of the VLDB Endowment
On the complexity of query result diversification
Proceedings of the VLDB Endowment
Making queries tractable on big data with preprocessing: through the eyes of complexity theory
Proceedings of the VLDB Endowment
Answering planning queries with the crowd
Proceedings of the VLDB Endowment
Skyline queries, front and back
ACM SIGMOD Record
Effective ranking and search techniques for Web resources considering semantic relationships
Information Processing and Management: an International Journal
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. To determine the top k objects, that is, k objects with the highest overall grades, the naive algorithm must access every object in the database, to find its grade under each attribute. Fagin has given an algorithm ("Fagin's Algorithm", or FA) that is much more efficient. For some monotone aggregation functions, FA is optimal with high probability in the worst case. We analyze an elegant and remarkably simple algorithm ("the threshold algorithm", or TA) that is optimal in a much stronger sense than FA. We show that TA is essentially optimal, not just for some monotone aggregation functions, but for all of them, and not just in a high-probability worst-case sense, but over every database. Unlike FA, which requires large buffers (whose size may grow unboundedly as the database size grows), TA requires only a small, constant-size buffer. TA allows early stopping, which yields, in a precise sense, an approximate version of the top k answers. We distinguish two types of access: sorted access (where the middleware system obtains the grade of an object in some sorted list by proceeding through the list sequentially from the top), and random access (where the middleware system requests the grade of object in a list, and obtains it in one step). We consider the scenarios where random access is either impossible, or expensive relative to sorted access, and provide algorithms that are essentially optimal for these cases as well.