Sciweavers

922 search results - page 4 / 185
» A data mining approach to database compression
Sort
View
ICDE
1995
IEEE
98views Database» more  ICDE 1995»
14 years 8 months ago
Relational Database Compression Using Augmented Vector Quantization
Data compression is one way to alleviate the 1/0bottleneck problem faced by I/O-intensive applications such as databases. However, this approach is not widely used because of the ...
Wee Keong Ng, Chinya V. Ravishankar
ICDE
2010
IEEE
183views Database» more  ICDE 2010»
14 years 2 months ago
Estimating the compression fraction of an index using sampling
—Data compression techniques such as null suppression and dictionary compression are commonly used in today’s database systems. In order to effectively leverage compression, it...
Stratos Idreos, Raghav Kaushik, Vivek R. Narasayya...
KDD
1998
ACM
123views Data Mining» more  KDD 1998»
13 years 11 months ago
Scaling Clustering Algorithms to Large Databases
Practical clustering algorithms require multiple data scans to achieve convergence. For large databases, these scans become prohibitively expensive. We present a scalable clusteri...
Paul S. Bradley, Usama M. Fayyad, Cory Reina
ICDM
2006
IEEE
115views Data Mining» more  ICDM 2006»
14 years 1 months ago
Multi-Tier Granule Mining for Representations of Multidimensional Association Rules
It is a big challenge to promise the quality of multidimensional association mining. The essential issue is how to represent meaningful multidimensional association rules efficien...
Yuefeng Li, Wanzhong Yang, Yue Xu
SISAP
2010
IEEE
243views Data Mining» more  SISAP 2010»
13 years 5 months ago
Similarity matrix compression for efficient signature quadratic form distance computation
Determining similarities among multimedia objects is a fundamental task in many content-based retrieval, analysis, mining, and exploration applications. Among state-of-the-art sim...
Christian Beecks, Merih Seran Uysal, Thomas Seidl