Sciweavers

43 search results - page 3 / 9
» The relative efficiency of data compression by LZW and LZSS
Sort
View
KDD
1999
ACM
206views Data Mining» more  KDD 1999»
13 years 10 months ago
Compressed Data Cubes for OLAP Aggregate Query Approximation on Continuous Dimensions
Efficiently answering decision support queries is an important problem. Most of the work in this direction has been in the context of the data cube. Queries are efficiently answer...
Jayavel Shanmugasundaram, Usama M. Fayyad, Paul S....
MASCOTS
2004
13 years 7 months ago
MRAMFS: A Compressing File System for Non-Volatile RAM
File systems using non-volatile RAM (NVRAM) promise great improvements in file system performance over conventional disk storage. However, current technology allows for a relative...
Nathan K. Edel, Deepa Tuteja, Ethan L. Miller, Sco...
DCC
2004
IEEE
14 years 5 months ago
Fast Near-Lossless or Lossless Compression of Large 3D Neuro-Anatomical Images
3D neuro-anatomical images and other volumetric data sets are important in many scientific and biomedical fields. Since such sets may be extremely large, a scalable compression me...
Rongkai Zhao, Michael Gabriel, Geneva G. Belford
ICDE
2007
IEEE
139views Database» more  ICDE 2007»
14 years 7 months ago
Updating Recursive XML Views of Relations
This paper investigates the view update problem for XML views published from relational data. We consider (possibly) recursively defined XML views, compressed into DAGs and stored...
Byron Choi, Gao Cong, Wenfei Fan, Stratis Viglas
LCPC
2000
Springer
13 years 9 months ago
Efficient Dynamic Local Enumeration for HPF
In translating HPF programs, a compiler has to generate local iteration and communication sets. Apart from local enumeration, local storage compression is an issue, because in HPF ...
Will Denissen, Henk J. Sips