Skip to main content

Horizontal Partitioning by Predicate Abstraction and Its Application to Data Warehouse Design

  • Conference paper
Book cover Advances in Databases and Information Systems (ADBIS 2010)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 6295))

Abstract

We propose a new method for horizontal partitioning of relations based on predicate abstraction by using a finite set of arbitrary predicates defined over the whole domains of relations. The method is formal and compositional: arbitrary fragments of relations can be partitioned with arbitrary number of predicates. We apply this partitioning to address the problem of finding suitable design for a relational data warehouse modeled using star schemas such that the performance of a given workload is optimized. We use a genetic algorithm to generate an appropriate solution for this optimization problem. The experimental results confirm effectiveness of our approach.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Agrawal, S., Narasayya, V., Yang, B.: Integrating Vertical and Horizontal Partitoning into Automated Physical Database Design. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 359–370 (2004)

    Google Scholar 

  2. Ball, T., Podelski, A., Rajamani, S.K.: Boolean and Cartesian Abstraction for Model Checking C Programs. In: Margaria, T., Yi, W. (eds.) TACAS 2001. LNCS, vol. 2031, p. 268. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  3. Bellatreche, L., Boukhalfa, K.: An Evolutionary Approach to Schema Partitioning Selection in a Data Warehouse. In: Tjoa, A.M., Trujillo, J. (eds.) DaWaK 2005. LNCS, vol. 3589, pp. 115–125. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  4. Bellatreche, L., Karlapalem, K., Simonet, A.: Algorithms and Support for Horizontal Class Partitioning in Object-Oriented Databases. The Distributed and Parallel Databases Journal 8(2), 155–179 (2000)

    Article  Google Scholar 

  5. Dimovski, A., Ghica, D.R., Lazić, R.: Data-Abstraction Refinement: A Game Semantic Approach. In: Hankin, C., Siveroni, I. (eds.) SAS 2005. LNCS, vol. 3672, pp. 102–117. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  6. Furtado, P.: Experimental Evidence on Partitioning in Parallel Data Warehouses. In: Proceedings of the 7th ACM International Workshop on Data Warehousing and OLAP (DOLAP), pp. 23–30 (2004)

    Google Scholar 

  7. Golfarelli, M., Maniezzo, V., Rizzi, S.: Materialization of Fragmented Views in Multidimensional Databases. Data & Knowledge Engineering 49(3), 325–351 (2004)

    Article  Google Scholar 

  8. Graf, S., Saidi, H.: Construction of Abstract Atate Graphs with PVS. In: Grumberg, O. (ed.) CAV 1997. LNCS, vol. 1254, pp. 72–83. Springer, Heidelberg (1997)

    Google Scholar 

  9. Harinarayan, V., Rajaraman, A., Ullman, J.D.: Implementing data cubes efficiently. In: Proceedings of the 1996 ACM SIGMOD International Conference on Management of Data, vol. 25(2), pp. 205–216. ACM Press SIGMOD Record, New York (1996)

    Chapter  Google Scholar 

  10. Holland, J.H.: Adaptation in Natural and Artificial Systems. University of Michigan Press (1995)

    Google Scholar 

  11. Meffert, K.: JGAP - Java Genetic Algorithms and Genetic Programming Package, http://jgap.sf.net

  12. Ozsu, M.T., Valduriez, P.: Principles of Distributed Database Systems. Prentice-Hall, Englewood Cliffs (1999)

    Google Scholar 

  13. Sacca, D., Wiederhold, G.: Database Partitioning in a Cluster of Processors. Proceedings of the ACM Transactions on Database Systems (TODS) 10(1), 29–56 (1985)

    Article  MATH  Google Scholar 

  14. Sanjay, A., Narasayya, V.R., Yang, V.R.: Integrating Vertical and Horizontal Partitioning into Automated Physical Database Design. In: Proceedings of the 2004 ACM SIGMOD International Conference on Management of Data, pp. 359–370. ACM Press SIGMOD Record, New York (2004)

    Google Scholar 

  15. Sahpaski, D., Velinov, G., Jakimovski, B., Kon-Popovska, M.: Dynamic Evolution and Improvement of Data Warehouse Design. In: Proceedings of Balkan Conference in Informatics, IEEE Computer Society’s Conference Publishing (IEEE BCI), pp. 115–125 (2009)

    Google Scholar 

  16. Velinov, G., Gligoroski, D., Kon-Popovska, M.: Hybrid Greedy and Genetic Algorithms for Optimization of Relational Data Warehouses. In: Proceedings of Multi-Conference: Artificial Intelligence and Applications (IASTED), pp. 470–475 (2007)

    Google Scholar 

  17. Velinov, G., Jakimovski, B., Cerepnalkoski, D., Kon-Popovska, M.: Framework for Improvement of Data Warehouse Optimization Process by Workflow Gridification. In: Atzeni, P., Caplinskas, A., Jaakkola, H. (eds.) ADBIS 2008. LNCS, vol. 5207, pp. 295–304. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  18. Yu, J.X., Yao, X., Choi, C., Gou, G.: Materialized Views Selection as Constrained Evolutionary Optimization. Proceedings of IEEE Transactions on Systems, Man and Cybernetics, Part C: Applications and Reviews 33(4), 458–468 (2003)

    Article  Google Scholar 

  19. Zilio, D.: Physical Database Design Decision Algorithms and Concurrent Reorganization for Parallel Database Systems. Ph. D. Thesis, University of Toronto (1998)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dimovski, A., Velinov, G., Sahpaski, D. (2010). Horizontal Partitioning by Predicate Abstraction and Its Application to Data Warehouse Design. In: Catania, B., Ivanović, M., Thalheim, B. (eds) Advances in Databases and Information Systems. ADBIS 2010. Lecture Notes in Computer Science, vol 6295. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15576-5_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-15576-5_14

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-15575-8

  • Online ISBN: 978-3-642-15576-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics