Sciweavers

2662 search results - page 12 / 533
» Data Compression Support in Databases
Sort
View
ICDE
2006
IEEE
158views Database» more  ICDE 2006»
14 years 11 months ago
Space-efficient Relative Error Order Sketch over Data Streams
We consider the problem of continuously maintaining order sketches over data streams with a relative rank error guarantee . Novel space-efficient and one-scan randomised technique...
Ying Zhang, Xuemin Lin, Jian Xu, Flip Korn, Wei Wa...
ICDE
2010
IEEE
491views Database» more  ICDE 2010»
14 years 9 months ago
TrajStore: An Adaptive Storage System for Very Large Trajectory Data Sets
The rise of GPS and broadband-speed wireless devices has led to tremendous excitement about a range of applications broadly characterized as "location based services". Cu...
Philippe Cudré-Mauroux, Eugene Wu, Samuel M...
DATESO
2009
158views Database» more  DATESO 2009»
13 years 7 months ago
Benchmarking Coding Algorithms for the R-tree Compression
Multi-dimensional data structures have been widely applied in many data management fields. Spatial data indexing is their natural application, however there are many applications i...
Jirí Walder, Michal Krátký, R...
DCC
2006
IEEE
14 years 9 months ago
Tradeoffs in XML Database Compression
Large XML data files, or XML databases, are now a common way to distribute scientific and bibliographic data, and storing such data efficiently is an important concern. A number o...
James Cheney
VLDB
2004
ACM
118views Database» more  VLDB 2004»
14 years 3 months ago
On the performance of bitmap indices for high cardinality attributes
It is well established that bitmap indices are efficient for read-only attributes with low attribute cardinalities. For an attribute with a high cardinality, the size of the bitma...
Kesheng Wu, Ekow J. Otoo, Arie Shoshani