2662 search results - page 17 / 533 » Data Compression Support in Databases |
CORR
2010
Springer
14 years 4 months ago
2010
Springer
LRM-Trees are an elegant way to partition a sequence of values into sorted consecutive blocks, and to express the relative position of the first element of each block within a prev...
KDD
2009
ACM
15 years 10 months ago
2009
ACM
All Netflix Prize algorithms proposed so far are prohibitively costly for large-scale production systems. In this paper, we describe an efficient dataflow implementation of a coll...
WISE
2002
Springer
15 years 2 months ago
2002
Springer
The need of using spatial vector data for web-based and mobile applications has been increasing rapidly. Vector spatial data is difficult to generalise (that is, to derive a suita...
SIGMOD
2001
ACM
15 years 9 months ago
2001
ACM
In this paper, we investigate how to scale hierarchical clustering methods (such as OPTICS) to extremely large databases by utilizing data compression methods (such as BIRCH or ra...
VLDB
2001
ACM
15 years 2 months ago
2001
ACM
