244 search results - page 1 / 49 » Fast Set Intersection in Memory |
CORR
2011
Springer
12 years 11 months ago
2011
Springer
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 int...
SPAA
1998
ACM
13 years 9 months ago
1998
ACM
We present parallel algorithms for union, intersection and difference on ordered sets using random balanced binary trees (treaps [26]). For two sets of size n and m (m ≤ n) the...
ICDE
2012
IEEE
11 years 7 months ago
2012
IEEE
— In this paper, we focus on efficient keyword query processing for XML data based on SLCA and ELCA semantics. We propose for each keyword a novel form of inverted list, which i...
VMV
2004
13 years 6 months ago
2004
Visualizing iso-surfaces of volumetric data sets is becoming increasingly important for many practical applications. One crucial task in iso-surface ray tracing is to find the cor...
JVCA
2006
13 years 4 months ago
2006
The triangle-to-triangle intersection test is a basic component of all collision detection data structures and algorithms. This paper presents a fast method for testing whether tw...