Database Reference
In-Depth Information
Bassiouni, M. A. (1985). Data Compression
in Scientific and Statistical Databases.
IEEE
Transactions on Software Engineering
,
11
(10),
1047-1057. doi:10.1109/TSE.1985.231852
Dehne, F., Eavis, T., & Andrew, R. (2001). Coarse
grained parallel on-line analytical processing
(OLAP) for data mining. In
Proceedings of ICCS
2001
.
Buccafurri, F., Furfaro, F., Sacca, D., & Sirangelo,
C. (2003). A quad tree based multiresolution ap-
proach for compressing datacube.
SSDBM
,
2003
,
127-140.
Dipperstein, M. (2008).
Huffman Code Discus-
sion and Implementation
. Received March 4,
2009 http://michael.dipperstein.com/huffman/
index.html.
Chan, C., & Ioannidis, Y. (1998) Bitmap index
design and evaluation.
ACM SIGMOID
(pp.
355-366).
Eggers, S., & Shohani,A. (1980). EfficientAccess
of Compressed Data. In
Proceedings of sixth int'l
conference on Very large Databases
, 205-211.
Chun, Y. L., Yeh, C. C., & Jen, S. L. (2002). Effi-
cient Representation Scheme for Multidimensional
Array Operations.
IEEE Transactions on Comput-
ers
,
51
(3), 327-345. doi:10.1109/12.990130
Emmanuel, J. C., & David, L. D. (1999) Curvelets -
a surprisingly effective nonadaptive representation
for objects with edges. In
Curves and Surfaces
.
Geffner, S., Agrawal, D., Abbadi, A. E., & Smith,
T. R. (1999) Relative prefix sums:An efficient ap-
proach for querying dynamic OLAP data cubes. In
Proceedings of International Conference of Data
Engineering (ICDE)
, (pp. 328-335). Washington,
DC: IEEE CS.
Chun, Y. L., Yeh, C. C., & Jen, S. L. (2003).
Efficient Data Parallel Algorithms for Multidi-
mensional Array Operations Based on the EKMR
Scheme for Distributed Memory Multicomput-
ers.
IEEE Transactions on Parallel and Dis-
tributed Systems
,
14
(7), 625-639. doi:10.1109/
TPDS.2003.1214316
Hasan, K. M. A., Kuroda, M., Azuma, N., Tsuji,
T., & Higuchi, K. (2005). An extendible array
based implementation of relational tables for
multidimensional databases. In
Proceedings of
7th International Conference on Data Warehous-
ing and Knowledge Discovery (DaWaK'05)
(pp.
233-242). Heidelberg: Springer-Verlag.
Chun, Y. L., Yeh, C. C., & Jen, S. L. (2003).
Efficient Data Compression Method for Mul-
tidimensional Sparse Array Operations Based
on EKMR Scheme.
IEEE Transactions on
Computers
,
52
(12), 1640-1648. doi:10.1109/
TC.2003.1252859
Hasan, K. M. A., Tsuji, T., & Higuchi, K. (2006).
A Parallel Implementation Scheme of Relational
Tables Based on Multidimensional Extendible
Array.
International Journal of Data Warehousing
and Mining
,
2
(4), 66-85.
Datta, A., & Thomas, H. (2002). Querying Com-
pressed Data in Data Warehouses. [Dordrecht,
The Netherlands: Springer Netherlands.].
Journal
of Information Technology Management
,
3
(4),
353-386. doi:10.1023/A:1019772807859
Hasan, K. M. A., Tsuji, T., & Higuchi, K. (2007).
An Efficient Implementation for MOLAP Basic
Data Structure and Its Evaluation, In
Proceedings
of DASFAA 2007
, (LNCS 4443, pp. 288 - 299).
Heidelberg: Springer-Verlag.
David, L., Vetterli, M., Daubechies, I., & Ron, A.
(1998). Data compression and harmonic analysis.
IEEE Transactions on Information Theory
, 44.
Search WWH ::
Custom Search