{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,6]],"date-time":"2026-10-06T12:53:23Z","timestamp":1791291203312,"version":"4.3.0"},"reference-count":27,"publisher":"IGI Global Scientific Publishing","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009,10,1]]},"abstract":"<p>Horizontal Partitioning has been largely adopted by the database community, where it took a significant part in the physical design process. Actually, it is supported by most commercial database systems (DBMS), where a native Data Definition Language for decomposing tables\/materialized views using various modes is proposed. In traditional databases, horizontal partitioning has been largely studied, where several fragmentation algorithms were proposed to partition tables in isolation. In the relational data warehouse environment, horizontal partitioning consists in decomposing the whole warehouse schema into sub schemas, where each schema contains fragments of dimension and fact tables. Dimension tables are fragmented using the primary partitioning mode, whereas the fact table is divided using referential mode. In this article, the authors first focus on the evolution of horizontal partitioning in commercial DBMS motivated by decision support applications. Secondly, they give a formalization of the referential fragmentation schema selection problem in the data warehouse and they study its hardness to select an optimal solution. Due to its high complexity, they develop two algorithms: hill climbing and simulated annealing with several variants to select a near optimal partitioning schema. Finally, extensive experimental studies are conducted using the data set of APB1 benchmark to compare the quality the proposed algorithms using a mathematical cost model. Based on these experiments, some recommendations are given to advise database administrator for well using horizontal partitioning.<\/p>","DOI":"10.4018\/jdwm.2009080701","type":"journal-article","created":{"date-parts":[[2010,4,30]],"date-time":"2010-04-30T09:41:41Z","timestamp":1272620501000},"page":"1-23","source":"Crossref","is-referenced-by-count":34,"title":["Referential Horizontal Partitioning Selection Problem in Data Warehouses"],"prefix":"10.4018","volume":"5","author":[{"given":"Ladjel","family":"Bellatreche","sequence":"first","affiliation":[{"name":"University of Poitiers, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9746-579X","authenticated-orcid":true,"given":"Kamel","family":"Boukhalfa","sequence":"additional","affiliation":[{"name":"University of Poitiers, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pascal","family":"Richard","sequence":"additional","affiliation":[{"name":"University of Poitiers, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Komla Yamavo","family":"Woameno","sequence":"additional","affiliation":[{"name":"University of Poitiers, France"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"2432","reference":[{"key":"jdwm.2009080701-0","doi-asserted-by":"crossref","unstructured":"Bellatreche, L., Boukhalfa, K., & Richard, P. (2008). Horizontal Partitioning in Data Warehouse: Hardness Study, Selection Algorithms and Validation on ORACLE10G. 10th International Conference on Data Warehousing and Knowledge Discovery (DAWAK) (pp. 87-96).","DOI":"10.1007\/978-3-540-85836-2_9"},{"key":"jdwm.2009080701-1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008745624048"},{"issue":"1","key":"jdwm.2009080701-2","first-page":"206","article-title":"A Data Mining Approach for Selecting Bitmap Join Indices.","volume":"2","author":"L.Bellatreche","year":"2008","journal-title":"Journal of Computing Science and Engineering"},{"key":"jdwm.2009080701-3","unstructured":"Boukhalfa, K., Bellatreche, L., & Richard, P. (2008). Fragmentation Primaire et D\u00e9riv\u00e9e: \u00c9tude de Complexit\u00e9, Algorithmes de S\u00e9lection et Validation sous Oracle10g. (Report No. 01 -2008), LISI\/ENSMA, available at: http:\/\/www.lisi.ensma.fr\/members\/bellatreche"},{"key":"jdwm.2009080701-4","doi-asserted-by":"crossref","unstructured":"Breslau, L., Cao, P., Fan, L., Phillips, G., & Shenker, S. (1999). Web Caching and Zipf-like Distributions: Evidence and Implications. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE INFOCOM) (pp. 126-134).","DOI":"10.1109\/INFCOM.1999.749260"},{"key":"jdwm.2009080701-5","doi-asserted-by":"crossref","unstructured":"Ceri, S., Negri, M., & Pelagatti, G. (1982). Horizontal data partitioning in database design. Proceedings of the International Conference on Management of Data (SIGMOD) (pp. 128-136).","DOI":"10.1145\/582353.582376"},{"key":"jdwm.2009080701-6","unstructured":"Das, G., Gunopulos, D., Koudas, N., & Tsirogiannis, D. (2006). Answering Top-k Queries Using Views. Proceedings of 32th International Conference on Very Large Data Bases (VLDB'2006) (pp. 451-462)."},{"key":"jdwm.2009080701-7","doi-asserted-by":"crossref","unstructured":"Eadon, G., Chong, E. I., Shankar, S., Raghavan, A., Srinivasan, J., & Das, S. (2008). Supporting Table Partitioning by Reference in Oracle. Proceedings of the International Conference on Management of Data (SIGMOD) (pp. 1111-1122).","DOI":"10.1145\/1376616.1376727"},{"key":"jdwm.2009080701-8","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/31.3.283"},{"key":"jdwm.2009080701-9","unstructured":"Garey, M. R., & Johnson, D. S. (1990). Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York, NY, USA."},{"key":"jdwm.2009080701-10","unstructured":"Holland, J. H. (1975). Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor, MI."},{"key":"jdwm.2009080701-11","unstructured":"International Business Machines Corporation. (2006). DB2 partitioning features, An overview for data warehouses. Retrieved from http:\/\/www.ibm.com\/developerworks\/data\/library\/techarticle\/dm-0608mcinerney\/"},{"key":"jdwm.2009080701-12","doi-asserted-by":"crossref","unstructured":"Ioannidis, Y., & Kang, Y. (1990). Randomized algorithms for optimizing large join queries. Proceedings of the International Conference on Management of Data (SIGMOD) (pp. 9-22).","DOI":"10.1145\/93597.98740"},{"key":"jdwm.2009080701-13","doi-asserted-by":"publisher","DOI":"10.1016\/0306-4379(96)00018-X"},{"key":"jdwm.2009080701-14","doi-asserted-by":"publisher","DOI":"10.1126\/science.220.4598.671"},{"key":"jdwm.2009080701-15","doi-asserted-by":"publisher","DOI":"10.1007\/s007780050071"},{"key":"jdwm.2009080701-16","unstructured":"Microsoft Corporation. (2005). Partitioned Tables and Indexes in SQL Server 2005. Retrieved from http:\/\/msdn.microsoft.com\/en-us\/library\/ ms345146.aspx MySQL (n.d.). Partition Types. Retrieved from http:\/\/dev.mysql.com\/doc\/refman\/5.1\/en\/partitioning-types.html."},{"key":"jdwm.2009080701-17","doi-asserted-by":"crossref","unstructured":"Navathe, S. B., & Ra, M. (1989).Vertical Partitioning for Database Design: A Graphical Algorithm. Proceedings of the International Conference on Management of Data (SIGMOD) (pp. 440-450).","DOI":"10.1145\/66926.66966"},{"key":"jdwm.2009080701-18","unstructured":"OLAP Council. (1998) APB-1 OLAP Benchmark, Release II. Retrieved from http:\/\/www.olapcouncil.org\/research\/resrchly.htm"},{"key":"jdwm.2009080701-19","unstructured":"Oracle Corporation. (2007). Partitioning in Oracle Database 11g. An Oracle White Paper. Retrieved from http:\/\/www.oracle.com\/ technology\/ products\/bi\/db\/11g\/pdf\/partitioning-11g-whitepaper.pdf"},{"key":"jdwm.2009080701-20","unstructured":"Ozsu, T. M., & Valduriez, P. (1999). Principles of Distributed Database Systems (2nd ed.). Prentice Hall."},{"key":"jdwm.2009080701-21","doi-asserted-by":"crossref","unstructured":"Papadomanolakis, S., & Ailamaki, A. (2004). Autopart: Automating Schema Design for Large Scientific Databases using Data Partitioning. Proceedings of the 16th International Conference on Scientific and Statistical Database Management (pp. 383\u2013392).","DOI":"10.1109\/SSDM.2004.1311234"},{"key":"jdwm.2009080701-22","unstructured":"PostgresSQL (n.d.). Partitioning. Retrieved from http:\/\/www.postgresql.org\/docs\/8.1\/static\/ddl-partitioning.html."},{"key":"jdwm.2009080701-23","doi-asserted-by":"publisher","DOI":"10.1145\/3148.3161"},{"key":"jdwm.2009080701-24","unstructured":"Sanjay, A., Chaudhuri, S., & Narasayya, V. R. (2000). Automated selection of materialized views and indexes in Microsoft SQL server. Proceedings of 26th International Conference on Very Large Data Bases (VLDB'2000) (pp. 496-505)."},{"key":"jdwm.2009080701-25","unstructured":"Sanjay, A., Narasayya, V. R., & Yang, B. (2004). Integrating vertical and horizontal partitioning into automated physical database design. Proceedings of the International Conference on Management of Data (SIGMOD) (pp. 359\u2013370)."},{"key":"jdwm.2009080701-26","unstructured":"St\u00f6hr, T., M\u00e4rtens, H., & Rahm, E. (2000). Multi-dimensional database allocation for parallel data warehouses. Proceedings of the International Conference on Very Large Databases (VLDB) (pp. 273\u2013284)."}],"container-title":["International Journal of Data Warehousing and Mining"],"original-title":[],"language":"ng","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=37402","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T15:40:38Z","timestamp":1654098038000},"score":1,"resource":{"primary":{"URL":"https:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/jdwm.2009080701"}},"subtitle":["Hardness Study and Selection Algorithms"],"short-title":[],"issued":{"date-parts":[[2009,10,1]]},"references-count":27,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2009,10]]}},"URL":"https:\/\/doi.org\/10.4018\/jdwm.2009080701","relation":{},"ISSN":["1548-3924","1548-3932"],"issn-type":[{"value":"1548-3924","type":"print"},{"value":"1548-3932","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,10,1]]}}}