Extendible Multidimensional Array Based Storage Scheme for Efficient Management of High Dimensional Data

##plugins.themes.academic_pro.article.sidebar##

Published Mar 1, 2013
https://doi.org/10.47164/ijngc.v4i1.45
Download
PDF
Statistic

Downloads

Download data is not yet available.

Metrics

Metrics Loading ...
Volume 4, Issue 1, March 2013

##plugins.themes.academic_pro.article.main##

Sk. Md. Masudul Ahsan
Department of Computer Science and Engineering, Khulna University of Engineering & Technology, Khulna 9203, Bangladesh.
K M Azharul Hasan
Department of Computer Science and Engineering, Khulna University of Engineering & Technology, Khulna 9203, Bangladesh

Abstract

Multidimensional arrays are good storage for managing large amount of data especially scientific and engineering applications. The Traditional Multidimensional Array (TMA) is also efficient in accessing the array elements by computing the addressing function. Thats why array based files are widely used. But TMA is not dynamically extendible during run time i.e the length of dimension and number of dimension is fixed for a TMA. We describe an extendible array file that is dynamically extendible during run time. If the length of dimension and number of dimension of a multidimensional array is large then the address space required for the array over ows quickly. The proposed array scheme handles the address space problem efficiently. The main idea of this scheme is to represent n dimensional array by a set of two dimensional extendible arrays. We evaluate our proposed scheme both analytically and experimentally for different array operations. Our experimental result shows that the proposed scheme outperforms the existing methods.

##plugins.themes.academic_pro.article.details##

How to Cite
Sk. Md. Masudul Ahsan, & K M Azharul Hasan. (2013). Extendible Multidimensional Array Based Storage Scheme for Efficient Management of High Dimensional Data. International Journal of Next-Generation Computing, 4(1), 88–105. https://doi.org/10.47164/ijngc.v4i1.45
Crossref
Scopus
Google Scholar
Europe PMC

References

  1. AHSAN, S.M.M., and HASAN, K.M.A. 2011. An Implementation Scheme for Multidimensional Extendable Array Operations and Its Evaluation. In proceedings of International Conference on Informatics Engineering & Information Science (pp. 136-150). CCIS 253, Part 5, Springer-Verlag, Berlin, Heidelberg.
  2. BERTIN, E., and KIM, W. (1989). Indexing Techniques for Queries on Nested Objects. IEEE Transactions on Knowledge and Data Engineering, 1(2), 192-214.
  3. CHEN, Y., DEHNE, F., EAVIS, T., and CHAPLIN, A.R. (2006). Improved Data Partitioning for Building Large ROLAP Data Cubes in Parallel. International Journal of Data Warehousing and Mining, 2(1), 1-26.
  4. CHUN, Y.L., YEH, C. C., and JEN, S.L. (2003). Ecient Data Compression Method for Multidimensional Sparse Array Operations Based on EKMR Scheme. IEEE Transactions on Computers, 52(12), 1640-1648.
  5. CHUN, Y.L., YEH, C.C., and JEN, S.L. (2003). Ecient Data Parallel Algorithms for Multidimensional Array Operations Based on the EKMR Scheme for Distributed Memory Multicomputer. IEEE Transactions on Parallel and Distributed Systems, 14(7), 625-639.
  6. CHUN, Y.L., YEH, C. C., and JEN, S.L. (2002). Ecient Representation Scheme for Multidimensional Array Operations. IEEE Transactions on Computers, 51(3), 327-345.
  7. HASAN, K.M.A. (2009). Compression Schemes for High Dimensional Data for MOLAP. Edited Book, Evolving Application Domains of Data Warehousing and Mining: Trends and Solutions", Chapter IV, Information Science Reference, USA.
  8. HASAN, K.M.A., ISLAM, K., ISLAM, M., and TSUJI, T. (2009). An Extendible Data Structure for Handling Large Multidimensional Data Sets. In proceedings of ICCIT, (pp. 669-674). IEEE Explorer.
  9. HASAN, K.M.A., TSUJI, T., and HIGUCHI, K. (2007). An Ecient Implementation for MOLAP Basic Data Structure and Its Evaluation. In proceedings of DASFAA, ( pp. 288-299). LNCS 4443. Springer- verlag, Berlin Heidelberg.
  10. HASAN, K.M.A., TSUJI, T., and 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.
  11. HASAN, K.M.A., AZUMA, M.N.,TSUJI, T., and HIGUCHI, K. (2005). An Extendible Array Based Implemen- tation of Relational Tables for Multidimensional Databases. In proceedings of DaWak. (pp. 233-242). LNCS 3589. Springer- verlag, Berlin Heidelberg.
  12. KUMAKIRI, M., BEI, L., TSUJI, T., and HIGUCHI, K. (2006). Flexibly Resizable Multidimensional Arrays. In proceedings of the 22nd International Conference on Data Engineering Workshops. (pp.83-88). IEEE Computer Society Washington, DC, USA.
  13. LI, J., and SRIVASTAVA, J. (2002). Ecient Aggregation Algorithms for Compressed Data Warehouses. IEEE Transaction on Knowledge and Data Engineering, 14(3), 515-529.
  14. MANO, M. M. (2005). Digital Logic and Computer Design. Prentice Hall.
  15. MARKUS, B., CARSTEN, S., and GABRIELE, H. (2005). On Schema Evolution in Multidimensional Databases. In proceedings of DaWak, (pp. 153-164). Springer-Verlag London, UK.
  16. OTOO, E.J., and ROTEM, D. (2006). A Storage Scheme for Multi-dimensional Databases Using Extendible Array Files. In proceedings of the Workshop on STDBM, (pp. 67-76). Seoul, Korea.
  17. OTOO, E.J., and ROTEM, D. (2006). Ecient Storage Allocation of Large-Scale Extendible Multi-dimensional Scienti c Datasets. In proceedings of the 18th International Conference on Scienti c and Statistical Database Management, (pp. 179-183). IEEE Computer Society Washington, DC, USA.
  18. OTOO, E. J., and MERRETT, T.H. (1983). A Storage Scheme for Extendible Arrays. Computing, 31, 1-9.
  19. PEDERSEN, T.B., and JENSEN, C.S. (2001). Multidimensional Database Technology. IEEE Computer, 34(12), 40-46.
  20. ROLAND, R.P., and BAYER, R. (2005). Towards Truly Extensible Database Systems. In proceedings of DEXA conference. (pp. 596-605). LNCS 3588. Springer-Verlag Berlin Heidelberg
  21. ROTEM, D., OTOO, E.J., and SESHADRI, S. (2007). Chunking of Large Multidimensional Arrays. Lawrence Berkeley National Laboratory, University of California, University of California, LBNL-63230
  22. ROTEM, D., and ZHAO, J.L. (1996). Extendible Arrays for Statistical Databases and OLAP Applications. In proceedings of Scienti c and Statistical Database Management, (pp. 108-117). IEEE Computer Society Washington, DC, USA.
  23. SARAWAGII, S., and STONEBRAKER, M. (1994). Ecient Organization of Large Multidimensional Arrays. In Proceedings of ICDE, (pp. 328-336). IEEE Computer Society, Washington, DC, USA.
  24. SEAMONS, K. E., and WINSLETT, M. (1994). Physical Schemas for Large Multidimensional Arrays in Scienti c Computing Applications. In Proceedings of SSDBM, (pp. 218-227). IEEE Computer Society, Washington, DC, USA.
  25. TSUJI, T., KURODA, M., and HIGUCHI, K. (2008). History O set Implementation Scheme for Large Scale Multidimensional Data Sets. In proceedings of ACM Symposium on Applied Computing, (pp.1021-1028). ACM New York, NY, USA.
  26. ZHAO, Y., DESHPANDE, P.M., and NAUGHTON, J. F. (1997). An Array Based Algorithm for Simultaneous Multidimensional Aggregates. Proceedings of the 1997 ACM SIGMOD international conference on Management of data. (pp. 159-170). ACM New York, NY, USA.