CORE
πΊπ¦Β
Β make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
research
Fast evaluation of union-intersection expressions
Authors
Philip Bille
Anna Pagh
Rasmus Pagh
Publication date
1 January 2007
Publisher
View
on
arXiv
Abstract
We show how to represent sets in a linear space data structure such that expressions involving unions and intersections of sets can be computed in a worst-case efficient way. This problem has applications in e.g. information retrieval and database systems. We mainly consider the RAM model of computation, and sets of machine words, but also state our results in the I/O model. On a RAM with word size
w
w
w
, a special case of our result is that the intersection of
m
m
m
(preprocessed) sets, containing
n
n
n
elements in total, can be computed in expected time
O
(
n
(
log
β‘
w
)
2
/
w
+
k
m
)
O(n (\log w)^2 / w + km)
O
(
n
(
lo
g
w
)
2
/
w
+
km
)
, where
k
k
k
is the number of elements in the intersection. If the first of the two terms dominates, this is a factor
w
1
β
o
(
1
)
w^{1-o(1)}
w
1
β
o
(
1
)
faster than the standard solution of merging sorted lists. We show a cell probe lower bound of time
Ξ©
(
n
/
(
w
m
log
β‘
m
)
+
(
1
β
log
β‘
k
w
)
k
)
\Omega(n/(w m \log m)+ (1-\tfrac{\log k}{w}) k)
Ξ©
(
n
/
(
w
m
lo
g
m
)
+
(
1
β
w
l
o
g
k
β
)
k
)
, meaning that our upper bound is nearly optimal for small
m
m
m
. Our algorithm uses a novel combination of approximate set representations and word-level parallelism
Similar works
Full text
Available Versions
CiteSeerX
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:CiteSeerX.psu:10.1.1.87.67...
Last time updated on 22/10/2014
The IT University of Copenhagen's Repository
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:pure.atira.dk:publications...
Last time updated on 29/08/2018