Compression Schemes of High Dimensional Data for MOLAP - Evolving Application Domains of Data Warehousing and Mining - page 80

Hierachical Data Format (HDF) group. (2004).
HDF5 User's Guide . National Center for Super-
computing Applications (NCSA), University of
Illinois, Urbana-Champaign, Illinois, UrbanaCh-
ampaign, release 1.6.3. edition.

Ng, W., & Chinya, V. R. (1997). Block-oriented
compression techniques for large statistical
databases. IEEE Transactions on Knowl-
edge and Data Engineering , 9 (2), 314-328.
doi:10.1109/69.591455

Jin, D., Tsuji, T., Tsuchida, T., & Higuchi, K.
(2008). An Incremental Maintenance Scheme of
Data Cubes.In Proceedings of DASFAA 2008:
(pp. 172-187). Heidelberg: Springer-Verlag.

O'Neil, P. & Quass, (1997). Improved query
performance with variant indexes. In SIGMOID ,
(pp. 38-49).

Otoo, E. J., & Merrett, T. H. (1983). A storage
scheme for extendible arrays. Computing , 31 ,
1-9. doi:10.1007/BF02247933

Karen, C., & Gupta, A. (2006). Indexing in Date-
warehouses: Bitmaps and Beyond. In Wrembel
& Koncilia (Eds.) Data Warehouses and OLAP .
Hershey, PA: IGI Global.

Owen, K. (2002). Compressing MOLAP arrays
by attribute-value reordering: An experimental
analysis. UNBSJ ASCS Technical Report TR-
02-001.

Kaser, O., & Daniel, L. (2003). Attribute value
reordering for efficient hybrid OLAP. In Proceed-
ings of DOLAP'03 , New Orleans, Louisiana,
November 7, 2003 (NRC 46510).

Pennec, E. L., & Mallat, S. (2000). Image represen-
tation and compression with bandelets. Technical
report, École Polytechnique. Kim, M. H., & Lee, K. Y. (2006) Efficient incre-

mental maintenance of data cubes. In Proceed-
ings of the 32nd international conference on Very
large data bases , (pp. 823 - 833). San Francisco:
Morgan Kaufman.

Rosenberg, A. L. (1974). Allocating s torage
for extendible arrays. Journal of the ACM , 21 ,
652-670. doi:10.1145/321850.321861

Rosenberg, A. L., & Stockmeyer, L. J.
(1977). Hashing schemes for extendible ar-
rays. Journal of the ACM , 24 , 199-221.
doi:10.1145/322003.322006

Lemire, D. (2002). Wavelet-based relative prefix
sum methods for range sum queries in data cubes.
In Proceedings of CASCON.

Li, J., Rotem, D., & Wong, H. K. (1987). A New
Compression Method with Fast Searching on
Large Databases. In Proceedings of 13th interna-
tional conference on Very large data bases , (pp.
311-318). San Francisco: Morgan Kaufman.

Rotem, D., Otoo, E. J., & Seshadri, S. (2007).
Chunking of Large Multidimensional Arrays .
Lawrence Berkeley National Laboratory, Uni-
versity of California, University of California,
2007, LBNL-63230.

Li, J., & Srivastava, J. (2002). Efficient Aggre-
gation Algorithms for Compressed Data ware-
houses. IEEE Transactions on Knowledge and
Data Engineering , 14 (3), 515-529. doi:10.1109/
TKDE.2002.1000340

Rotem, D., & Zhao, J. L. (1996) Extendible arrays
for statistical databases and OLAP applications. In
Proceedings of Scientific and Statistical Database
Management , (pp. 108-117). Washington, DC:
IEEE Computer Society.

Maintenance, D.A. S. F.A.A. 2008 , (LNCS 4947,
pp. 682-685). Heidelberg: Springer-Verlag.

Sarawagi, S. (1997). Indexing OLAP Data. IEEE
Data Eng. Bull. , 20 (1), 36-43.