A survey of adaptive sorting algorithms
ACM Computing Surveys (CSUR)
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Adaptive set intersections, unions, and differences
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Lazy, adaptive rid-list intersection, and its application to index anding
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Alternation and redundancy analysis of the intersection problem
ACM Transactions on Algorithms (TALG)
An experimental investigation of set intersection algorithms for text searching
Journal of Experimental Algorithmics (JEA)
Improving the performance of list intersection
Proceedings of the VLDB Endowment
Compact set representation for information retrieval
SPIRE'07 Proceedings of the 14th international conference on String processing and information retrieval
Fast evaluation of union-intersection expressions
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Efficient set intersection for inverted indexing
ACM Transactions on Information Systems (TOIS)
Adaptive algorithms for planar convex hull problems
FAW'10 Proceedings of the 4th international conference on Frontiers in algorithmics
Compressed self-indices supporting conjunctive queries on document collections
SPIRE'10 Proceedings of the 17th international conference on String processing and information retrieval
SPIRE'10 Proceedings of the 17th international conference on String processing and information retrieval
Fast set intersection in memory
Proceedings of the VLDB Endowment
Succinct nearest neighbor search
Proceedings of the Fourth International Conference on SImilarity Search and APplications
Word-based self-indexes for natural language text
ACM Transactions on Information Systems (TOIS)
Faster adaptive set intersections for text searching
WEA'06 Proceedings of the 5th international conference on Experimental Algorithms
Adaptive searching in succinctly encoded binary relations and tree-structured documents
CPM'06 Proceedings of the 17th Annual conference on Combinatorial Pattern Matching
New algorithms on wavelet trees and applications to information retrieval
Theoretical Computer Science
Fast intersection algorithms for sorted sequences
Algorithms and Applications
Experimental analysis of a fast intersection algorithm for sorted sequences
SPIRE'05 Proceedings of the 12th international conference on String Processing and Information Retrieval
Polyphasic metric index: reaching the practical limits of proximity searching
SISAP'12 Proceedings of the 5th international conference on Similarity Search and Applications
Faster and smaller inverted indices with treaps
Proceedings of the 36th international ACM SIGIR conference on Research and development in information retrieval
On the compression of search trees
Information Processing and Management: an International Journal
| Hi-index | 0.00 |
Consider the problem of computing the intersection of k sorted sets. In the comparison model, we prove a new lower bound which depends on the non-deterministic complexity of the instance, and implies that the algorithm of Demaine, López-Ortiz and Munro [2] is usually optimal in this "adaptive" sense. We extend the lower bound and the algorithm to the t-Threshold Problem, which consists in finding the elements which are in at least t of the k sets. These problems are motivated by boolean queries in text database systems.