Skip to main content

Cluster Method of Description of Information System Data Model Based on Multidimensional Approach

  • Conference paper
  • First Online:
Distributed Computer and Communication Networks (DCCN 2016)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 678))

Abstract

Multidimensional data cube is a data model at the information systems based on the multidimensional approach. If one uses a large set of aspects for the analysis of data domain the data cubes are characterized by substantial sparseness. It complicates the organization of data storage. The proposed cluster method of description of multidimensional data cube is based on the investigation of data domain semantics. The dimensionalities of the multidimensional cube are the dimensions corresponding to the aspects of analysis. The basis of the cluster method is a construction of the groups of members which are semantically related to the groups of other members. Building of associations between the groups of different members allows to reveal the clusters in the data cube – the sets of cells with similar properties which may be described in a same way. Clusters are used as the main element of information system data model.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Thomsen, E.: OLAP Solution: Building Multidimensional Information System. Willey Computer Publishing, New York (2002). ISBN 0-471-40030-0

    Google Scholar 

  2. Hirata, C.M., Lima, J.C.: Multidimensional cyclic graph approach: representing a data cube without common sub-graphs. Inf. Sci. 181, 2626–2655 (2011)

    Article  Google Scholar 

  3. Karayannidis, N., Sellis, T., Kouvaras, Y.: CUBE file: a file structure for hierarchically clustered OLAP cubes. In: Bertino, E., Christodoulakis, S., Plexousakis, D., Christophides, V., Koubarakis, M., Böhm, K., Ferrari, E. (eds.) EDBT 2004. LNCS, vol. 2992, pp. 621–638. Springer, Heidelberg (2004). doi:10.1007/978-3-540-24741-8_36. ISBN 978-3-540-21200-3

    Chapter  Google Scholar 

  4. Chun, S.-J.: Partial prefix sum method for large data warehouses. In: Zhong, N., Raś, Z.W., Tsumoto, S., Suzuki, E. (eds.) ISMIS 2003. LNCS (LNAI), vol. 2871, pp. 473–477. Springer, Heidelberg (2003). doi:10.1007/978-3-540-39592-8_67. ISBN 978-3-540-39592-8

    Chapter  Google Scholar 

  5. Messaoud, R.B., Boussaid, O., Rabaseda, S.L.: A multiple correspondence analysis to organize data cube. In: Databases and Information Systems IV DB & IS 2006, pp. 133–146. IOS Press, Vilnius (2007). ISBN 978-1-58603-715-4

    Google Scholar 

  6. Jin, R., Vaidyanathan, J.K., Yang, G., Agrawal, G.: Communication and memory optimal parallel data cube construction. IEEE Trans. Parallel Distrib. Syst. 16, 1105–1119 (2005)

    Article  Google Scholar 

  7. Luo, Z.W., Ling, T.W., Ang, C.H., Lee, S.Y., Cui, B.: Range top/bottom k queries in OLAP sparse data cubes. In: Mayr, H.C., Lazansky, J., Quirchmayr, G., Vogel, P. (eds.) Database and Expert Systems Applications - DEXA 2001, vol. 2113, pp. 678–687. Springer, Heidelberg (2001). ISBN 978-3-540-42527-4

    Google Scholar 

  8. Fu, L.: Efficient evaluation of sparse data cubes. In: Li, Q., Wang, G., Feng, L. (eds.) WAIM 2004. LNCS, vol. 3129, pp. 336–345. Springer, Heidelberg (2004). doi:10.1007/978-3-540-27772-9_34. ISBN 978-3-540-27772-9

    Chapter  Google Scholar 

  9. Chen, C., Feng, J., Xiang, L.: Computation of sparse data cubes with constraints. In: Kambayashi, Y., Mohania, M., Wöß, W. (eds.) DaWaK 2003. LNCS, vol. 2737, pp. 14–23. Springer, Heidelberg (2003). doi:10.1007/978-3-540-45228-7_3. ISBN 978-3-540-40807-9

    Chapter  Google Scholar 

  10. Salmam, F.Z., Fakir, M., Errattahi, R.: Prediction in OLAP data cubes. J. Inf. Knowl. Manag. 15, 449–458 (2016)

    Google Scholar 

  11. Romero, O., Pedersen, T.B., Berlanga, R., Nebot, V., Aramburu, M.J., Simitsis, A.: Using semantic web technologies for exploratory OLAP: a survey. IEEE Trans. Knowl. Data Eng. 27, 571–588 (2015)

    Article  Google Scholar 

  12. Gomez, L.I., Gomez, S.A., Vaisman, A.: A generic data model and query language for spatiotemporal OLAP cube analysis. In: Proceedings of the 15-th International Conference on Extending Database Technology – EDBT 2012, pp. 300–311, Berlin (2012). ISBN: 978-1-4503-0790-1

    Google Scholar 

  13. Tsai, M.-F., Chu, W.: A multidimensional aggregation object (MAO) framework for computing distributive aggregations. In: Kambayashi, Y., Mohania, M., Wöß, W. (eds.) DaWaK 2003. LNCS, vol. 2737, pp. 45–54. Springer, Heidelberg (2003). doi:10.1007/978-3-540-45228-7_6. ISBN 978-3-540-40807-9

    Chapter  Google Scholar 

  14. Vitter, J.S., Wang, M.: Approximate computation of multidimensional aggregates of sparse data using wavelets, In: Proceedings of the 1999 International Conference on Management of Data - SIGMOD 1999, pp. 193–204. ACM, New York (1999). ISBN 1-58113-084-8

    Google Scholar 

  15. Leonhardi, B., Mitschang, B., Pulido, R., Sieb, C., Wurst, M.: Augmenting OLAP exploration with dynamic advanced analytics. In: Proceedings of the 13th International Conference on Extending Database Technology - EDBT 2010, pp. 687–692. ACM, New York (2010). ISBN 978-1-60558-945-9

    Google Scholar 

  16. Wang, W., Lu, H., Feng, J., Yu, J.X.: Condensed cube: an effective approach to reducing data cube size. In: Proceedings of the 18th International Conference on Data Engineering - ICDE 2002, pp. 155–165. IEEE Computer Society, Washington (2002). ISBN 0-7695-1531-2

    Google Scholar 

  17. Goil, S., Choudhary, A.: Design and implementation of a scalable parallel system for multidimensional analysis and OLAP. In: Parallel and Distributed Processing - 11th IPPS/SPDP 1999, pp. 576–581. Springer, Heidelberg (1999). ISBN 978-3-540-65831-3

    Google Scholar 

  18. Cuzzocrea, A.: OLAP data cube compression techniques: a ten-year-long history. In: Kim, T., Lee, Y., Kang, B.-H., Ślȩzak, D. (eds.) FGIT 2010. LNCS, vol. 6485, pp. 751–754. Springer, Heidelberg (2010). doi:10.1007/978-3-642-17569-5_74. ISBN 978-3-642-17568-8

    Chapter  Google Scholar 

  19. Hirata, C.M., Lima, J.C., Silva, R.R.: A hybrid memory data cube approach for high dimension relations. In: Proceedings of the 17-th International Conference on Enterprise Information Systems - ICEIS 2015, vol. 1, pp. 139–149. SciTePress, Barselona (2015). ISBN 978-989-758-096-3

    Google Scholar 

  20. Le, P.D., Nguyen, T.B.: OWL-based data cube for conceptual multidimensional data model. In: Proceedings of the First International Conference on Theories and Applications of Computer Science - ICTACS 2006, pp. 247–260. World Scientific Publishing, Ho Chi Minh (2006). ISBN 978-981-270-063-6

    Google Scholar 

  21. Viswanathan, G., Schneider, M.: BigCube: a metamodel for managing multidimensional data. In: Proceedings of the 19-th Conference on Software Engineering and Data Engineering - SEDE 2010, pp. 237–242. World Scientific Publishing, Singapore (2010). ISBN 978-981-270-063-6

    Google Scholar 

  22. Loh, Z.X., Ling, T.W., Ang, C.H., Lee, S.Y.: Adaptive method for range top-k queries in OLAP data cubes. In: Proceedings of International Conference on Information and Knowledge Management - CIKM 2002, pp. 60–67. ACM, New York (2002). ISBN 1-58113-492-4

    Google Scholar 

  23. Simić, D., Kurbalija, V., Budimac, Z.: An application of case-based reasoning in multidimensional database architecture. In: Kambayashi, Y., Mohania, M., Wöß, W. (eds.) DaWaK 2003. LNCS, vol. 2737, pp. 66–75. Springer, Heidelberg (2003). doi:10.1007/978-3-540-45228-7_8. ISBN 978-3-540-40807-9

    Chapter  Google Scholar 

  24. Thanisch, P., Niemi, T., Niinimaki, M., Nummenmaa, J.: Using the entity-attribute-value model for OLAP cube construction. In: Grabis, J., Kirikova, M. (eds.) BIR 2011. LNBIP, vol. 90, pp. 59–72. Springer, Heidelberg (2011). doi:10.1007/978-3-642-24511-4_5. ISBN 978-3-642-24510-7

    Chapter  Google Scholar 

  25. Viskov, A.V., Fomin, M.B.: Methods of description of possible combinations of signs and details while using the multidimensional models in infocomm systems. T-Comm. - Telecommun. Transp. 7, 45–47 (2012)

    Google Scholar 

Download references

Acknowledgments

The work is partially supported by the Ministry of Education and Science of the Russian Federation (the Agreement number 02.a03.21.0008).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Maxim Fomin .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing AG

About this paper

Cite this paper

Fomin, M. (2016). Cluster Method of Description of Information System Data Model Based on Multidimensional Approach. In: Vishnevskiy, V., Samouylov, K., Kozyrev, D. (eds) Distributed Computer and Communication Networks. DCCN 2016. Communications in Computer and Information Science, vol 678. Springer, Cham. https://doi.org/10.1007/978-3-319-51917-3_56

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-51917-3_56

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-51916-6

  • Online ISBN: 978-3-319-51917-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics