184 search results - page 31 / 37 » A new range query algorithm for Universal B-trees |
STOC
2003
ACM
15 years 9 months ago
2003
ACM
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
ECIR
2008
Springer
14 years 11 months ago
2008
Springer
Information retrieval is an empirical science; the field cannot move forward unless there are means of evaluating the innovations devised by researchers. However the methodologies...
IPPS
2008
IEEE
15 years 4 months ago
2008
IEEE
Volunteer Computing is becoming a new paradigm not only for the Computational Grid, but also for institutions using production-level Data Grids because of the enormous storage pot...
ISAAC
2004
Springer
15 years 2 months ago
2004
Springer
Abstract. Range searching over tree cross products – a variant of classic range searching – recently has been introduced by Buchsbaum et al. (Proc. 8th ESA, vol. 1879 of LNCS, ...
102
click to vote
ICDM
2002
IEEE
15 years 2 months ago
2002
IEEE
The similarity join has become an important database primitive to support similarity search and data mining. A similarity join combines two sets of complex objects such that the r...