A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Fast set intersection in memory
2011
Proceedings of the VLDB Endowment
Set intersection is a fundamental operation in information retrieval and database systems. This paper introduces linear space data structures to represent sets such that their intersection can be computed in a worst-case efficient way. In general, given k (preprocessed) sets, with totally n elements, we will show how to compute their intersection in expected time O(n/ √ w + kr), where r is the intersection size and w is the number of bits in a machine-word. In addition,we introduce a very
doi:10.14778/1938545.1938550
fatcat:rgb5c6lmivcurdl6xiqh6bwqna