An experimental investigation of set intersection algorithms for text searching

DOI10.1145/1498698.1564507zbMath1284.68222OpenAlexW2094154930MaRDI QIDQ5406215

Jérémy Barbay, Alejandro Salinger, Tyler Lu, Alejandro López-Ortiz

Publication date: 1 April 2014

Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1498698.1564507

zbMATH Keywords

set intersectiondatabase queries

Mathematics Subject Classification ID

Searching and sorting (68P10) Algorithms on strings (68W32)

Related Items (7)

An efficient method to evaluate intersections on big data sets ⋮ Compact binary relation representations with rich functionality ⋮ New algorithms on wavelet trees and applications to information retrieval ⋮ Wavelet trees for all ⋮ Efficient fully-compressed sequence representations ⋮ Spaces, Trees, and Colors ⋮ Compact and succinct data structures for multidimensional orthogonal range searching

This page was built for publication: An experimental investigation of set intersection algorithms for text searching