Data dartitioning in data warehouses: Hardness study, heuristics and ORACLE validation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5182 LNCS, Issue , 2008, Pages 87-96

  Bellatreche, Ladjel ^a   Boukhalfa, Kamel ^a   Richard, Pascal ^a  

^a UNIVERSITÉ DE POITIERS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ADMINISTRATIVE DATA PROCESSING; CHLORINE COMPOUNDS; DATABASE SYSTEMS; HARDNESS; HEURISTIC PROGRAMMING; KETONES; KNOWLEDGE BASED SYSTEMS; MATHEMATICAL MODELS; SET THEORY; WAREHOUSES;

COST MODELLING; DATA DEFINITION; DATA PARTITIONING; DATA SETS; DATA WAREHOUSING; EXPERIMENTAL STUDIES; HILL-CLIMBING ALGORITHMS; INTERNATIONAL CONFERENCES; KNOWLEDGE DISCOVERY; LANGUAGE SUPPORT; NEAR-OPTIMAL SOLUTIONS; OPTIMAL PARTITIONING; OPTIMIZATION TECHNIQUES; ORACLE 10G; RELATIONAL DATA; TWO TYPES;

DATA WAREHOUSES;

EID: 52949131544     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-85836-2_9     Document Type: Conference Paper

References (12)

1. Ozsu, M.T., Valduriez, P.: Principles of Distributed Database Systems, 2nd edn. Prentice Hall, Englewood Cliffs (1999)
2. Sanjay, A., Narasayya, V.R., Yang, B.: Integrating vertical and horizontal partitioning into automated physical database design. In: Sigmod 2004, pp. 359-370 (June 2004)
3. Papadomanolakis, S., Ailamaki, A.: AutoPart: Automating Schema Design for Large Scientific Databases Using Data Partitioning. In: Proceedings of the 16th International Conference on Scientific and Statistical Database Management (SS-DBM 2004), June 2004, pp. 383-392 (2004)
4. Eadon, G., Chong, E.I., Shankar, S., Raghavan, A., Srinivasan, J., Das, S.: Supporting table partitioning by reference in oracle. In: SIGMOD 2008 (to appear, 2008)
5. Bellatreche, L., Boukhalfa, K., Abdalla, H.I.: Saga: A combination of genetic and simulated annealing algorithms for physical data warehouse design. In: 23rd British National Conference on Databases, July 2006, pp. 212-219 (2006)
6. 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)
7. Navathe, S., Karlapalem, K., Ra, M.: A mixed partitioning methodology for distributed database design. Journal of Computer and Software Engineering 3(4), 395-426 (1995)
8. Ceri, S., Negri, M., Pelagatti, G.: Horizontal data partitioning in database design. In: Proceedings of the ACM SIGMOD International Conference on Management of Data. SIGPLAN Notices, pp. 128-136 (1982)
9. Karlapalem, K., Navathe, S.B., Ammar, M.: Optimal redesign policies to support dynamic processing of applications on a distributed database system. Information Systems 21(4), 353-367 (1996)
10. Tucker, A., Crampton, J., Swift, S.: Rgfga: An efficient representation and crossover for grouping genetic algorithms. Evol. Comput. 13(4), 477-499 (2005)
11. Garey, M.R., Johnson, D.S.: Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1990)
12. OLAP Council, Apb-1 olap benchmark, release ii (1998), http://www.olapcouncil.org/research/resrchly.html