75 search results - page 5 / 15 » Optimal splitters for database partitioning with size bounds |
ESA
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. In this paper we study the external memory planar point enclosure problem: Given N axis-parallel rectangles in the plane, construct a data structure on disk (an index) su...
ICDT
2001
ACM
14 years 3 days ago
2001
ACM
This paper presents a general methodology for the efficient parallelization of existing data cube construction algorithms. We describe two different partitioning strategies, one f...
SSDBM
2007
IEEE
14 years 1 months ago
2007
IEEE
We present a fast algorithm for computing approximate quantiles in high speed data streams with deterministic error bounds. For data streams of size N where N is unknown in advanc...
VLDB
1991
ACM
13 years 11 months ago
1991
ACM
A non-equijoin of relations R and S is a band join if the join predicate requires values in the join attribute of R to fall within a speci ed band about the values in the join att...
ICDE
2010
IEEE
14 years 7 months ago
2010
IEEE
Abstract-- This paper introduces a deterministic approximation algorithm with error guarantees for computing the probability of propositional formulas over discrete random variable...