Experiments on adaptive set intersections for text retrieval systems

DOI10.1007/3-540-44808-X_7MaRDI QIDQ4801183zbMATH OpenFDO

Authors Erik D. Demaine, J. Ian Munro, Alejandro Lopez-Ortiz

Publication date 7 April 2003

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2153/21530091.htm

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Computing methodologies and applications (68U99)

Recommendations

• An experimental investigation of set intersection algorithms for text searching
• Efficient set intersection counting algorithm for text similarity measures
• A hybrid relevance-feedback approach to text retrieval

Cited in

(8)

• Adaptive searching in succinctly encoded binary relations and tree-structured documents
• Efficient optimally lazy algorithms for minimal-interval semantics
• scientific article; zbMATH DE number 2119687 (Why is no real title available?)
• scientific article; zbMATH DE number 1445373 (Why is no real title available?)
• Efficient set intersection counting algorithm for text similarity measures
• A fast set intersection algorithm for sorted sequences
• An experimental investigation of set intersection algorithms for text searching
• Trie-compressed adaptive set intersection

This page was built for publication: Experiments on adaptive set intersections for text retrieval systems

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