A fast set intersection algorithm for sorted sequences

DOI10.1007/978-3-540-27801-6_30MaRDI QIDQ5315348zbMATH OpenFDO

Authors Ricardo Baeza-Yates

Publication date 7 September 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-27801-6_30

zbMATH Keywords

inverted indicesmergingmultiple searchSet operationsWeb search engines

Mathematics Subject Classification ID

Searching and sorting (68P10)

Recommendations

• Fast Intersection Algorithms for Sorted Sequences
• An experimental investigation of set intersection algorithms for text searching
• Experiments on adaptive set intersections for text retrieval systems
• scientific article; zbMATH DE number 1445373
• Fast Evaluation of Union-Intersection Expressions

Cited in

(29)

• \(k\)-difference matching in amortized linear time for all the words in a text
• A new optimal distributed algorithm for the set intersection problem
• A fast algorithm for finding interlocking sets
• Intersection reporting on two collections of disjoint sets
• Finding and enumerating large intersections
• Adaptive searching in succinctly encoded binary relations and tree-structured documents
• From time to space: fast algorithms that yield small and fast data structures
• Set intersection and sequence matching with mismatch counting
• An efficient method to evaluate intersections on big data sets
• Efficient optimally lazy algorithms for minimal-interval semantics
• Dynamic set intersection
• Fast set intersection and two-patterns matching
• Fast Intersection Algorithms for Sorted Sequences
• Irredundant Set Faster Than O(2 n )
• Evaluation of General Set Expressions
• New algorithms on wavelet trees and applications to information retrieval
• scientific article; zbMATH DE number 2119687 (Why is no real title available?)
• scientific article; zbMATH DE number 1445373 (Why is no real title available?)
• Alternation and redundancy analysis of the intersection problem
• Algorithms and Computation
• Efficient set intersection counting algorithm for text similarity measures
• Intersection in integer inverted indices
• Fast Evaluation of Union-Intersection Expressions
• An experimental investigation of set intersection algorithms for text searching
• Stochastic Algorithms: Foundations and Applications
• An output sensitive solution to the set union and intersection problem
• Trie-compressed adaptive set intersection
• Towards optimal set-disjointness and set-intersection data structures
• Fast set intersection and two-patterns matching

This page was built for publication: A fast set intersection algorithm for sorted sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5315348)