Effectively and efficiently designing and querying parallel relational data warehouses on heterogeneous database clusters: The F&A approach

Journal of Database Management

Volumn 23, Issue 4, 2012, Pages 17-51

  Bellatreche, Ladjel ^a   Cuzzocrea, Alfredo ^b   Benkrid, Soumia ^c  

^a UNIVERSITÉ DE POITIERS   (France)

^b UNIVERSITY OF CALABRIA   (Italy)

^c Institut National de Formation en Informatique   (Algeria)

Author keywords

Database clusters; FragmentationF AAllocation (F A); Genetic Algorithm (GA); Hill Climbing (HC); Matrix based formalism; Processing power; Relational Data Warehouses (PRDW); Storage capacity

Indexed keywords

DATABASE CLUSTERS; HILL CLIMBING; MATRIX-BASED FORMALISM; PROCESSING POWER; RELATIONAL DATA; STORAGE CAPACITY;

DATA WAREHOUSES; GENETIC ALGORITHMS; GRAPHICAL USER INTERFACES; QUERY PROCESSING;

CLUSTERING ALGORITHMS;

EID: 84880414957     PISSN: 10638016     EISSN: 15338010     Source Type: Journal    
DOI: 10.4018/jdm.2012100102     Document Type: Article

References (42)

1. Bellatreche, L. F&ABoukhalfa, K. (2005). An evolutionary approach to schema partitioning selection in a data warehouse environment. In Proceedings of 7th International Conference on Data Warehousing and Knowledge Discovery (pp. 115-125).
2. Bellatreche, L. F&ABenkrid, S. (2009). A joint design approach of partitioning and allocation in parallel data warehouses. In Proceedings of 11th International Conference on Data Warehousing and Knowledge Discovery (pp. 99-110).
3. Bellatreche, L., & Boukhalfa, K.,F&ARichard, P. (2009). Referential horizontal partitioning selection problem in data warehouses: hardness study and selection algorithms. International Journal of Data Warehousing and Mining, 5(4), 1-23. doi:10.4018/jdwm.2009080701.
4. Bellatreche, L., & Karlapalem, K.,F&ASimonet, A. (2000). Algorithms and support for horizontal class partitioning in object-oriented databases. Distributed and Parallel Databases, 8(2), 155-179. doi:10.1023/A:1008745624048.
5. Ceri, S. F&APelagatti, G. (1984). Distributed databases: PrinciplesF&Asystems. McGraw-Hill.
6. Ceri, S., & Negri, M. F&APelagatti, G. (1982). Horizontal data partitioning in database design. In Proceedings of 1982 ACM SIGMOD International Conference on Management of Data (pp. 128-136).
7. Cuzzocrea, A. F&ASerafino, P. (2009). LCS-Hist: Taming massive high-dimensional data cube compression. In Proceedings of 12th International Conference on Extending Database Technology (pp. 768-779).
8. Cuzzocrea, A. (2011). A framework for modeling and supporting data transformation services over data and knowledge grids with real-time bound constraints. Concurrency and Computation, 23(5), 436-457. doi:10.1002/cpe.1648.
9. Cuzzocrea, A., & Darmont, J.,F&AMahboubi, H. (2009). Fragmenting very large xml data warehouses via k-means clustering algorithm. International Journal of Business Intelligence and Data Mining, 4(3-4), 301-328. doi:10.1504/IJBIDM.2009.029076.
10. Cuzzocrea, A., & Kumar, A. F&ARusso, V. (2008). Experimenting the query performance of a grid-based sensor network data warehouse. In Proceedings of 4th International Conference on Data Management in Grid and Peer-to-Peer Systems (pp. 105-119).
11. Davis, L. D. (1991). Bit-climbing, representational bias, and test suite design. In Proceedings of 4th International Conference on Genetic Algorithms (pp. 18-23).
12. DeWitt, D. J.,F&AGray, J. (1992). Parallel database systems: The future of high performance database systems. Proceedings of Communnications of the ACM, 35(6), 85-98.
13. DeWitt, D. J., & Madden, S. F&AStonebraker, M. (n.d.). How to build a high-performance data warehouse. Retrieved from http://db.lcs.mit.edu/ madden/high-perf.pdf
14. Eadon, G., Chong, E. I., Shankar, S., Raghavan, A., & Srinivasan, J. F&ADas, S. (2008). Supporting table partitioning by reference in oracle. In Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data, 1111-1122.
15. Foster, I., & Kesselman, C. F&ATuecke, S. (2001). The anatomy of the grid: enabling scalable virtual organizations. In Proceedings of International Journal of High Performance Computing Applications, 15(3), 200-222.
16. Furtado, P. (2004). Experimental evidence on partitioning in parallel data warehouses. Proceedings of 7th ACM International Workshop on Data Warehousing and OLAP (pp. 23-30).
17. Gupta, H. (1999). Selection and maintenance of views in a data warehouse. Unpublished Ph.D. Thesis, Stanford University.
18. Hauglid, J. O., & Nørvåg, K.,F&ARyeng, N. H. (2010). DYFRAM: Dynamic fragmentation and replica management in distributed database systems. Distributed and Parallel Databases, 28(2-3), 157-185. doi:10.1007/s10619-010-7068-1.
19. Holland, J. H. (1975). Adaptation in natural and artificial systems. University of Michigan Press.
20. Ioannidis, Y. F&AKang Y. (1990). Randomized algorithms algorithms for optimizing large join queries. In Proceedings of 1990 ACM SIGMOD International Conference on Management of Data (pp. 9-22).
21. Karlapalem, K. F&APun, N. M. (1997). Query driven data allocation algorithms for distributed database systems. Proceedings of 8th International Conference on Database and Expert Systems Applications (pp. 347-356).
22. Karlapalem, K., & Navathe, S. B.F&AAmmar M. (1996). Optimal redesign policies to support dynamic processing of applications on a distributed database system. Information Systems, 21(4), 353-367. doi:10.1016/0306-4379(96) 00018-X.
23. Kirkpatrick, S., & Gelatt, C. D.,F&AVecchi, M. P. (1983). Optimization by simulated annealing. Science, 220(4598), 671-680. doi:10.1126/science.220.4598.671 PMID:17813860.
24. Lima, A. B., Furtado, C., & Valduriez, P.,F&AMattoso, M. (2009). Parallel OLAP query processing in database clusters with data replication. Distributed and Parallel Databases, 25(1-2), 97-123. doi:10.1007/s10619-009- 7037-8.
25. MacQueen, J. B. (1967). Some methods for classification and analysis of multivariate observations. In Proceedings of 5th Berkeley Symposium on Mathematical Statistics and Probability (pp. 281-297).
26. Mohania, M. K.,F&ASarda, N. L. (1994). Rule allocation in distributed deductive database systems. Data & Knowledge Engineering, 14(2), 117-141. doi:10.1016/0169-023X(94)90041-8.
27. Moore, D.,F&AHeleber, J. (2002). Peer-to-peer: Building secure, scalable, and manageable networks. Osborne.
28. Navathe, S. B. F&ARa, M. (1989). Vertical partitioning for database design: A graphical algorithm. In Proceedings of 1989 ACM SIGMOD International Conference on Management of Data (pp. 440-450).
29. Navathe, S. B., Ceri, S., & Wiederhold, G.,F&ADou, J. (1984). Vertical partitioning algorithms for database design. ACM Transactions on Database Systems, 9(4), 681-710. doi:10.1145/1994.2209.
30. OLAP Council. (2010). APB-1 OLAP Benchmark, Release II. Retrieved from http://www.olapcouncil.org/research/bmarkly.htm
31. Özsu, M. T. F&AValduriez, P. (1999). Principles of distributed database systems (2nd ed.). Prentice Hall.
32. Röhm, U., & Böhm, K. F&ASchek, H. J. (2000). OLAP query routing and physical design in a database cluster. Proceedings of 7th International Conference on Extending Database Technology (pp. 254-268).
33. Röhm, U., & Böhm, K. F&ASchek, H.J. (2001). Cache-aware query routing in a cluster of databases. In Proceedings of 17th IEEE International Conference on Data Engineering (pp. 641-650).
34. Saccà, D.F&AWiederhold, G. (1985). Database partitioning in a cluster of processors. ACM Transactions on Database Systems, 10(1), 29-56. doi:10.1145/3148.3161.
35. Sanjay, A., & Narasayya, V. R. F&AYang, B. (2004). Integrating vertical and horizontal partitioning into automated physical database design. In Proceedings of 2004 ACM SIGMOD International Conference on Management of Data (pp. 359-370).
36. Sarawagi, S. (1997). Indexing OLAP data. A Quarterly Bulletin of the Computer Society of the IEEE Technical Committee on Data Engineering, 20(1), 36-43.
37. Stöhr, T. F&ARahm, E. (2001). WARLOCK: A data allocation tool for parallel warehouses. In Proceedings of the 27th International Conference on Very Large Databases (pp. 721-722).
38. Stöhr, T., & Märtens, H. F&ARahm, E. (2000). Multi-dimensional database allocation for parallel data warehouses. In Proceedings of the 26th International Conference on Very Large Databases (pp. 273-284).
39. Tucker, A., & Crampton, J.,F&ASwift, S. (2005). RGFGA: An efficient representation and crossover for grouping genetic algorithms. Evolutionary Computation, 13(4), 477-499. doi:10.1162/106365605774666903 PMID:16297280.
40. Valduriez, P. (1993). Parallel database systems: The case for shared-something. In Proceedings of the 9th International Conference on Data Engineering (pp. 460-465).
41. Vanderbei, R. J. (2001). Linear programming: Foundations and extensions (2nd ed.). Springer.
42. Zhang, C. F&AYang, J. (1999). Genetic algorithm for materialized view selection in data warehouse environments. In Proceedings of 1st International Conference on Data Warehousing and Knowledge Discovery (pp. 116-125).