{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T16:55:04Z","timestamp":1781110504552,"version":"3.54.1"},"reference-count":42,"publisher":"IGI Global Scientific Publishing","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012,10,1]]},"abstract":"<p>In this paper, a comprehensive methodology for designing and querying Parallel Rational Data Warehouses (PRDW) over database clusters, called Fragmentation &amp; Allocation (F&amp;A) is proposed. F&amp;A assumes that cluster nodes are heterogeneous in processing power and storage capacity, contrary to traditional design approaches that assume that cluster nodes are instead homogeneous, and fragmentation and allocation phases are performed in a simultaneous manner. In classical approaches, two different cost models are used to perform fragmentation and allocation, separately, whereas F&amp;A makes use of one cost model that considers fragmentation and allocation parameters simultaneously. Therefore, according to the F&amp;A methodology proposed, the allocation phase\/decision is done at fragmentation. At the fragmentation phase, F&amp;A uses two well-known algorithms, namely Hill Climbing (HC) and Genetic Algorithm (GA), which the authors adapt to the main PRDW design problem over heterogeneous database clusters, as these algorithms are capable of taking into account the heterogeneous characteristics of the reference application scenario. At the allocation phase, F&amp;A introduces an innovative matrix-based formalism capable of capturing the interactions among fragments, input queries, and cluster node characteristics, driving the data allocation task accordingly, and a related affinity-based algorithm, called F&amp;A-ALLOC. Finally, their proposal is experimentally assessed and validated against the widely-known data warehouse benchmark APB-1 release II.<\/p>","DOI":"10.4018\/jdm.2012100102","type":"journal-article","created":{"date-parts":[[2013,5,3]],"date-time":"2013-05-03T16:26:18Z","timestamp":1367598378000},"page":"17-51","source":"Crossref","is-referenced-by-count":17,"title":["Effectively and Efficiently Designing and Querying Parallel Relational Data Warehouses on Heterogeneous Database Clusters"],"prefix":"10.4018","volume":"23","author":[{"given":"Ladjel","family":"Bellatreche","sequence":"first","affiliation":[{"name":"LIAS\/ENSMA, Poitiers University, Futuroscope Chasseneuil Cedex, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alfredo","family":"Cuzzocrea","sequence":"additional","affiliation":[{"name":"ICAR-CNR, ItalyF&AUniversity of Calabria, Renede, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Soumia","family":"Benkrid","sequence":"additional","affiliation":[{"name":"National High School for Computer Science (ESI), Algiers, Algeria"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"2432","reference":[{"key":"jdm.2012100102-0","doi-asserted-by":"crossref","unstructured":"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).","DOI":"10.1007\/11546849_12"},{"key":"jdm.2012100102-1","doi-asserted-by":"crossref","unstructured":"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).","DOI":"10.1007\/978-3-642-03730-6_9"},{"key":"jdm.2012100102-2","doi-asserted-by":"publisher","DOI":"10.4018\/jdwm.2009080701"},{"key":"jdm.2012100102-3","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008745624048"},{"key":"jdm.2012100102-4","unstructured":"Ceri, S. F&APelagatti, G. (1984). Distributed databases: PrinciplesF&Asystems. McGraw-Hill."},{"key":"jdm.2012100102-5","doi-asserted-by":"crossref","unstructured":"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).","DOI":"10.1145\/582353.582376"},{"key":"jdm.2012100102-6","doi-asserted-by":"crossref","unstructured":"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).","DOI":"10.1145\/1516360.1516448"},{"key":"jdm.2012100102-7","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.1648"},{"key":"jdm.2012100102-8","doi-asserted-by":"publisher","DOI":"10.1504\/IJBIDM.2009.029076"},{"key":"jdm.2012100102-9","doi-asserted-by":"crossref","unstructured":"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).","DOI":"10.1007\/978-3-540-85176-9_10"},{"key":"jdm.2012100102-10","unstructured":"Davis, L. D. (1991). Bit-climbing, representational bias, and test suite design. In Proceedings of 4th International Conference on Genetic Algorithms (pp. 18-23)."},{"key":"jdm.2012100102-11","doi-asserted-by":"crossref","unstructured":"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.","DOI":"10.1145\/129888.129894"},{"key":"jdm.2012100102-12","unstructured":"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"},{"key":"jdm.2012100102-13","doi-asserted-by":"crossref","unstructured":"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.","DOI":"10.1145\/1376616.1376727"},{"key":"jdm.2012100102-14","doi-asserted-by":"crossref","unstructured":"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.","DOI":"10.1177\/109434200101500302"},{"key":"jdm.2012100102-15","doi-asserted-by":"crossref","unstructured":"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).","DOI":"10.1145\/1031763.1031769"},{"key":"jdm.2012100102-16","unstructured":"Gupta, H. (1999). Selection and maintenance of views in a data warehouse. Unpublished Ph.D. Thesis, Stanford University."},{"key":"jdm.2012100102-17","doi-asserted-by":"publisher","DOI":"10.1007\/s10619-010-7068-1"},{"key":"jdm.2012100102-18","author":"J. H.Holland","year":"1975","journal-title":"Adaptation in natural and artificial systems"},{"key":"jdm.2012100102-19","doi-asserted-by":"crossref","unstructured":"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).","DOI":"10.1145\/93597.98740"},{"key":"jdm.2012100102-20","doi-asserted-by":"crossref","unstructured":"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).","DOI":"10.1007\/BFb0022044"},{"key":"jdm.2012100102-21","doi-asserted-by":"publisher","DOI":"10.1016\/0306-4379(96)00018-X"},{"key":"jdm.2012100102-22","doi-asserted-by":"publisher","DOI":"10.1126\/science.220.4598.671"},{"key":"jdm.2012100102-23","doi-asserted-by":"publisher","DOI":"10.1007\/s10619-009-7037-8"},{"key":"jdm.2012100102-24","unstructured":"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)."},{"key":"jdm.2012100102-25","doi-asserted-by":"publisher","DOI":"10.1016\/0169-023X(94)90041-8"},{"key":"jdm.2012100102-26","unstructured":"Moore, D.,F&AHeleber, J. (2002). Peer-to-peer: Building secure, scalable, and manageable networks. Osborne."},{"key":"jdm.2012100102-27","doi-asserted-by":"crossref","unstructured":"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).","DOI":"10.1145\/66926.66966"},{"key":"jdm.2012100102-28","doi-asserted-by":"publisher","DOI":"10.1145\/1994.2209"},{"key":"jdm.2012100102-29","unstructured":"OLAP Council. (2010). APB-1 OLAP Benchmark, Release II. Retrieved from http:\/\/www.olapcouncil.org\/research\/bmarkly.htm"},{"key":"jdm.2012100102-30","unstructured":"\u00d6zsu, M. T. F&AValduriez, P. (1999). Principles of distributed database systems (2nd ed.). Prentice Hall."},{"key":"jdm.2012100102-31","doi-asserted-by":"crossref","unstructured":"R\u00f6hm, U., & B\u00f6hm, 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).","DOI":"10.1007\/3-540-46439-5_18"},{"key":"jdm.2012100102-32","doi-asserted-by":"crossref","unstructured":"R\u00f6hm, U., & B\u00f6hm, 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).","DOI":"10.1109\/ICDE.2001.914879"},{"key":"jdm.2012100102-33","doi-asserted-by":"publisher","DOI":"10.1145\/3148.3161"},{"key":"jdm.2012100102-34","unstructured":"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)."},{"issue":"1","key":"jdm.2012100102-35","first-page":"36","article-title":"Indexing OLAP data.","volume":"20","author":"S.Sarawagi","year":"1997","journal-title":"A Quarterly Bulletin of the Computer Society of the IEEE Technical Committee on Data Engineering"},{"key":"jdm.2012100102-36","unstructured":"St\u00f6hr, 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)."},{"key":"jdm.2012100102-37","unstructured":"St\u00f6hr, T., & M\u00e4rtens, 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)."},{"key":"jdm.2012100102-38","doi-asserted-by":"publisher","DOI":"10.1162\/106365605774666903"},{"key":"jdm.2012100102-39","doi-asserted-by":"crossref","unstructured":"Valduriez, P. (1993). Parallel database systems: The case for shared-something. In Proceedings of the 9th International Conference on Data Engineering (pp. 460-465).","DOI":"10.1109\/ICDE.1993.344035"},{"key":"jdm.2012100102-40","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-5662-3","author":"R. J.Vanderbei","year":"2001","journal-title":"Linear programming: Foundations and extensions"},{"key":"jdm.2012100102-41","doi-asserted-by":"crossref","unstructured":"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).","DOI":"10.1007\/3-540-48298-9_12"}],"container-title":["Journal of Database Management"],"original-title":[],"language":"ng","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=76665","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T14:27:41Z","timestamp":1654093661000},"score":1,"resource":{"primary":{"URL":"https:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/jdm.2012100102"}},"subtitle":["The F&amp;A Approach"],"short-title":[],"issued":{"date-parts":[[2012,10,1]]},"references-count":42,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2012,10]]}},"URL":"https:\/\/doi.org\/10.4018\/jdm.2012100102","relation":{},"ISSN":["1063-8016","1533-8010"],"issn-type":[{"value":"1063-8016","type":"print"},{"value":"1533-8010","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,10,1]]}}}