Обзор подходов к организации физического уровня в СУБД
Ключевые слова:
базы данных, физический уровень СУБД, настройка СУБД, вертикальное фрагментирование, горизонтальное фрагментирование, размещение данных,Аннотация
В данной работе мы рассмотрели различные методы организации физического уровня СУБД: вертикальное и горизонтальное фрагментирование, а также вкратце нами затронут вопрос репликации. Указанные методы были рассмотрены не только для локальных, но и для распределенных СУБД. Последним было уделено повышенное внимание: были рассмотрены методы размещения данных на узлах распределенной системы. Кроме теоретических работ, приведены работы практического характера, в которых освещены вопросы применения вышеуказанных методов в современных коммерческих СУБД. Они были рассмотрены как с позиции пользователя, так и с позиций архитектора и программиста СУБДЛитература
Лакомов Д.П. Требования к системе реструктурирования базы данных // Тр. СПИИРАН. 2004. Т. 2, № 1. С. 312–315. URL: http://mi.mathnet.ru/trspy164
Новосельский В.Б. Метод автоматизации проектирования распределенной реляционной базы данных // Программные продукты и системы. 2008. № 3. С. 45–48. URL: http://swsys.ru/index.php?page=article&id=1578
Цыбанков Е.И. Проектирование распределенной базы данных с использованием генетического алгоритма // Труды интернет-конференции «Актуальные проблемы аппаратно-программного и информационного обеспечения науки, образования, культуры и бизнеса». МГУПИ, 2010. URL: http://it4.mgupi.ru/files/internet/2010/Cybankov.pdf
Abadi D. J., Boncz P. A., Harizopoulos S. Column-oriented database systems // Proc. VLDB Endow. 2009. Vol. 2, no. 2. P. 1664–1665. URL: http://dl.acm.org/citation.cfm?id=1687553.1687625
Yu C.T. , Cheing-mei Suen, Lam K., Siu M.K. Adaptive record clustering / // ACM Trans. Database Syst. 1985. Vol. 10. P. 180–204. URL: http://doi.acm.org/10.1145/3857.3861
Agrawal S., Chu E., Narasayya V. Automatic physical design tuning: workload as a sequence // Proceedings of the 2006 ACM SIGMOD international conference on Management of data. SIGMOD ’06. New York, NY, USA : ACM, 2006. P. 683–694. URL: http://doi.acm.org/10.1145/ 1142473.1142549
Agrawal S., Narasayya V., Yang B. Integrating vertical and horizontal partitioning into automated physical database design // Proceedings of the 2004 ACM SIGMOD international conference on Management of data. SIGMOD ’04. New York, NY, USA : ACM, 2004. P. 359–370. URL: http://doi.acm.org/10.1145/1007568.1007609
APB-1 OLAP Benchmark, Release II. OLAP Council, Nov. 1998. www. olapcouncil.org/research/bmarkly.htm. Дата просмотра: 30/07/2012
Apers P. M. G. Data allocation in distributed database systems // ACM Trans. Database Syst. 1988. Vol. 13. P. 263–304. URL: http: //doi.acm.org/10.1145/44498.45063
Applying genetic algorithms in database partitioning / Vincent Ng, Dik Man Law, Narasimhaiah Gorla, Chi Kong Chan // Proceedings of the 2003 ACM symposium on Applied computing. SAC ’03. New York, NY, USA : ACM, 2003. P. 544–549. URL: http://doi.acm.org/10.1145/ 952532.952639
An automated, yet interactive and portable DB designer / Ioannis Alagiannis, Debabrata Dash, Karl Schnaitter et al. // Proceedings of the 2010 ACM SIGMOD International Conference on Management of data. SIGMOD ’10. New York, NY, USA : ACM, 2010. P. 1183–1186. URL: http://doi.acm.org/10.1145/1807167.1807314
An automated, yet interactive and portable DB designer / Ioannis Alagiannis, Debabrata Dash, Karl Schnaitter et al. // Proceedings of the 2010 ACM SIGMOD International Conference on Management of data. SIGMOD ’10. New York, NY, USA : ACM, 2010. P. 1183–1186. URL: http://doi.acm.org/10.1145/1807167.1807314
Automating physical database design in a parallel database / Jun Rao, Chun Zhang, Nimrod Megiddo, Guy Lohman // Proceedings of the 2002 ACM SIGMOD international conference on Management of data. SIGMOD ’02. New York, NY, USA : ACM, 2002. P. 558–569. URL: http://doi. acm.org/10.1145/564691.564757
Badia A., Lemire D. A call to arms: revisiting database design // SIGMOD Rec. 2011. Vol. 40, no. 3. P. 61–69. URL: http://doi.acm.org/10.1145/ 2070736.2070750
Badia A., Lemire D. A distribution design methodology for object DBMS // Distributed and Parallel Databases. 2004. Vol. 16. P. 45– 90. 10.1023/B:DAPD.0000026268.04288.b9. URL: http://dx.doi.org/10. 1023/B:DAPD.0000026268.04288.b9
Bell D. A. Difficult data placement problems // The Computer Journal. 1984. Vol. 27, no. 4. P. 315–320. http://comjnl.oxfordjournals.org/content/27/4/315.full.pdf+html
Bell D. A. Physical record clustering in databases // Kybernetes. 1984. Vol. 13. P. 31–37
Bellatreche L., Benkrid S. A joint design approach of partitioning and allocation in parallel data warehouses // Data Warehousing and Knowledge Discovery / Ed. by Torben Pedersen, Mukesh Mohania, A Tjoa. Springer Berlin / Heidelberg, 2009. Vol. 5691 of Lecture Notes in Computer Science. P. 99–110. 10.1007/978-3-642-03730-6 9. URL: http://dx.doi.org/ 10.1007/978-3-642-03730-6\_9
Bellatreche L., Boukhalfa K., Abdalla H. I. Saga: A combination of genetic and simulated annealing algorithms for physical data warehouse design // BNCOD. 2006. P. 212–219
Bellatreche L., Boukhalfa K., Richard P. Data partitioning in data warehouses: Hardness study, heuristics and ORACLE validation // Data Warehousing and Knowledge Discovery / Ed. by Il-Yeol Song, Johann Eder, Tho Nguyen. Springer Berlin / Heidelberg, 2008. Vol. 5182 of Lecture Notes in Computer Science. P. 87–96. 10.1007/978-3-540-85836-2 9. URL: http://dx.doi.org/10.1007/978-3-540-85836-2\_9
Bellatreche L., Cuzzocrea A., Benkrid S. F&A: a methodology for effectively and efficiently designing parallel relational data warehouses on heterogenous database clusters // Proceedings of the 12th international conference on Data warehousing and knowledge discovery. DaWaK’10. Berlin, Heidelberg : Springer-Verlag, 2010. P. 89–104. URL: http://dl.acm.org/citation. cfm?id=1881923.1881934
Bellatreche L., Karlapalem K., Simonet A. Algorithms and support for horizontal class partitioning in object-oriented databases // Distributed and Parallel Databases. 2000. Vol. 8. P. 155–179. 10.1023/A:1008745624048. URL: http://dx.doi.org/10.1023/A:1008745624048
Bellatreche L., Woameno K. Y. Dimension table driven approach to referential partition relational data warehouses // Proceedings of the ACM twelfth international workshop on Data warehousing and OLAP. DOLAP ’09. New York, NY, USA : ACM, 2009. P. 9–16. URL: http://doi.acm.org/10.1145/1651291.1651294
Bernardino J., Madeira H. Experimental evaluation of a new distributed partitioning technique for data warehouses // Proceedings of the International Database Engineering & Applications Symposium. IDEAS ’01. Washington, DC, USA : IEEE Computer Society, 2001. P. 312–321. URL: http://dl.acm.org/citation.cfm?id=646290.687056
Blankinship R., Hevner A. R., Yao S. B. An iterative method for distributed database design // Proceedings of the 17th International Conference on Very Large Data Bases. VLDB ’91. San Francisco, CA, USA : Morgan Kaufmann Publishers Inc., 1991. P. 389–400. URL: http://dl.acm.org/citation.cfm? id=645917.672331
Bouakkaz M., Ouinten Y., Ziani B. Vertical fragmentation of data warehouses using the FP-Max algorithm // Innovations in Information Technology (IIT), 2012 International Conference on. 2012. march. P. 273–276
Boukhalfa K., Bellatreche L., Alimazighi Z. HP&BJI: A combined selection of data partitioning and join // New Trends in Data Warehousing and Data Analysis / Ed. by Stanislaw Kozielski, Robert Wrembel. Springer US, 2009. Vol. 3 of Annals of Information Systems. P. 1–23. 10.1007/978-0-387-87431- 9 10. URL: http://dx.doi.org/10.1007/978-0-387-87431-9\_10
Bruno N. A critical look at the tab benchmark for physical design tools // SIGMOD Rec. 2007. Vol. 36, no. 4. P. 7–12. URL: http://doi.acm.org/ 10.1145/1361348.1361349
Bruno N., Chaudhuri S. Automatic physical database tuning: a relaxation-based approach // Proceedings of the 2005 ACM SIGMOD international conference on Management of data. SIGMOD ’05. New York, NY, USA : ACM, 2005. P. 227–238. URL: http://doi.acm.org/10.1145/ 1066157.1066184
Brunstrom A., Leutenegger S. T., Simha R. Experimental evaluation of dynamic data allocation strategies in a distributed database with changing workloads // Proceedings of the fourth international conference on Information and knowledge management. CIKM ’95. New York, NY, USA : ACM, 1995. P. 395–402. URL: http://doi.acm.org/10.1145/221270. 221652
Casey R. G. Allocation of copies of a file in an information network // Proceedings of the May 16-18, 1972, spring joint computer conference. AFIPS ’72 (Spring). New York, NY, USA : ACM, 1972. P. 617–625. URL: http://doi.acm.org/10.1145/1478873.1478955
Ceri S., Martella G., Pelagatti G. Optimal file allocation in a computer network: a solution method based on the knapsack problem // Computer Networks (1976). 1982. Vol. 6, no. 5. P. 345–357. URL: http://www.sciencedirect.com/science/article/pii/0376507582901040
Ceri S., Navathe S., Wiederhold G. Distribution design of logical database schemas // IEEE Transactions on Software Engineering. 1983. Vol. 9. P. 487–504
Ceri S., Negri M., Pelagatti G. Horizontal data partitioning in database design // Proceedings of the 1982 ACM SIGMOD international conference on Management of data. SIGMOD ’82. New York, NY, USA : ACM, 1982. P. 128–136. URL: http://doi.acm.org/10.1145/582353.582376
Ceri S., Pernici B., Wiederhold G. Distributed database design methodologies // Proceedings of the IEEE. 1987. Vol. 75, no. 5. P. 533–546
Chang S.-K., Liu A.-C. File allocation in a distributed database // International Journal of Parallel Programming. 1982. Vol. 11. P. 325–340. 10.1007/BF01001955. URL: http://dx.doi.org/10.1007/BF01001955
Chaturvedi A., Choubey A., Roan J. Scheduling the allocation of data fragments in a distributed database environment: a machine learning approach // Engineering Management, IEEE Transactions on. 1994. Vol. 41, no. 2. P. 194–207
Chaudhuri S., Narasayya V. Microsoft index turning wizard for SQL Server 7.0 // SIGMOD Rec. 1998. Vol. 27, no. 2. P. 553–554. URL: http: //doi.acm.org/10.1145/276305.276378
Chaudhuri S., Weikum G. Self-management technology in databases // Encyclopedia of Database Systems / Ed. by Ling Liu, M.Tamer ¨ Ozsu. Springer US, 2009. P. 2550–2555. URL: http://dx.doi.org/10.1007/ 978-0-387-39940-9\_334
Cheng C. Algorithms for vertical partitioning in database physical design // Omega. 1994. Vol. 22, no. 3. P. 291–303. URL: http: //www.sciencedirect.com/science/article/pii/0305048394900426
Cheng C.-H. A branch and bound clustering algorithm // Systems, Man and Cybernetics, IEEE Transactions on. 1995. Vol. 25, no. 5. P. 895–898
Cheng C.-H., Lee W.-K., Wong K.-F. A genetic algorithm-based clustering approach for database partitioning // Systems, Man, and Cybernetics, Part C: Applications and Reviews, IEEE Transactions on. 2002. Vol. 32, no. 3. P. 215–230
Cheng C.-H., Motwani J. An examination of cluster identification-based algorithms for vertical partitions // Int. J. Bus. Inf. Syst. 2009. Vol. 4, no. 6. P. 622–638. URL: http://dx.doi.org/10.1504/IJBIS.2009.026695
Chiu G.-M., Raghavendra C.Chiu G.-M., Raghavendra C. A model for optimal database allocation in distributed computing systems // INFOCOM ’90. Ninth Annual Joint Conference of the IEEE Computer and Communication Societies. ’The Multiple Facets of Integration’. Proceedings., IEEE. Vol. 3. 1990. jun. P. 827– 833
Chu W., Ieong I. A transaction-based approach to vertical partitioning for relational database systems // Software Engineering, IEEE Transactions on. 1993. Vol. 19, no. 8. P. 804–812
Chu W. W. Optimal file allocation in a multiple computer system // IEEE Trans. Comput. 1969. Vol. 18, no. 10. P. 885–889. URL: http: //dx.doi.org/10.1109/T-C.1969.222542
Clotho: decoupling memory page layout from storage organization / Minglong Shao, Jiri Schindler, Steven W. Schlosser et al. // Proceedings of the Thirtieth international conference on Very large data bases - Volume 30. VLDB ’04. VLDB Endowment, 2004. P. 696–707. URL: http://dl.acm.org/citation.cfm?id=1316689.1316750
Copeland G. P., Khoshafian S. N. Clotho: decoupling memory page layout from storage organization / Minglong Shao, Jiri Schindler, Steven W. Schlosser et al. // Proceedings of the Thirtieth international conference on Very large data bases - Volume 30. VLDB ’04. VLDB Endowment, 2004. P. 696–707. URL: http://dl.acm.org/citation.cfm?id=1316689.1316750
Corcoran A. L., Hale J. A genetic algorithm for fragment allocation in a distributed database system // Proceedings of the 1994 ACM symposium on Applied computing. SAC ’94. New York, NY, USA : ACM, 1994. P. 247–250. URL: http://doi.acm.org/10.1145/326619.326738
Cornell D., Yu P. An effective approach to vertical partitioning for physical design of relational databases // Software Engineering, IEEE Transactions on. 1990. Vol. 16, no. 2. P. 248–258
Cornell D. W., Yu P. S. An effective approach to vertical partitioning for physical design of relational databases // Software Engineering, IEEE Transactions on. 1990. Vol. 16, no. 2. P. 248–258
Cornell D. W., Yu P. S. On optimal site assignment for relations in the distributed database environment // IEEE Trans. Softw. Eng. 1989. Vol. 15, no. 8. P. 1004–1009. URL: http://dx.doi.org/10.1109/32.31356
Costa M., Madeira H. Handling big dimensions in distributed data warehouses using the DWS technique // Proceedings of the 7th ACM international workshop on Data warehousing and OLAP. DOLAP ’04. New York, NY, USA : ACM, 2004. P. 31–37. URL: http://doi.acm.org/10.1145/ 1031763.1031770
Data placement in Bubba / George Copeland, William Alexander, Ellen Boughter, Tom Keller // Proceedings of the 1988 ACM SIGMOD international conference on Management of data. SIGMOD ’88. New York, NY, USA : ACM, 1988. P. 99–108. URL: http://doi.acm.org/10.1145/ 50202.50213
Database tuning advisor for Microsoft SQL Server 2005 / Sanjay Agrawal, Surajit Chaudhuri, Lubor Kollar et al. // Proceedings of VLDB. 2004. P. 1110–1121
Database tuning advisor for Microsoft SQL server 2005: demo / Sanjay Agrawal, Surajit Chaudhuri, Lubor Kollar et al. // Proceedings of the 2005 ACM SIGMOD international conference on Management of data. SIGMOD ’05. New York, NY, USA : ACM, 2005. P. 930–932. URL: http://doi.acm.org/10.1145/1066157.1066292
Daudpota N. H. Five steps to construct a model of data allocation for distributed database systems // J. Intell. Inf. Syst. 1998. Vol. 11, no. 2. P. 153–168. URL: http://dx.doi.org/10.1023/A:1008676718656
DB2 advisor: an optimizer smart enough to recommend its own indexes / G. Valentin, M. Zuliani, D.C. Zilio et al. // Data Engineering, 2000. Proceedings. 16th International Conference on. 2000. P. 101–110
DB2 design advisor: integrated automatic physical database design / Daniel C. Zilio, Jun Rao, Sam Lightstone et al. // Proceedings of the Thirtieth international conference on Very large data bases - Volume 30. VLDB ’04. VLDB Endowment, 2004. P. 1087–1097. URL: http: //dl.acm.org/citation.cfm?id=1316689.1316783
De P., Park J. S., Pirkul H. An integrated model of record segmentation and access path selection for databases // Information Systems. 1988. Vol. 13, no. 1. P. 13–30. URL: http://www.sciencedirect.com/science/article/ pii/0306437988900245
Designing a distributed database on a local area network: a methodology and decision support system / H. Lee, Y.-K. Park, G. Jang, S.- Y. Huh // Information and Software Technology. 2000. Vol. 42, no. 3. P. 171–184. URL: http://www.sciencedirect.com/science/article/pii/ S0950584999000567
Didriksen T., Galindo-Legaria C. A., Dahle E. Database de-centralization — a practical approach // Proceedings of the 21th International Conference on Very Large Data Bases. VLDB ’95. San Francisco, CA, USA : Morgan Kaufmann Publishers Inc., 1995. P. 654–665. URL: http://dl.acm.org/ citation.cfm?id=645921.673313
Dowdy L. W., Foster D. V. Comparative models of the file assignment problem // ACM Comput. Surv. 1982. Vol. 14, no. 2. P. 287–313. URL: http://doi.acm.org/10.1145/356876.356883
Du J., Alhajj R., Barker K. Genetic algorithms based approach to database vertical partition // J. Intell. Inf. Syst. 2006. Vol. 26. P. 167–183. URL: http://dl.acm.org/citation.cfm?id=1139987.1139989
Du J., Barker K., Alhajj R. Attraction — a global affinity measure for database vertical partitioning // ICWI. IADIS, 2003. P. 538–548
Du X., Maryanski F. Data allocation in a dynamically reconfigurable environment // Data Engineering, 1988. Proceedings. Fourth International Conference on. 1988. feb. P. 74–81
An enhanced grouping algorithm for vertical partitioning problem in DDBs / F. Marir, Y. Najjar, M.Y. AlFaress, H.I. Abdalla // Computer and information sciences, 2007. iscis 2007. 22nd international symposium on. 2007. nov. P. 1–6
Eswaran K. P. Placement of records in a file and file allocation in a computer // IFIP Congress. 1974. P. 304–307
Evolutionary algorithms for allocating data in distributed database systems / Ishfaq Ahmad, Kamalakar Karlapalem, Yu-Kwong Kwok, Siu-Kai So // Distrib. Parallel Databases. 2002. Vol. 11. P. 5–32. URL: http://dl.acm.org/citation.cfm?id=509176.509177
Finkelstein S., Schkolnick M., Tiberio P. Physical database design for relational databases // ACM Trans. Database Syst. 1988. Vol. 13. P. 91–128. URL: http://doi.acm.org/10.1145/42201.42205
A formal approach to the vertical partitioning problem in distributed database design / J. Muthuraj, S. Chakravarthy, R. Varadarajan, S. B. Navathe // Proceedings of the second international conference on Parallel and distributed information systems. PDIS ’93. Los Alamitos, CA, USA : IEEE Computer Society Press, 1993. P. 26–35. URL: http: //dl.acm.org/citation.cfm?id=382019.382410
French C. D. One size fits all” database architectures do not work for DSS // SIGMOD Rec. 1995. Vol. 24. P. 449–450. URL: http://doi.acm.org/ 10.1145/568271.223871
Frieder O., Siegelmann H. Multiprocessor document allocation: a genetic algorithm approach // Knowledge and Data Engineering, IEEE Transactions on. 1997. Vol. 9, no. 4. P. 640–642
Furtado P. Experimental evidence on partitioning in parallel data warehouses // Proceedings of the 7th ACM international workshop on Data warehousing and OLAP. DOLAP ’04. New York, NY, USA : ACM, 2004. P. 23–30. URL: http://doi.acm.org/10.1145/1031763.1031769
Gavish B., Pirkul H. Computer and database location in distributed computer systems // IEEE Transactions on Computers. 1986. Vol. 35. P. 583–590
Gebaly K. E., Aboulnaga A. Robustness in automatic physical database design // Proceedings of the 11th international conference on Extending database technology: Advances in database technology. EDBT ’08. New York, NY, USA : ACM, 2008. P. 145–156. URL: http://doi.acm.org/10. 1145/1353343.1353365
Ghandeharizadeh S., DeWitt D. J. Hybrid-range partitioning strategy: A new declustering strategy for multiprocessor database machines // Proceedings of the 16th International Conference on Very Large Data Bases. VLDB ’90. San Francisco, CA, USA : Morgan Kaufmann Publishers Inc., 1990. P. 481–492. URL: http://dl.acm.org/citation.cfm?id=645916.671988
Ghandeharizadeh S., DeWitt D. J. Magic: A multiattribute declustering mechanism for multiprocessor database machines // IEEE Trans. Parallel Distrib. Syst. 1994. Vol. 5, no. 5. P. 509–524. URL: http://dx.doi.org/ 10.1109/71.282561
Ghandeharizadeh S., DeWitt D. J., Qureshi W. A performance analysis of alternative multi-attribute declustering strategies // SIGMOD Rec. 1992. Vol. 21, no. 2. P. 29–38. URL: http://doi.acm.org/10.1145/141484. 130293
Goals and benchmarks for autonomic configuration recommenders / Mariano P. Consens, Denilson Barbosa, Adrian Teisanu, Laurent Mignet // Proceedings of the 2005 ACM SIGMOD international conference on Management of data. SIGMOD ’05. New York, NY, USA : ACM, 2005. P. 239–250. URL: http://doi.acm.org/10.1145/1066157.1066185
Golfarelli M., Maio D., Rizzi S. Vertical fragmentation of views in relational data warehouses // Proc. Settimo Convegno Nazionale Sistemi Evoluti per Basi di Dati (SEBD 1999). 1999. P. 19–33
Gorla N., Yan B. P. W. Vertical fragmentation in databases using datamining technique // Database Technologies: Concepts, Methodologies, Tools, and Applications / Ed. by John Erickson. IGI Global, 2009. P. 2543– 2563
Guinepain S., Gruenwald L. Research issues in automatic database clustering // SIGMOD Rec. 2005. Vol. 34. P. 33–38. URL: http: //doi.acm.org/10.1145/1058150.1058157
Guinepain S., Gruenwald L. Automatic database clustering using data mining // Proceedings of the 17th International Conference on Database and Expert Systems Applications. DEXA ’06. Washington, DC, USA : IEEE Computer Society, 2006. P. 124–128. URL: http://dx.doi.org/10. 1109/DEXA.2006.32
Hababeh I. O., Ramachandran M., Bowring N. A high-performance computing method for data allocation in distributed database systems // J. Supercomput. 2007. Vol. 39, no. 1. P. 3–18. URL: http://dx.doi.org/ 10.1007/s11227-006-0001-8
Hammer M., Niamir B. A heuristic approach to attribute partitioning // Proceedings of the 1979 ACM SIGMOD international conference on Management of data. SIGMOD ’79. New York, NY, USA : ACM, 1979. P. 93–101. URL: http://doi.acm.org/10.1145/582095.582110
Hankins R. A., Patel J. M. Data morphing: an adaptive, cache-conscious storage technique // Proceedings of the 29th international conference on Very large data bases - Volume 29. VLDB ’2003. VLDB Endowment, 2003. P. 417–428. URL: http://dl.acm.org/citation.cfm?id=1315451.1315488
Hauglid J. O., Ryeng N. H., Nørv˚ag K. Dyfram: dynamic fragmentation and replica management in distributed database systems // Distrib. Parallel Databases. 2010. Vol. 28. P. 157–185. URL: http://dx.doi.org/10. 1007/s10619-010-7068-1
Hellerstein J. M., Stonebraker M., Hamilton J. Architecture of a database system // Found. Trends databases. 2007. Vol. 1, no. 2. P. 141–259. URL: http://dx.doi.org/10.1561/1900000002
High Performance Parallel Database Processing and Grid Databases / David Taniar, Clement H. C. Leung, Wenny Rahayu, Sushant Goel. Wiley Publishing, 2008. ISBN: 0470107626, 9780470107621
Hoffer J. A. An integer programming formulation of computer database design problems // Inf. Sci. 1976. Vol. 11. P. 29–48
Hoffer J. A., Severance D. G. The use of cluster analysis in physical data base design // Proceedings of the 1st International Conference on Very Large Data Bases. VLDB ’75. New York, NY, USA : ACM, 1975. P. 69–86. URL: http://doi.acm.org/10.1145/1282480.1282486
Hua K. A., Lee C. An adaptive data placement scheme for parallel database computer systems // Proceedings of the 16th International Conference on Very Large Data Bases. VLDB ’90. San Francisco, CA, USA : Morgan Kaufmann Publishers Inc., 1990. P. 493–506. URL: http://dl.acm.org/ citation.cfm?id=645916.671965
Huang Y.-F., Chen J.-H. Fragment allocation in distributed database design // Journal of Information Science and Engineering. 2001. Vol. 17. P. 491–506
Huang Y.-F., Van C.-H. Vertical partitioning in database design // Information Sciences. 1995. Vol. 86, no. 1-3. P. 19–35. URL: http://www.sciencedirect.com/science/article/pii/002002559500018K
HYRISE: a main memory hybrid storage engine / Martin Grund, Jens Kr¨uger, Hasso Plattner et al. // Proc. VLDB Endow. 2010. Vol. 4, no. 2. P. 105–116. URL: http://dl.acm.org/citation.cfm?id=1921071. 1921077
Idreos S., Kersten M. L., Manegold S. Database cracking // CIDR. www.cidrdb.org, 2007. P. 68–78
Jakobsson M. Reducing block accesses in inverted files by partial clustering // Information Systems. 1980. Vol. 5, no. 1. P. 1–5. URL: http://www. sciencedirect.com/science/article/pii/0306437980900630
Kamali S., Ghodsnia P., Daudjee K. Dynamic data allocation with replication in distributed systems // Performance Computing and Communications Conference (IPCCC), 2011 IEEE 30th International. 2011. nov. P. 1–8
Karimi Adl R., Rouhani Rankoohi S. A new ant colony optimization based algorithm for data allocation problem in distributed databases // Knowledge and Information Systems. 2009. Vol. 20. P. 349–373. 10.1007/s10115-008- 0182-y. URL: http://dx.doi.org/10.1007/s10115-008-0182-y
Karlapalem K., Pun N. M. Query-driven data allocation algorithms for distributed database systems // Proceedings of the 8th International Conference on Database and Expert Systems Applications. DEXA ’97. London, UK, UK : Springer-Verlag, 1997. P. 347–356. URL: http://dl.acm.org/ citation.cfm?id=648310.754564
Stepwise redesign of distributed relational databases : Rep. : HKUST-CS97- 12 / Department of Computer Science, The Hong-Kong University of Science & Technology ; Executor: Ladan Kazerouni, Kamalakar Karlapalem : September 1997
Kemme B., Alonso G. A new approach to developing and implementing eager database replication protocols // ACM Trans. Database Syst. 2000. Vol. 25, no. 3. P. 333–379. URL: http://doi.acm.org/10.1145/363951. 363955
Khalil N., Eid D., Khair M. Availability and reliability issues in distributed databases using optimal horizontal fragmentation // Database and Expert Systems Applications / Ed. by Trevor Bench-Capon, Giovanni Soda, A Tjoa. Springer Berlin / Heidelberg, 1999. Vol. 1677 of Lecture Notes in Computer Science. P. 771–780. 10.1007/3-540-48309-8 72. URL: http://dx.doi.org/ 10.1007/3-540-48309-8\_72
Khan S., Hoque A. A new technique for database fragmentation in distributed systems // International Journal of Computer Applications. 2010. Vol. 5(9). P. 20–24
Lightstone S. S., Bhattacharjee B. Automated design of multidimensional clustering tables for relational databases // Proceedings of the Thirtieth international conference on Very large data bases - Volume 30. VLDB ’04. VLDB Endowment, 2004. P. 1170–1181. URL: http://dl.acm. org/citation.cfm?id=1316689.1316789
Lima A., Mattoso M., Valduriez P. OLAP query processing in a database cluster // Euro-Par 2004 Parallel Processing / Ed. by Marco Danelutto, Marco Vanneschi, Domenico Laforenza. Springer Berlin / Heidelberg, 2004. Vol. 3149 of Lecture Notes in Computer Science. P. 355–362. 10.1007/978- 3-540-27866-5 46. URL: http://dx.doi.org/10.1007/978-3-540-27866-5 _46.
Lin X., Orlowska M., Zhang Y. A graph based cluster approach for vertical partitioning in database design // Data & Knowledge Engineering. 1993. Vol. 11, no. 2. P. 151–169. URL: http://www.sciencedirect.com/science/ article/pii/0169023X93900038
Lin X., Orlowska M. E., Zhang Y. On data allocation with the minimum overall communication costs in distributed database design // Proceedings of the Fifth International Conference on Computing and Information. ICCI ’93. Washington, DC, USA : IEEE Computer Society, 1993. P. 539–544. URL: http://dl.acm.org/citation.cfm?id=645468.654762
Ma H. Distribution Design for Complex Value Databases : Ph. D. thesis /
Ma H., Schewe K.-D., Kirchberg M. A heuristic approach to fragmentation incorporating query information // Proceedings of the 2007 conference on Databases and Information Systems IV: Selected Papers from the Seventh International Baltic Conference DB&IS’2006. Amsterdam, The Netherlands, The Netherlands : IOS Press, 2007. P. 103–116. URL: http://dl.acm.org/ citation.cfm?id=1565421.1565432
Mahmoud S., Riordon J. S. Optimal allocation of resources in distributed information networks // ACM Trans. Database Syst. 1976. Vol. 1, no. 1. P. 66–78. URL: http://doi.acm.org/10.1145/320434.320449
Mami I., Bellahsene Z. A survey of view selection methods // SIGMOD Rec. 2012. Vol. 41, no. 1. P. 20–29. URL: http://doi.acm.org/10.1145/ 2206869.2206874
March S. T., Rho S. Allocating data and operations to nodes in distributed database design // IEEE Trans. on Knowl. and Data Eng. 1995. Vol. 7, no. 2. P. 305–317. URL: http://dx.doi.org/10.1109/69.382299
McIver Jr. W. J., King R. Self-adaptive, on-line reclustering of complex object data // SIGMOD Rec. 1994. Vol. 23, no. 2. P. 407–418. URL: http://doi.acm.org/10.1145/191843.191924
Mehta M., DeWitt D. J. Data placement in shared-nothing parallel database systems // The VLDB Journal. 1997. Vol. 6. P. 53–72. URL: http: //dx.doi.org/10.1007/s007780050033
Menon S. Allocating fragments in distributed databases // IEEE Trans. Parallel Distrib. Syst. 2005. Vol. 16, no. 7. P. 577–585. URL: http: //dx.doi.org/10.1109/TPDS.2005.77
Moghrabi I., Makholian R. A new approach to clustering records in information retrieval systems // Information Retrieval. 2000. Vol. 3. P. 105– 126. 10.1023/A:1009901830009. URL: http://dx.doi.org/10.1023/A: 1009901830009
Morgan H. L., Levin K. D. Optimal program and data locations in computer networks // Commun. ACM. 1977. Vol. 20, no. 5. P. 315–322. URL: http://doi.acm.org/10.1145/359581.359591
Motzkin D. An optimal data allocation model for distributed databases // Mathematical and Computer Modelling. 1988. Vol. 11, no. 0. P. 920–925. URL: http://www.sciencedirect.com/science/article/pii/ 0895717788906280
Mukkamala R., Bruell S. C., Shultz R. K. Design of partially replicated
Navathe S. B., Karlapalem K., Ra M. A mixed fragmentation methodology for initial distributed database design // Journal of Computer and Software Engineering. 1995. Vol. 3
Navathe S. B., Ra M. Vertical partitioning for database design: a graphical algorithm // Proceedings of the 1989 ACM SIGMOD international conference on Management of data. SIGMOD ’89. New York, NY, USA : ACM, 1989. P. 440–450. URL: http://doi.acm.org/10.1145/67544.66966
Nehme R., Bruno N. Automated partitioning design in parallel database systems // Proceedings of the 2011 international conference on Management of data. SIGMOD ’11. New York, NY, USA : ACM, 2011. P. 1137–1148. URL: http://doi.acm.org/10.1145/1989323.1989444
Noaman A. Y., Barker K. A horizontal fragmentation algorithm for the fact relation in a distributed data warehouse // Proceedings of the eighth international conference on Information and knowledge management. CIKM ’99. New York, NY, USA : ACM, 1999. P. 154–161. URL: http://doi. acm.org/10.1145/319950.319972
An objective function for vertically partitioning relations in distributed databases and its analysis / Sharma Chakravarthy, Jaykumar Muthuraj, Ravi Varadarajan, Shamkant B. Navathe // Distributed and Parallel Databases. 1994. Vol. 2. P. 183–207. 10.1007/BF01267326. URL: http://dx.doi.org/10.1007/BF01267326
Omiecinski E., Scheuermann P. A parallel algorithm for record clustering // ACM Trans. Database Syst. 1990. Vol. 15. P. 599–624. URL: http://doi.acm.org/10.1145/99935.99947
Ozsu M. T., Valduriez P. Principles of distributed database systems (2nd ed.). Upper Saddle River, NJ, USA : Prentice-Hall, Inc., 1999. ISBN: 0-13- 659707-6
O’Neil P.E. , O’Neil E. J., X. Chen The Star Schema Benchmark (SSB). http://www.cs.umb.edu/~poneil/StarSchemaB.PDF. Дата просмотра: 30/07/2012
Pai-Cheng C. A transaction-oriented approach to attribute partitioning // Information Systems. 1992. Vol. 17, no. 4. P. 329–342. URL: http: //www.sciencedirect.com/science/article/pii/030643799290022F
Papadomanolakis S., Ailamaki A. AutoPart: automating schema design for large scientific databases using data partitioning // Scientific and Statistical Database Management, 2004. Proceedings. 16th International Conference on. 2004. june. P. 383–392
Papadomanolakis S., Ailamaki A. An integer linear programming approach to database design // Proceedings of the 2007 IEEE 23rd International Conference on Data Engineering Workshop. ICDEW ’07. Washington, DC, USA : IEEE Computer Society, 2007. P. 442–449. URL: http://dx.doi.org/10.1109/ICDEW.2007.4401027
Papadomanolakis S., Dash D., Ailamaki A. Efficient use of the query optimizer for automated physical design // Proceedings of the 33rd international conference on Very large data bases. VLDB ’07. VLDB Endowment, 2007. P. 1093–1104. URL: http://dl.acm.org/citation.cfm?id=1325851. 1325974
Parallel OLAP query processing in database clusters with data replication / Alexandre Lima, A., Camille Furtado, Patrick Valduriez, Marta Mattoso // Distributed and Parallel Databases. 2009. Vol. 25, no. 1-2. P. 97–123. URL: http://hal.inria.fr/inria-00482183
PARINDA: an interactive physical designer for PostgreSQL / Cristina Maier, Debabrata Dash, Ioannis Alagiannis et al. // Proceedings of the 13th International Conference on Extending Database Technology. EDBT ’10. New York, NY, USA : ACM, 2010. P. 701–704. URL: http://doi.acm.org/10.1145/1739041.1739131
Park S.-J., Baik D.-K. A data allocation considering data availability in distributed database systems // Proceedings of the 1997 International Conference on Parallel and Distributed Systems. ICPADS ’97. Washington, DC, USA : IEEE Computer Society, 1997. P. 708–713. URL: http://dl.acm.org/citation.cfm?id=646861.707304.
Physical and virtual partitioning in OLAP database clusters / Camille Furtado, Alexandre A. B. Lima, Esther Pacitti et al. // Proceedings of the 17th International Symposium on Computer Architecture on High Performance Computing. SBAC-PAD ’05. Washington, DC, USA : IEEE Computer Society, 2005. P. 143–150. URL: http://dx.doi.org/10.1109/ CAHPC.2005.32
A query processing strategy for the decomposed storage model / Setrag Khoshafian, George P. Copeland, Thomas Jagodis et al. // Proceedings of the Third International Conference on Data Engineering. Washington, DC, USA : IEEE Computer Society, 1987. P. 636–643. URL: http://dl.acm.org/citation.cfm?id=645472.655555
Rahm E., Marek R. Analysis of dynamic load balancing strategies for parallel shared nothing database systems // Proceedings of the 19th International Conference on Very Large Data Bases. VLDB ’93. San Francisco, CA, USA : Morgan Kaufmann Publishers Inc., 1993. P. 182–193. URL: http: //portal.acm.org/citation.cfm?id=645919.672662
Ram S., Marsten R. A model for database allocation incorporating a concurrency control mechanism // Knowledge and Data Engineering, IEEE Transactions on. 1991. Vol. 3, no. 3. P. 389–395
Ram S., Narasimhan S. Database allocation in a distributed environment: incorporating a concurrency control mechanism and queuing costs // Manage. Sci. 1994. Vol. 40, no. 8. P. 969–983. URL: http://dx.doi.org/10. 1287/mnsc.40.8.969
Ramamurthy R., DeWitt D. J., Su Q. A case for fractured mirrors // Proceedings of the 28th international conference on Very Large Data Bases. VLDB ’02. VLDB Endowment, 2002. P. 430–441. URL: http: //dl.acm.org/citation.cfm?id=1287369.1287407
Recommending materialized views and indexes with the IBM DB2 design advisor / D.C. Zilio, C. Zuzarte, S. Lightstone et al. // Autonomic Computing, 2004. Proceedings. International Conference on. 2004. may. P. 180–187
Rivera-Vega P., Varadarajan R., Navathe S. Scheduling data redistribution in distributed databases // Data Engineering, 1990. Proceedings. Sixth International Conference on. 1990. feb. P. 166–173
Rodriguez L., Li X. A support-based vertical partitioning method for database design // Electrical Engineering Computing Science and Automatic Control (CCE), 2011 8th International Conference on. 2011. oct. P. 1–6
Rodriguez L., Li X. A vertical partitioning algorithm for distributed multimedia databases // Proceedings of the 22nd international conference on Database and expert systems applications - Volume Part II. DEXA’11. Berlin, Heidelberg : Springer-Verlag, 2011. P. 544–558. URL: http: //dl.acm.org/citation.cfm?id=2033546.2033607
Rohm U., Bohm K., Schek H.-J. OLAP query routing and physical design in a database cluster // Proceedings of the 7th International Conference on Extending Database Technology: Advances in Database Technology. EDBT ’00. London, UK, UK : Springer-Verlag, 2000. P. 254–268. URL: http: //dl.acm.org/citation.cfm?id=645339.650130
Sacca D., Wiederhold G. Database partitioning in a cluster of processors // ACM Trans. Database Syst. 1985. Vol. 10. P. 29–56. URL: http: //doi.acm.org/10.1145/3148.3161
Sarathy R., Shetty B., Sen A. A constrained nonlinear 0-1 program for data allocation // European Journal of Operational Research. 1997. Vol. 102, no. 3. P. 626–647. URL: http://www.sciencedirect.com/science/ article/pii/S0377221796002342
Savonnet M., Terrasse M., Y´etongnon K. Fragtique: A methodology for distributing object oriented databases // International Conference on Computing and Information. 1998
Shin D.-G., Irani K. B. Fragmenting relations horizontally using a knowledgebased approach // IEEE Trans. Softw. Eng. 1991. Vol. 17. P. 872–883. URL: http://dl.acm.org/citation.cfm?id=126262.126266
Singh A., Kahlon K. Non-replicated dynamic data allocation in distributed database systems // IJCSNS International Journal of Computer Science and Network Security. 2009. Vol. 9, no. 9. P. 176–180. URL: http://paper. ijcsns.org/07\_book/200909/20090922.pdf
Son J. H., Kim M.-H. α-partitioning algorithm: Vertical partitioning based on the fuzzy graph // Proceedings of the 12th International Conference on Database and Expert Systems Applications. DEXA ’01. London, UK, UK : Springer-Verlag, 2001. P. 537–546. URL: http://dl.acm.org/citation. cfm?id=648314.755837
Son J. H., Kim M.-H. An adaptable vertical partitioning method in distributed systems // Journal of Systems and Software. 2004. Vol. 73, no. 3. P. 551–561
Song S.-K., Gorla N. A genetic algorithm for vertical fragmentation and access path selection // The Computer Journal. 2000. Vol. 43, no. 1. P. 81– 93. http://comjnl.oxfordjournals.org/content/43/1/81.full.pdf+html
Stohr T., Martens H., Rahm E. Multi-dimensional database allocation for parallel data warehouses // Proceedings of the 26th International Conference on Very Large Data Bases. VLDB ’00. San Francisco, CA, USA : Morgan Kaufmann Publishers Inc., 2000. P. 273–284. URL: http://dl.acm.org/ citation.cfm?id=645926.671843
Stohr T., Rahm E. WARLOCK: A data allocation tool for parallel warehouses // Proceedings of the 27th International Conference on Very Large Data Bases. VLDB ’01. San Francisco, CA, USA : Morgan Kaufmann Publishers Inc., 2001. P. 721–722. URL: http://dl.acm.org/citation.cfm?id=645927.672208.
Sun J., Grosky W. I. Dynamic maintenance of multidimensional range data partitioning for parallel data processing // Proceedings of the 1st ACM international workshop on Data warehousing and OLAP. DOLAP ’98. New York, NY, USA : ACM, 1998. P. 72–79. URL: http://doi.acm.org/ 10.1145/294260.294275
Supporting table partitioning by reference in oracle / George Eadon, Eugene Inseok Chong, Shrikanth Shankar et al. // Proceedings of the 2008 ACM SIGMOD international conference on Management of data. SIGMOD ’08. New York, NY, USA : ACM, 2008. P. 1111–1122. URL: http: //doi.acm.org/10.1145/1376616.1376727
Suri R. A decentralized approach to optimal file allocation in computer networks // Decision and Control including the Symposium on Adaptive Processes, 1979 18th IEEE Conference on. Vol. 18. 1979. dec. P. 141–146
Tamhankar A. M., Ram S. Database fragmentation and allocation: an integrated methodology and case study // Trans. Sys. Man Cyber. Part A. 1998. Vol. 28, no. 3. P. 288–305. URL: http://dx.doi.org/10.1109/3468. 668961
Teorey T. J. Distributed database design: a practical approach and example // SIGMOD Rec. 1989. Vol. 18, no. 4. P. 23–39. URL: http://doi.acm.org/10.1145/74120.74124
Thiem A., Sattler K.-U. An integrated approach to performance monitoring for autonomous tuning // Proceedings of the 2009 IEEE International Conference on Data Engineering. ICDE ’09. Washington, DC, USA : IEEE Computer Society, 2009. P. 1671–1678. URL: http://dx.doi.org/10.1109/ICDE.2009.142
TPC Benchmark C. On-line transaction processing benchmark. http:// www.tpc.org/tpcc. Дата просмотра: 30/07/2012
TPC Benchmark H. Decision Support. http://www.tpc.org/tpch. Дата просмотра: 30/07/2012
Tsangaris M. M., Naughton J. F. On the performance of object clustering techniques // SIGMOD Rec. 1992. Vol. 21, no. 2. P. 144–153. URL: http://doi.acm.org/10.1145/141484.130308
Tsatalos O. G., Solomon M. H., Ioannidis Y. E. The GMAP: a versatile tool for physical data independence // The VLDB Journal. 1996. Vol. 5. P. 101–118. URL: http://dx.doi.org/10.1007/s007780050018
Ulus T., Uysal M. Heuristic approach to dynamic data allocation in distributed database systems // Pakistan Journal of Information and Technology. 2003. Vol. 2. P. 231–239
Ladjel Bellatreche, Soumia Benkrid, Ahmad Ghazal et al. Verification of partitioning and allocation techniques on teradata DBMS // Algorithms and Architectures for Parallel Processing / Ed. by Yang Xiang, Alfredo Cuzzocrea, Michael Hobbs, Wanlei Zhou. Springer Berlin / Heidelberg, 2011. Vol. 7016 of Lecture Notes in Computer Science. P. 158–169. 10.1007/978- 3-642-24650-0 14. URL: http://dx.doi.org/10.1007/978-3-642-24650-0 _14
Joaquin Perez, Rodolfo Pazos, Juan Frausto et al. Vertical fragmentation and allocation in distributed databases with site capacity restrictions using the threshold accepting algorithm // MICAI 2000: Advances in Artificial Intelligence / Ed. by Osvaldo Cairo, L.Enrique Sucar, FranciscoJ. Cantu. Springer Berlin Heidelberg, 2000. Vol. 1793 of Lecture Notes in Computer Science. P. 75–81. URL: http://dx.doi.org/10.1007/10720076\_7
Rodolfo Pazos R., Graciela Vazquez A., Jose Martinez F., Joaquin Perez O. Vertical fragmentation design of distributed databases considering the nonlinear nature of roundtrip response time // Knowledge- Based and Intelligent Information and Engineering Systems / Ed. by Rossitza Setchi, Ivan Jordanov, Robert Howlett, Lakhmi Jain. Springer Berlin / Heidelberg, 2010. Vol. 6277 of Lecture Notes in Computer Science. P. 173–182. 10.1007/978-3-642-15390-7 18. URL: http://dx.doi.org/10. 1007/978-3-642-15390-7\_18
Shamkant Navathe, Stefano Ceri, Gio Wiederhold, Jinglie Dou Vertical partitioning algorithms for database design // ACM Trans. Database Syst. 1984. Vol. 9. P. 680–710. URL: http://doi.acm.org/10.1145/1994.2209
M. Zorrilla, E. Mora, P. Corcuera, J. Fernandez Vertical partitioning algorithms in distributed databases // Computer Aided Systems Theory - EUROCAST’99 / Ed. by Peter Kopacek, Roberto Moreno-D´ıaz, Franz Pichler. Springer Berlin / Heidelberg, 2000. Vol. 1798 of Lecture Notes in Computer Science. P. 465–474. 10.1007/10720123 40. URL: http: //dx.doi.org/10.1007/10720123\_40
Christoph Quix, Xiang Li, David Kensche, Sandra Geisler View management techniques and their application to data stream management // Evolving Application Domains of Data Warehousing and Mining: Trends and Solutions / Ed. by Pedro Nuno San-Banto Furtado. IGI Global, 2010. P. 83–112. URL: http://dbis.rwth-aachen.de/cms/staff/li/ view-selection-survey
Wada K. Replication // Encyclopedia of Database Systems / Ed. by Ling Liu, M.Tamer ¨ Ozsu. Springer US, 2009. P. 2391–2392. URL: http://dx.doi.org/10.1007/978-0-387-39940-9\_1336
Wah B. File placement on distributed computer systems // Computer. 1984. Vol. 17, no. 1. P. 23–32
Wah B. W., Lien Y.-N. Design of distributed databases on local computer systems with a multiaccess network // IEEE Trans. Softw. Eng. 1985. Vol. 11, no. 7. P. 606–619. URL: http://dx.doi.org/10.1109/TSE.1985. 232505
Anastassia Ailamaki, David J. De-Witt, Mark D. Hill, Marios Skounakis Weaving relations for cache performance // Proceedings of the 27th International Conference on Very Large Data Bases. VLDB ’01. San Francisco, CA, USA : Morgan Kaufmann Publishers Inc., 2001. P. 169–180. URL: http://dl.acm.org/citation.cfm?id=645927.672367
Wong E., Katz R. H. Distributing a database for parallelism // SIGMOD Rec. 1983. Vol. 13, no. 4. P. 23–29. URL: http://doi.acm.org/10.1145/ 971695.582201
Zhang Y., Orlowska M. E. On fragmentation approaches for distributed database design // Information Sciences - Applications. 1994. Vol. 1, no. 3. P. 117–132. URL: http://www.sciencedirect.com/science/ article/pii/1069011594900051
Zilio D. C. Physical database design decision algorithms and concurrent reorganization for parallel database systems : Ph. D. thesis / Daniel Costante Zilio. Toronto, Ont., Canada, Canada : University of Toronto, 1998. AAINQ35386
Partitioning key selection for a shared-nothing parallel database system : Rep. : IBM Research Report RC 19820 (87739) / IBM T.J. Watson Research Center ; Executor: Daniel C. Zilio, Anant Jhingran, Sriram Padmanabhan : 1994
Новосельский В.Б. Метод автоматизации проектирования распределенной реляционной базы данных // Программные продукты и системы. 2008. № 3. С. 45–48. URL: http://swsys.ru/index.php?page=article&id=1578
Цыбанков Е.И. Проектирование распределенной базы данных с использованием генетического алгоритма // Труды интернет-конференции «Актуальные проблемы аппаратно-программного и информационного обеспечения науки, образования, культуры и бизнеса». МГУПИ, 2010. URL: http://it4.mgupi.ru/files/internet/2010/Cybankov.pdf
Abadi D. J., Boncz P. A., Harizopoulos S. Column-oriented database systems // Proc. VLDB Endow. 2009. Vol. 2, no. 2. P. 1664–1665. URL: http://dl.acm.org/citation.cfm?id=1687553.1687625
Yu C.T. , Cheing-mei Suen, Lam K., Siu M.K. Adaptive record clustering / // ACM Trans. Database Syst. 1985. Vol. 10. P. 180–204. URL: http://doi.acm.org/10.1145/3857.3861
Agrawal S., Chu E., Narasayya V. Automatic physical design tuning: workload as a sequence // Proceedings of the 2006 ACM SIGMOD international conference on Management of data. SIGMOD ’06. New York, NY, USA : ACM, 2006. P. 683–694. URL: http://doi.acm.org/10.1145/ 1142473.1142549
Agrawal S., Narasayya V., Yang B. Integrating vertical and horizontal partitioning into automated physical database design // Proceedings of the 2004 ACM SIGMOD international conference on Management of data. SIGMOD ’04. New York, NY, USA : ACM, 2004. P. 359–370. URL: http://doi.acm.org/10.1145/1007568.1007609
APB-1 OLAP Benchmark, Release II. OLAP Council, Nov. 1998. www. olapcouncil.org/research/bmarkly.htm. Дата просмотра: 30/07/2012
Apers P. M. G. Data allocation in distributed database systems // ACM Trans. Database Syst. 1988. Vol. 13. P. 263–304. URL: http: //doi.acm.org/10.1145/44498.45063
Applying genetic algorithms in database partitioning / Vincent Ng, Dik Man Law, Narasimhaiah Gorla, Chi Kong Chan // Proceedings of the 2003 ACM symposium on Applied computing. SAC ’03. New York, NY, USA : ACM, 2003. P. 544–549. URL: http://doi.acm.org/10.1145/ 952532.952639
An automated, yet interactive and portable DB designer / Ioannis Alagiannis, Debabrata Dash, Karl Schnaitter et al. // Proceedings of the 2010 ACM SIGMOD International Conference on Management of data. SIGMOD ’10. New York, NY, USA : ACM, 2010. P. 1183–1186. URL: http://doi.acm.org/10.1145/1807167.1807314
An automated, yet interactive and portable DB designer / Ioannis Alagiannis, Debabrata Dash, Karl Schnaitter et al. // Proceedings of the 2010 ACM SIGMOD International Conference on Management of data. SIGMOD ’10. New York, NY, USA : ACM, 2010. P. 1183–1186. URL: http://doi.acm.org/10.1145/1807167.1807314
Automating physical database design in a parallel database / Jun Rao, Chun Zhang, Nimrod Megiddo, Guy Lohman // Proceedings of the 2002 ACM SIGMOD international conference on Management of data. SIGMOD ’02. New York, NY, USA : ACM, 2002. P. 558–569. URL: http://doi. acm.org/10.1145/564691.564757
Badia A., Lemire D. A call to arms: revisiting database design // SIGMOD Rec. 2011. Vol. 40, no. 3. P. 61–69. URL: http://doi.acm.org/10.1145/ 2070736.2070750
Badia A., Lemire D. A distribution design methodology for object DBMS // Distributed and Parallel Databases. 2004. Vol. 16. P. 45– 90. 10.1023/B:DAPD.0000026268.04288.b9. URL: http://dx.doi.org/10. 1023/B:DAPD.0000026268.04288.b9
Bell D. A. Difficult data placement problems // The Computer Journal. 1984. Vol. 27, no. 4. P. 315–320. http://comjnl.oxfordjournals.org/content/27/4/315.full.pdf+html
Bell D. A. Physical record clustering in databases // Kybernetes. 1984. Vol. 13. P. 31–37
Bellatreche L., Benkrid S. A joint design approach of partitioning and allocation in parallel data warehouses // Data Warehousing and Knowledge Discovery / Ed. by Torben Pedersen, Mukesh Mohania, A Tjoa. Springer Berlin / Heidelberg, 2009. Vol. 5691 of Lecture Notes in Computer Science. P. 99–110. 10.1007/978-3-642-03730-6 9. URL: http://dx.doi.org/ 10.1007/978-3-642-03730-6\_9
Bellatreche L., Boukhalfa K., Abdalla H. I. Saga: A combination of genetic and simulated annealing algorithms for physical data warehouse design // BNCOD. 2006. P. 212–219
Bellatreche L., Boukhalfa K., Richard P. Data partitioning in data warehouses: Hardness study, heuristics and ORACLE validation // Data Warehousing and Knowledge Discovery / Ed. by Il-Yeol Song, Johann Eder, Tho Nguyen. Springer Berlin / Heidelberg, 2008. Vol. 5182 of Lecture Notes in Computer Science. P. 87–96. 10.1007/978-3-540-85836-2 9. URL: http://dx.doi.org/10.1007/978-3-540-85836-2\_9
Bellatreche L., Cuzzocrea A., Benkrid S. F&A: a methodology for effectively and efficiently designing parallel relational data warehouses on heterogenous database clusters // Proceedings of the 12th international conference on Data warehousing and knowledge discovery. DaWaK’10. Berlin, Heidelberg : Springer-Verlag, 2010. P. 89–104. URL: http://dl.acm.org/citation. cfm?id=1881923.1881934
Bellatreche L., Karlapalem K., Simonet A. Algorithms and support for horizontal class partitioning in object-oriented databases // Distributed and Parallel Databases. 2000. Vol. 8. P. 155–179. 10.1023/A:1008745624048. URL: http://dx.doi.org/10.1023/A:1008745624048
Bellatreche L., Woameno K. Y. Dimension table driven approach to referential partition relational data warehouses // Proceedings of the ACM twelfth international workshop on Data warehousing and OLAP. DOLAP ’09. New York, NY, USA : ACM, 2009. P. 9–16. URL: http://doi.acm.org/10.1145/1651291.1651294
Bernardino J., Madeira H. Experimental evaluation of a new distributed partitioning technique for data warehouses // Proceedings of the International Database Engineering & Applications Symposium. IDEAS ’01. Washington, DC, USA : IEEE Computer Society, 2001. P. 312–321. URL: http://dl.acm.org/citation.cfm?id=646290.687056
Blankinship R., Hevner A. R., Yao S. B. An iterative method for distributed database design // Proceedings of the 17th International Conference on Very Large Data Bases. VLDB ’91. San Francisco, CA, USA : Morgan Kaufmann Publishers Inc., 1991. P. 389–400. URL: http://dl.acm.org/citation.cfm? id=645917.672331
Bouakkaz M., Ouinten Y., Ziani B. Vertical fragmentation of data warehouses using the FP-Max algorithm // Innovations in Information Technology (IIT), 2012 International Conference on. 2012. march. P. 273–276
Boukhalfa K., Bellatreche L., Alimazighi Z. HP&BJI: A combined selection of data partitioning and join // New Trends in Data Warehousing and Data Analysis / Ed. by Stanislaw Kozielski, Robert Wrembel. Springer US, 2009. Vol. 3 of Annals of Information Systems. P. 1–23. 10.1007/978-0-387-87431- 9 10. URL: http://dx.doi.org/10.1007/978-0-387-87431-9\_10
Bruno N. A critical look at the tab benchmark for physical design tools // SIGMOD Rec. 2007. Vol. 36, no. 4. P. 7–12. URL: http://doi.acm.org/ 10.1145/1361348.1361349
Bruno N., Chaudhuri S. Automatic physical database tuning: a relaxation-based approach // Proceedings of the 2005 ACM SIGMOD international conference on Management of data. SIGMOD ’05. New York, NY, USA : ACM, 2005. P. 227–238. URL: http://doi.acm.org/10.1145/ 1066157.1066184
Brunstrom A., Leutenegger S. T., Simha R. Experimental evaluation of dynamic data allocation strategies in a distributed database with changing workloads // Proceedings of the fourth international conference on Information and knowledge management. CIKM ’95. New York, NY, USA : ACM, 1995. P. 395–402. URL: http://doi.acm.org/10.1145/221270. 221652
Casey R. G. Allocation of copies of a file in an information network // Proceedings of the May 16-18, 1972, spring joint computer conference. AFIPS ’72 (Spring). New York, NY, USA : ACM, 1972. P. 617–625. URL: http://doi.acm.org/10.1145/1478873.1478955
Ceri S., Martella G., Pelagatti G. Optimal file allocation in a computer network: a solution method based on the knapsack problem // Computer Networks (1976). 1982. Vol. 6, no. 5. P. 345–357. URL: http://www.sciencedirect.com/science/article/pii/0376507582901040
Ceri S., Navathe S., Wiederhold G. Distribution design of logical database schemas // IEEE Transactions on Software Engineering. 1983. Vol. 9. P. 487–504
Ceri S., Negri M., Pelagatti G. Horizontal data partitioning in database design // Proceedings of the 1982 ACM SIGMOD international conference on Management of data. SIGMOD ’82. New York, NY, USA : ACM, 1982. P. 128–136. URL: http://doi.acm.org/10.1145/582353.582376
Ceri S., Pernici B., Wiederhold G. Distributed database design methodologies // Proceedings of the IEEE. 1987. Vol. 75, no. 5. P. 533–546
Chang S.-K., Liu A.-C. File allocation in a distributed database // International Journal of Parallel Programming. 1982. Vol. 11. P. 325–340. 10.1007/BF01001955. URL: http://dx.doi.org/10.1007/BF01001955
Chaturvedi A., Choubey A., Roan J. Scheduling the allocation of data fragments in a distributed database environment: a machine learning approach // Engineering Management, IEEE Transactions on. 1994. Vol. 41, no. 2. P. 194–207
Chaudhuri S., Narasayya V. Microsoft index turning wizard for SQL Server 7.0 // SIGMOD Rec. 1998. Vol. 27, no. 2. P. 553–554. URL: http: //doi.acm.org/10.1145/276305.276378
Chaudhuri S., Weikum G. Self-management technology in databases // Encyclopedia of Database Systems / Ed. by Ling Liu, M.Tamer ¨ Ozsu. Springer US, 2009. P. 2550–2555. URL: http://dx.doi.org/10.1007/ 978-0-387-39940-9\_334
Cheng C. Algorithms for vertical partitioning in database physical design // Omega. 1994. Vol. 22, no. 3. P. 291–303. URL: http: //www.sciencedirect.com/science/article/pii/0305048394900426
Cheng C.-H. A branch and bound clustering algorithm // Systems, Man and Cybernetics, IEEE Transactions on. 1995. Vol. 25, no. 5. P. 895–898
Cheng C.-H., Lee W.-K., Wong K.-F. A genetic algorithm-based clustering approach for database partitioning // Systems, Man, and Cybernetics, Part C: Applications and Reviews, IEEE Transactions on. 2002. Vol. 32, no. 3. P. 215–230
Cheng C.-H., Motwani J. An examination of cluster identification-based algorithms for vertical partitions // Int. J. Bus. Inf. Syst. 2009. Vol. 4, no. 6. P. 622–638. URL: http://dx.doi.org/10.1504/IJBIS.2009.026695
Chiu G.-M., Raghavendra C.Chiu G.-M., Raghavendra C. A model for optimal database allocation in distributed computing systems // INFOCOM ’90. Ninth Annual Joint Conference of the IEEE Computer and Communication Societies. ’The Multiple Facets of Integration’. Proceedings., IEEE. Vol. 3. 1990. jun. P. 827– 833
Chu W., Ieong I. A transaction-based approach to vertical partitioning for relational database systems // Software Engineering, IEEE Transactions on. 1993. Vol. 19, no. 8. P. 804–812
Chu W. W. Optimal file allocation in a multiple computer system // IEEE Trans. Comput. 1969. Vol. 18, no. 10. P. 885–889. URL: http: //dx.doi.org/10.1109/T-C.1969.222542
Clotho: decoupling memory page layout from storage organization / Minglong Shao, Jiri Schindler, Steven W. Schlosser et al. // Proceedings of the Thirtieth international conference on Very large data bases - Volume 30. VLDB ’04. VLDB Endowment, 2004. P. 696–707. URL: http://dl.acm.org/citation.cfm?id=1316689.1316750
Copeland G. P., Khoshafian S. N. Clotho: decoupling memory page layout from storage organization / Minglong Shao, Jiri Schindler, Steven W. Schlosser et al. // Proceedings of the Thirtieth international conference on Very large data bases - Volume 30. VLDB ’04. VLDB Endowment, 2004. P. 696–707. URL: http://dl.acm.org/citation.cfm?id=1316689.1316750
Corcoran A. L., Hale J. A genetic algorithm for fragment allocation in a distributed database system // Proceedings of the 1994 ACM symposium on Applied computing. SAC ’94. New York, NY, USA : ACM, 1994. P. 247–250. URL: http://doi.acm.org/10.1145/326619.326738
Cornell D., Yu P. An effective approach to vertical partitioning for physical design of relational databases // Software Engineering, IEEE Transactions on. 1990. Vol. 16, no. 2. P. 248–258
Cornell D. W., Yu P. S. An effective approach to vertical partitioning for physical design of relational databases // Software Engineering, IEEE Transactions on. 1990. Vol. 16, no. 2. P. 248–258
Cornell D. W., Yu P. S. On optimal site assignment for relations in the distributed database environment // IEEE Trans. Softw. Eng. 1989. Vol. 15, no. 8. P. 1004–1009. URL: http://dx.doi.org/10.1109/32.31356
Costa M., Madeira H. Handling big dimensions in distributed data warehouses using the DWS technique // Proceedings of the 7th ACM international workshop on Data warehousing and OLAP. DOLAP ’04. New York, NY, USA : ACM, 2004. P. 31–37. URL: http://doi.acm.org/10.1145/ 1031763.1031770
Data placement in Bubba / George Copeland, William Alexander, Ellen Boughter, Tom Keller // Proceedings of the 1988 ACM SIGMOD international conference on Management of data. SIGMOD ’88. New York, NY, USA : ACM, 1988. P. 99–108. URL: http://doi.acm.org/10.1145/ 50202.50213
Database tuning advisor for Microsoft SQL Server 2005 / Sanjay Agrawal, Surajit Chaudhuri, Lubor Kollar et al. // Proceedings of VLDB. 2004. P. 1110–1121
Database tuning advisor for Microsoft SQL server 2005: demo / Sanjay Agrawal, Surajit Chaudhuri, Lubor Kollar et al. // Proceedings of the 2005 ACM SIGMOD international conference on Management of data. SIGMOD ’05. New York, NY, USA : ACM, 2005. P. 930–932. URL: http://doi.acm.org/10.1145/1066157.1066292
Daudpota N. H. Five steps to construct a model of data allocation for distributed database systems // J. Intell. Inf. Syst. 1998. Vol. 11, no. 2. P. 153–168. URL: http://dx.doi.org/10.1023/A:1008676718656
DB2 advisor: an optimizer smart enough to recommend its own indexes / G. Valentin, M. Zuliani, D.C. Zilio et al. // Data Engineering, 2000. Proceedings. 16th International Conference on. 2000. P. 101–110
DB2 design advisor: integrated automatic physical database design / Daniel C. Zilio, Jun Rao, Sam Lightstone et al. // Proceedings of the Thirtieth international conference on Very large data bases - Volume 30. VLDB ’04. VLDB Endowment, 2004. P. 1087–1097. URL: http: //dl.acm.org/citation.cfm?id=1316689.1316783
De P., Park J. S., Pirkul H. An integrated model of record segmentation and access path selection for databases // Information Systems. 1988. Vol. 13, no. 1. P. 13–30. URL: http://www.sciencedirect.com/science/article/ pii/0306437988900245
Designing a distributed database on a local area network: a methodology and decision support system / H. Lee, Y.-K. Park, G. Jang, S.- Y. Huh // Information and Software Technology. 2000. Vol. 42, no. 3. P. 171–184. URL: http://www.sciencedirect.com/science/article/pii/ S0950584999000567
Didriksen T., Galindo-Legaria C. A., Dahle E. Database de-centralization — a practical approach // Proceedings of the 21th International Conference on Very Large Data Bases. VLDB ’95. San Francisco, CA, USA : Morgan Kaufmann Publishers Inc., 1995. P. 654–665. URL: http://dl.acm.org/ citation.cfm?id=645921.673313
Dowdy L. W., Foster D. V. Comparative models of the file assignment problem // ACM Comput. Surv. 1982. Vol. 14, no. 2. P. 287–313. URL: http://doi.acm.org/10.1145/356876.356883
Du J., Alhajj R., Barker K. Genetic algorithms based approach to database vertical partition // J. Intell. Inf. Syst. 2006. Vol. 26. P. 167–183. URL: http://dl.acm.org/citation.cfm?id=1139987.1139989
Du J., Barker K., Alhajj R. Attraction — a global affinity measure for database vertical partitioning // ICWI. IADIS, 2003. P. 538–548
Du X., Maryanski F. Data allocation in a dynamically reconfigurable environment // Data Engineering, 1988. Proceedings. Fourth International Conference on. 1988. feb. P. 74–81
An enhanced grouping algorithm for vertical partitioning problem in DDBs / F. Marir, Y. Najjar, M.Y. AlFaress, H.I. Abdalla // Computer and information sciences, 2007. iscis 2007. 22nd international symposium on. 2007. nov. P. 1–6
Eswaran K. P. Placement of records in a file and file allocation in a computer // IFIP Congress. 1974. P. 304–307
Evolutionary algorithms for allocating data in distributed database systems / Ishfaq Ahmad, Kamalakar Karlapalem, Yu-Kwong Kwok, Siu-Kai So // Distrib. Parallel Databases. 2002. Vol. 11. P. 5–32. URL: http://dl.acm.org/citation.cfm?id=509176.509177
Finkelstein S., Schkolnick M., Tiberio P. Physical database design for relational databases // ACM Trans. Database Syst. 1988. Vol. 13. P. 91–128. URL: http://doi.acm.org/10.1145/42201.42205
A formal approach to the vertical partitioning problem in distributed database design / J. Muthuraj, S. Chakravarthy, R. Varadarajan, S. B. Navathe // Proceedings of the second international conference on Parallel and distributed information systems. PDIS ’93. Los Alamitos, CA, USA : IEEE Computer Society Press, 1993. P. 26–35. URL: http: //dl.acm.org/citation.cfm?id=382019.382410
French C. D. One size fits all” database architectures do not work for DSS // SIGMOD Rec. 1995. Vol. 24. P. 449–450. URL: http://doi.acm.org/ 10.1145/568271.223871
Frieder O., Siegelmann H. Multiprocessor document allocation: a genetic algorithm approach // Knowledge and Data Engineering, IEEE Transactions on. 1997. Vol. 9, no. 4. P. 640–642
Furtado P. Experimental evidence on partitioning in parallel data warehouses // Proceedings of the 7th ACM international workshop on Data warehousing and OLAP. DOLAP ’04. New York, NY, USA : ACM, 2004. P. 23–30. URL: http://doi.acm.org/10.1145/1031763.1031769
Gavish B., Pirkul H. Computer and database location in distributed computer systems // IEEE Transactions on Computers. 1986. Vol. 35. P. 583–590
Gebaly K. E., Aboulnaga A. Robustness in automatic physical database design // Proceedings of the 11th international conference on Extending database technology: Advances in database technology. EDBT ’08. New York, NY, USA : ACM, 2008. P. 145–156. URL: http://doi.acm.org/10. 1145/1353343.1353365
Ghandeharizadeh S., DeWitt D. J. Hybrid-range partitioning strategy: A new declustering strategy for multiprocessor database machines // Proceedings of the 16th International Conference on Very Large Data Bases. VLDB ’90. San Francisco, CA, USA : Morgan Kaufmann Publishers Inc., 1990. P. 481–492. URL: http://dl.acm.org/citation.cfm?id=645916.671988
Ghandeharizadeh S., DeWitt D. J. Magic: A multiattribute declustering mechanism for multiprocessor database machines // IEEE Trans. Parallel Distrib. Syst. 1994. Vol. 5, no. 5. P. 509–524. URL: http://dx.doi.org/ 10.1109/71.282561
Ghandeharizadeh S., DeWitt D. J., Qureshi W. A performance analysis of alternative multi-attribute declustering strategies // SIGMOD Rec. 1992. Vol. 21, no. 2. P. 29–38. URL: http://doi.acm.org/10.1145/141484. 130293
Goals and benchmarks for autonomic configuration recommenders / Mariano P. Consens, Denilson Barbosa, Adrian Teisanu, Laurent Mignet // Proceedings of the 2005 ACM SIGMOD international conference on Management of data. SIGMOD ’05. New York, NY, USA : ACM, 2005. P. 239–250. URL: http://doi.acm.org/10.1145/1066157.1066185
Golfarelli M., Maio D., Rizzi S. Vertical fragmentation of views in relational data warehouses // Proc. Settimo Convegno Nazionale Sistemi Evoluti per Basi di Dati (SEBD 1999). 1999. P. 19–33
Gorla N., Yan B. P. W. Vertical fragmentation in databases using datamining technique // Database Technologies: Concepts, Methodologies, Tools, and Applications / Ed. by John Erickson. IGI Global, 2009. P. 2543– 2563
Guinepain S., Gruenwald L. Research issues in automatic database clustering // SIGMOD Rec. 2005. Vol. 34. P. 33–38. URL: http: //doi.acm.org/10.1145/1058150.1058157
Guinepain S., Gruenwald L. Automatic database clustering using data mining // Proceedings of the 17th International Conference on Database and Expert Systems Applications. DEXA ’06. Washington, DC, USA : IEEE Computer Society, 2006. P. 124–128. URL: http://dx.doi.org/10. 1109/DEXA.2006.32
Hababeh I. O., Ramachandran M., Bowring N. A high-performance computing method for data allocation in distributed database systems // J. Supercomput. 2007. Vol. 39, no. 1. P. 3–18. URL: http://dx.doi.org/ 10.1007/s11227-006-0001-8
Hammer M., Niamir B. A heuristic approach to attribute partitioning // Proceedings of the 1979 ACM SIGMOD international conference on Management of data. SIGMOD ’79. New York, NY, USA : ACM, 1979. P. 93–101. URL: http://doi.acm.org/10.1145/582095.582110
Hankins R. A., Patel J. M. Data morphing: an adaptive, cache-conscious storage technique // Proceedings of the 29th international conference on Very large data bases - Volume 29. VLDB ’2003. VLDB Endowment, 2003. P. 417–428. URL: http://dl.acm.org/citation.cfm?id=1315451.1315488
Hauglid J. O., Ryeng N. H., Nørv˚ag K. Dyfram: dynamic fragmentation and replica management in distributed database systems // Distrib. Parallel Databases. 2010. Vol. 28. P. 157–185. URL: http://dx.doi.org/10. 1007/s10619-010-7068-1
Hellerstein J. M., Stonebraker M., Hamilton J. Architecture of a database system // Found. Trends databases. 2007. Vol. 1, no. 2. P. 141–259. URL: http://dx.doi.org/10.1561/1900000002
High Performance Parallel Database Processing and Grid Databases / David Taniar, Clement H. C. Leung, Wenny Rahayu, Sushant Goel. Wiley Publishing, 2008. ISBN: 0470107626, 9780470107621
Hoffer J. A. An integer programming formulation of computer database design problems // Inf. Sci. 1976. Vol. 11. P. 29–48
Hoffer J. A., Severance D. G. The use of cluster analysis in physical data base design // Proceedings of the 1st International Conference on Very Large Data Bases. VLDB ’75. New York, NY, USA : ACM, 1975. P. 69–86. URL: http://doi.acm.org/10.1145/1282480.1282486
Hua K. A., Lee C. An adaptive data placement scheme for parallel database computer systems // Proceedings of the 16th International Conference on Very Large Data Bases. VLDB ’90. San Francisco, CA, USA : Morgan Kaufmann Publishers Inc., 1990. P. 493–506. URL: http://dl.acm.org/ citation.cfm?id=645916.671965
Huang Y.-F., Chen J.-H. Fragment allocation in distributed database design // Journal of Information Science and Engineering. 2001. Vol. 17. P. 491–506
Huang Y.-F., Van C.-H. Vertical partitioning in database design // Information Sciences. 1995. Vol. 86, no. 1-3. P. 19–35. URL: http://www.sciencedirect.com/science/article/pii/002002559500018K
HYRISE: a main memory hybrid storage engine / Martin Grund, Jens Kr¨uger, Hasso Plattner et al. // Proc. VLDB Endow. 2010. Vol. 4, no. 2. P. 105–116. URL: http://dl.acm.org/citation.cfm?id=1921071. 1921077
Idreos S., Kersten M. L., Manegold S. Database cracking // CIDR. www.cidrdb.org, 2007. P. 68–78
Jakobsson M. Reducing block accesses in inverted files by partial clustering // Information Systems. 1980. Vol. 5, no. 1. P. 1–5. URL: http://www. sciencedirect.com/science/article/pii/0306437980900630
Kamali S., Ghodsnia P., Daudjee K. Dynamic data allocation with replication in distributed systems // Performance Computing and Communications Conference (IPCCC), 2011 IEEE 30th International. 2011. nov. P. 1–8
Karimi Adl R., Rouhani Rankoohi S. A new ant colony optimization based algorithm for data allocation problem in distributed databases // Knowledge and Information Systems. 2009. Vol. 20. P. 349–373. 10.1007/s10115-008- 0182-y. URL: http://dx.doi.org/10.1007/s10115-008-0182-y
Karlapalem K., Pun N. M. Query-driven data allocation algorithms for distributed database systems // Proceedings of the 8th International Conference on Database and Expert Systems Applications. DEXA ’97. London, UK, UK : Springer-Verlag, 1997. P. 347–356. URL: http://dl.acm.org/ citation.cfm?id=648310.754564
Stepwise redesign of distributed relational databases : Rep. : HKUST-CS97- 12 / Department of Computer Science, The Hong-Kong University of Science & Technology ; Executor: Ladan Kazerouni, Kamalakar Karlapalem : September 1997
Kemme B., Alonso G. A new approach to developing and implementing eager database replication protocols // ACM Trans. Database Syst. 2000. Vol. 25, no. 3. P. 333–379. URL: http://doi.acm.org/10.1145/363951. 363955
Khalil N., Eid D., Khair M. Availability and reliability issues in distributed databases using optimal horizontal fragmentation // Database and Expert Systems Applications / Ed. by Trevor Bench-Capon, Giovanni Soda, A Tjoa. Springer Berlin / Heidelberg, 1999. Vol. 1677 of Lecture Notes in Computer Science. P. 771–780. 10.1007/3-540-48309-8 72. URL: http://dx.doi.org/ 10.1007/3-540-48309-8\_72
Khan S., Hoque A. A new technique for database fragmentation in distributed systems // International Journal of Computer Applications. 2010. Vol. 5(9). P. 20–24
Lightstone S. S., Bhattacharjee B. Automated design of multidimensional clustering tables for relational databases // Proceedings of the Thirtieth international conference on Very large data bases - Volume 30. VLDB ’04. VLDB Endowment, 2004. P. 1170–1181. URL: http://dl.acm. org/citation.cfm?id=1316689.1316789
Lima A., Mattoso M., Valduriez P. OLAP query processing in a database cluster // Euro-Par 2004 Parallel Processing / Ed. by Marco Danelutto, Marco Vanneschi, Domenico Laforenza. Springer Berlin / Heidelberg, 2004. Vol. 3149 of Lecture Notes in Computer Science. P. 355–362. 10.1007/978- 3-540-27866-5 46. URL: http://dx.doi.org/10.1007/978-3-540-27866-5 _46.
Lin X., Orlowska M., Zhang Y. A graph based cluster approach for vertical partitioning in database design // Data & Knowledge Engineering. 1993. Vol. 11, no. 2. P. 151–169. URL: http://www.sciencedirect.com/science/ article/pii/0169023X93900038
Lin X., Orlowska M. E., Zhang Y. On data allocation with the minimum overall communication costs in distributed database design // Proceedings of the Fifth International Conference on Computing and Information. ICCI ’93. Washington, DC, USA : IEEE Computer Society, 1993. P. 539–544. URL: http://dl.acm.org/citation.cfm?id=645468.654762
Ma H. Distribution Design for Complex Value Databases : Ph. D. thesis /
Ma H., Schewe K.-D., Kirchberg M. A heuristic approach to fragmentation incorporating query information // Proceedings of the 2007 conference on Databases and Information Systems IV: Selected Papers from the Seventh International Baltic Conference DB&IS’2006. Amsterdam, The Netherlands, The Netherlands : IOS Press, 2007. P. 103–116. URL: http://dl.acm.org/ citation.cfm?id=1565421.1565432
Mahmoud S., Riordon J. S. Optimal allocation of resources in distributed information networks // ACM Trans. Database Syst. 1976. Vol. 1, no. 1. P. 66–78. URL: http://doi.acm.org/10.1145/320434.320449
Mami I., Bellahsene Z. A survey of view selection methods // SIGMOD Rec. 2012. Vol. 41, no. 1. P. 20–29. URL: http://doi.acm.org/10.1145/ 2206869.2206874
March S. T., Rho S. Allocating data and operations to nodes in distributed database design // IEEE Trans. on Knowl. and Data Eng. 1995. Vol. 7, no. 2. P. 305–317. URL: http://dx.doi.org/10.1109/69.382299
McIver Jr. W. J., King R. Self-adaptive, on-line reclustering of complex object data // SIGMOD Rec. 1994. Vol. 23, no. 2. P. 407–418. URL: http://doi.acm.org/10.1145/191843.191924
Mehta M., DeWitt D. J. Data placement in shared-nothing parallel database systems // The VLDB Journal. 1997. Vol. 6. P. 53–72. URL: http: //dx.doi.org/10.1007/s007780050033
Menon S. Allocating fragments in distributed databases // IEEE Trans. Parallel Distrib. Syst. 2005. Vol. 16, no. 7. P. 577–585. URL: http: //dx.doi.org/10.1109/TPDS.2005.77
Moghrabi I., Makholian R. A new approach to clustering records in information retrieval systems // Information Retrieval. 2000. Vol. 3. P. 105– 126. 10.1023/A:1009901830009. URL: http://dx.doi.org/10.1023/A: 1009901830009
Morgan H. L., Levin K. D. Optimal program and data locations in computer networks // Commun. ACM. 1977. Vol. 20, no. 5. P. 315–322. URL: http://doi.acm.org/10.1145/359581.359591
Motzkin D. An optimal data allocation model for distributed databases // Mathematical and Computer Modelling. 1988. Vol. 11, no. 0. P. 920–925. URL: http://www.sciencedirect.com/science/article/pii/ 0895717788906280
Mukkamala R., Bruell S. C., Shultz R. K. Design of partially replicated
Navathe S. B., Karlapalem K., Ra M. A mixed fragmentation methodology for initial distributed database design // Journal of Computer and Software Engineering. 1995. Vol. 3
Navathe S. B., Ra M. Vertical partitioning for database design: a graphical algorithm // Proceedings of the 1989 ACM SIGMOD international conference on Management of data. SIGMOD ’89. New York, NY, USA : ACM, 1989. P. 440–450. URL: http://doi.acm.org/10.1145/67544.66966
Nehme R., Bruno N. Automated partitioning design in parallel database systems // Proceedings of the 2011 international conference on Management of data. SIGMOD ’11. New York, NY, USA : ACM, 2011. P. 1137–1148. URL: http://doi.acm.org/10.1145/1989323.1989444
Noaman A. Y., Barker K. A horizontal fragmentation algorithm for the fact relation in a distributed data warehouse // Proceedings of the eighth international conference on Information and knowledge management. CIKM ’99. New York, NY, USA : ACM, 1999. P. 154–161. URL: http://doi. acm.org/10.1145/319950.319972
An objective function for vertically partitioning relations in distributed databases and its analysis / Sharma Chakravarthy, Jaykumar Muthuraj, Ravi Varadarajan, Shamkant B. Navathe // Distributed and Parallel Databases. 1994. Vol. 2. P. 183–207. 10.1007/BF01267326. URL: http://dx.doi.org/10.1007/BF01267326
Omiecinski E., Scheuermann P. A parallel algorithm for record clustering // ACM Trans. Database Syst. 1990. Vol. 15. P. 599–624. URL: http://doi.acm.org/10.1145/99935.99947
Ozsu M. T., Valduriez P. Principles of distributed database systems (2nd ed.). Upper Saddle River, NJ, USA : Prentice-Hall, Inc., 1999. ISBN: 0-13- 659707-6
O’Neil P.E. , O’Neil E. J., X. Chen The Star Schema Benchmark (SSB). http://www.cs.umb.edu/~poneil/StarSchemaB.PDF. Дата просмотра: 30/07/2012
Pai-Cheng C. A transaction-oriented approach to attribute partitioning // Information Systems. 1992. Vol. 17, no. 4. P. 329–342. URL: http: //www.sciencedirect.com/science/article/pii/030643799290022F
Papadomanolakis S., Ailamaki A. AutoPart: automating schema design for large scientific databases using data partitioning // Scientific and Statistical Database Management, 2004. Proceedings. 16th International Conference on. 2004. june. P. 383–392
Papadomanolakis S., Ailamaki A. An integer linear programming approach to database design // Proceedings of the 2007 IEEE 23rd International Conference on Data Engineering Workshop. ICDEW ’07. Washington, DC, USA : IEEE Computer Society, 2007. P. 442–449. URL: http://dx.doi.org/10.1109/ICDEW.2007.4401027
Papadomanolakis S., Dash D., Ailamaki A. Efficient use of the query optimizer for automated physical design // Proceedings of the 33rd international conference on Very large data bases. VLDB ’07. VLDB Endowment, 2007. P. 1093–1104. URL: http://dl.acm.org/citation.cfm?id=1325851. 1325974
Parallel OLAP query processing in database clusters with data replication / Alexandre Lima, A., Camille Furtado, Patrick Valduriez, Marta Mattoso // Distributed and Parallel Databases. 2009. Vol. 25, no. 1-2. P. 97–123. URL: http://hal.inria.fr/inria-00482183
PARINDA: an interactive physical designer for PostgreSQL / Cristina Maier, Debabrata Dash, Ioannis Alagiannis et al. // Proceedings of the 13th International Conference on Extending Database Technology. EDBT ’10. New York, NY, USA : ACM, 2010. P. 701–704. URL: http://doi.acm.org/10.1145/1739041.1739131
Park S.-J., Baik D.-K. A data allocation considering data availability in distributed database systems // Proceedings of the 1997 International Conference on Parallel and Distributed Systems. ICPADS ’97. Washington, DC, USA : IEEE Computer Society, 1997. P. 708–713. URL: http://dl.acm.org/citation.cfm?id=646861.707304.
Physical and virtual partitioning in OLAP database clusters / Camille Furtado, Alexandre A. B. Lima, Esther Pacitti et al. // Proceedings of the 17th International Symposium on Computer Architecture on High Performance Computing. SBAC-PAD ’05. Washington, DC, USA : IEEE Computer Society, 2005. P. 143–150. URL: http://dx.doi.org/10.1109/ CAHPC.2005.32
A query processing strategy for the decomposed storage model / Setrag Khoshafian, George P. Copeland, Thomas Jagodis et al. // Proceedings of the Third International Conference on Data Engineering. Washington, DC, USA : IEEE Computer Society, 1987. P. 636–643. URL: http://dl.acm.org/citation.cfm?id=645472.655555
Rahm E., Marek R. Analysis of dynamic load balancing strategies for parallel shared nothing database systems // Proceedings of the 19th International Conference on Very Large Data Bases. VLDB ’93. San Francisco, CA, USA : Morgan Kaufmann Publishers Inc., 1993. P. 182–193. URL: http: //portal.acm.org/citation.cfm?id=645919.672662
Ram S., Marsten R. A model for database allocation incorporating a concurrency control mechanism // Knowledge and Data Engineering, IEEE Transactions on. 1991. Vol. 3, no. 3. P. 389–395
Ram S., Narasimhan S. Database allocation in a distributed environment: incorporating a concurrency control mechanism and queuing costs // Manage. Sci. 1994. Vol. 40, no. 8. P. 969–983. URL: http://dx.doi.org/10. 1287/mnsc.40.8.969
Ramamurthy R., DeWitt D. J., Su Q. A case for fractured mirrors // Proceedings of the 28th international conference on Very Large Data Bases. VLDB ’02. VLDB Endowment, 2002. P. 430–441. URL: http: //dl.acm.org/citation.cfm?id=1287369.1287407
Recommending materialized views and indexes with the IBM DB2 design advisor / D.C. Zilio, C. Zuzarte, S. Lightstone et al. // Autonomic Computing, 2004. Proceedings. International Conference on. 2004. may. P. 180–187
Rivera-Vega P., Varadarajan R., Navathe S. Scheduling data redistribution in distributed databases // Data Engineering, 1990. Proceedings. Sixth International Conference on. 1990. feb. P. 166–173
Rodriguez L., Li X. A support-based vertical partitioning method for database design // Electrical Engineering Computing Science and Automatic Control (CCE), 2011 8th International Conference on. 2011. oct. P. 1–6
Rodriguez L., Li X. A vertical partitioning algorithm for distributed multimedia databases // Proceedings of the 22nd international conference on Database and expert systems applications - Volume Part II. DEXA’11. Berlin, Heidelberg : Springer-Verlag, 2011. P. 544–558. URL: http: //dl.acm.org/citation.cfm?id=2033546.2033607
Rohm U., Bohm K., Schek H.-J. OLAP query routing and physical design in a database cluster // Proceedings of the 7th International Conference on Extending Database Technology: Advances in Database Technology. EDBT ’00. London, UK, UK : Springer-Verlag, 2000. P. 254–268. URL: http: //dl.acm.org/citation.cfm?id=645339.650130
Sacca D., Wiederhold G. Database partitioning in a cluster of processors // ACM Trans. Database Syst. 1985. Vol. 10. P. 29–56. URL: http: //doi.acm.org/10.1145/3148.3161
Sarathy R., Shetty B., Sen A. A constrained nonlinear 0-1 program for data allocation // European Journal of Operational Research. 1997. Vol. 102, no. 3. P. 626–647. URL: http://www.sciencedirect.com/science/ article/pii/S0377221796002342
Savonnet M., Terrasse M., Y´etongnon K. Fragtique: A methodology for distributing object oriented databases // International Conference on Computing and Information. 1998
Shin D.-G., Irani K. B. Fragmenting relations horizontally using a knowledgebased approach // IEEE Trans. Softw. Eng. 1991. Vol. 17. P. 872–883. URL: http://dl.acm.org/citation.cfm?id=126262.126266
Singh A., Kahlon K. Non-replicated dynamic data allocation in distributed database systems // IJCSNS International Journal of Computer Science and Network Security. 2009. Vol. 9, no. 9. P. 176–180. URL: http://paper. ijcsns.org/07\_book/200909/20090922.pdf
Son J. H., Kim M.-H. α-partitioning algorithm: Vertical partitioning based on the fuzzy graph // Proceedings of the 12th International Conference on Database and Expert Systems Applications. DEXA ’01. London, UK, UK : Springer-Verlag, 2001. P. 537–546. URL: http://dl.acm.org/citation. cfm?id=648314.755837
Son J. H., Kim M.-H. An adaptable vertical partitioning method in distributed systems // Journal of Systems and Software. 2004. Vol. 73, no. 3. P. 551–561
Song S.-K., Gorla N. A genetic algorithm for vertical fragmentation and access path selection // The Computer Journal. 2000. Vol. 43, no. 1. P. 81– 93. http://comjnl.oxfordjournals.org/content/43/1/81.full.pdf+html
Stohr T., Martens H., Rahm E. Multi-dimensional database allocation for parallel data warehouses // Proceedings of the 26th International Conference on Very Large Data Bases. VLDB ’00. San Francisco, CA, USA : Morgan Kaufmann Publishers Inc., 2000. P. 273–284. URL: http://dl.acm.org/ citation.cfm?id=645926.671843
Stohr T., Rahm E. WARLOCK: A data allocation tool for parallel warehouses // Proceedings of the 27th International Conference on Very Large Data Bases. VLDB ’01. San Francisco, CA, USA : Morgan Kaufmann Publishers Inc., 2001. P. 721–722. URL: http://dl.acm.org/citation.cfm?id=645927.672208.
Sun J., Grosky W. I. Dynamic maintenance of multidimensional range data partitioning for parallel data processing // Proceedings of the 1st ACM international workshop on Data warehousing and OLAP. DOLAP ’98. New York, NY, USA : ACM, 1998. P. 72–79. URL: http://doi.acm.org/ 10.1145/294260.294275
Supporting table partitioning by reference in oracle / George Eadon, Eugene Inseok Chong, Shrikanth Shankar et al. // Proceedings of the 2008 ACM SIGMOD international conference on Management of data. SIGMOD ’08. New York, NY, USA : ACM, 2008. P. 1111–1122. URL: http: //doi.acm.org/10.1145/1376616.1376727
Suri R. A decentralized approach to optimal file allocation in computer networks // Decision and Control including the Symposium on Adaptive Processes, 1979 18th IEEE Conference on. Vol. 18. 1979. dec. P. 141–146
Tamhankar A. M., Ram S. Database fragmentation and allocation: an integrated methodology and case study // Trans. Sys. Man Cyber. Part A. 1998. Vol. 28, no. 3. P. 288–305. URL: http://dx.doi.org/10.1109/3468. 668961
Teorey T. J. Distributed database design: a practical approach and example // SIGMOD Rec. 1989. Vol. 18, no. 4. P. 23–39. URL: http://doi.acm.org/10.1145/74120.74124
Thiem A., Sattler K.-U. An integrated approach to performance monitoring for autonomous tuning // Proceedings of the 2009 IEEE International Conference on Data Engineering. ICDE ’09. Washington, DC, USA : IEEE Computer Society, 2009. P. 1671–1678. URL: http://dx.doi.org/10.1109/ICDE.2009.142
TPC Benchmark C. On-line transaction processing benchmark. http:// www.tpc.org/tpcc. Дата просмотра: 30/07/2012
TPC Benchmark H. Decision Support. http://www.tpc.org/tpch. Дата просмотра: 30/07/2012
Tsangaris M. M., Naughton J. F. On the performance of object clustering techniques // SIGMOD Rec. 1992. Vol. 21, no. 2. P. 144–153. URL: http://doi.acm.org/10.1145/141484.130308
Tsatalos O. G., Solomon M. H., Ioannidis Y. E. The GMAP: a versatile tool for physical data independence // The VLDB Journal. 1996. Vol. 5. P. 101–118. URL: http://dx.doi.org/10.1007/s007780050018
Ulus T., Uysal M. Heuristic approach to dynamic data allocation in distributed database systems // Pakistan Journal of Information and Technology. 2003. Vol. 2. P. 231–239
Ladjel Bellatreche, Soumia Benkrid, Ahmad Ghazal et al. Verification of partitioning and allocation techniques on teradata DBMS // Algorithms and Architectures for Parallel Processing / Ed. by Yang Xiang, Alfredo Cuzzocrea, Michael Hobbs, Wanlei Zhou. Springer Berlin / Heidelberg, 2011. Vol. 7016 of Lecture Notes in Computer Science. P. 158–169. 10.1007/978- 3-642-24650-0 14. URL: http://dx.doi.org/10.1007/978-3-642-24650-0 _14
Joaquin Perez, Rodolfo Pazos, Juan Frausto et al. Vertical fragmentation and allocation in distributed databases with site capacity restrictions using the threshold accepting algorithm // MICAI 2000: Advances in Artificial Intelligence / Ed. by Osvaldo Cairo, L.Enrique Sucar, FranciscoJ. Cantu. Springer Berlin Heidelberg, 2000. Vol. 1793 of Lecture Notes in Computer Science. P. 75–81. URL: http://dx.doi.org/10.1007/10720076\_7
Rodolfo Pazos R., Graciela Vazquez A., Jose Martinez F., Joaquin Perez O. Vertical fragmentation design of distributed databases considering the nonlinear nature of roundtrip response time // Knowledge- Based and Intelligent Information and Engineering Systems / Ed. by Rossitza Setchi, Ivan Jordanov, Robert Howlett, Lakhmi Jain. Springer Berlin / Heidelberg, 2010. Vol. 6277 of Lecture Notes in Computer Science. P. 173–182. 10.1007/978-3-642-15390-7 18. URL: http://dx.doi.org/10. 1007/978-3-642-15390-7\_18
Shamkant Navathe, Stefano Ceri, Gio Wiederhold, Jinglie Dou Vertical partitioning algorithms for database design // ACM Trans. Database Syst. 1984. Vol. 9. P. 680–710. URL: http://doi.acm.org/10.1145/1994.2209
M. Zorrilla, E. Mora, P. Corcuera, J. Fernandez Vertical partitioning algorithms in distributed databases // Computer Aided Systems Theory - EUROCAST’99 / Ed. by Peter Kopacek, Roberto Moreno-D´ıaz, Franz Pichler. Springer Berlin / Heidelberg, 2000. Vol. 1798 of Lecture Notes in Computer Science. P. 465–474. 10.1007/10720123 40. URL: http: //dx.doi.org/10.1007/10720123\_40
Christoph Quix, Xiang Li, David Kensche, Sandra Geisler View management techniques and their application to data stream management // Evolving Application Domains of Data Warehousing and Mining: Trends and Solutions / Ed. by Pedro Nuno San-Banto Furtado. IGI Global, 2010. P. 83–112. URL: http://dbis.rwth-aachen.de/cms/staff/li/ view-selection-survey
Wada K. Replication // Encyclopedia of Database Systems / Ed. by Ling Liu, M.Tamer ¨ Ozsu. Springer US, 2009. P. 2391–2392. URL: http://dx.doi.org/10.1007/978-0-387-39940-9\_1336
Wah B. File placement on distributed computer systems // Computer. 1984. Vol. 17, no. 1. P. 23–32
Wah B. W., Lien Y.-N. Design of distributed databases on local computer systems with a multiaccess network // IEEE Trans. Softw. Eng. 1985. Vol. 11, no. 7. P. 606–619. URL: http://dx.doi.org/10.1109/TSE.1985. 232505
Anastassia Ailamaki, David J. De-Witt, Mark D. Hill, Marios Skounakis Weaving relations for cache performance // Proceedings of the 27th International Conference on Very Large Data Bases. VLDB ’01. San Francisco, CA, USA : Morgan Kaufmann Publishers Inc., 2001. P. 169–180. URL: http://dl.acm.org/citation.cfm?id=645927.672367
Wong E., Katz R. H. Distributing a database for parallelism // SIGMOD Rec. 1983. Vol. 13, no. 4. P. 23–29. URL: http://doi.acm.org/10.1145/ 971695.582201
Zhang Y., Orlowska M. E. On fragmentation approaches for distributed database design // Information Sciences - Applications. 1994. Vol. 1, no. 3. P. 117–132. URL: http://www.sciencedirect.com/science/ article/pii/1069011594900051
Zilio D. C. Physical database design decision algorithms and concurrent reorganization for parallel database systems : Ph. D. thesis / Daniel Costante Zilio. Toronto, Ont., Canada, Canada : University of Toronto, 1998. AAINQ35386
Partitioning key selection for a shared-nothing parallel database system : Rep. : IBM Research Report RC 19820 (87739) / IBM T.J. Watson Research Center ; Executor: Daniel C. Zilio, Anant Jhingran, Sriram Padmanabhan : 1994
Опубликован
2013-02-01
Как цитировать
Чернышев, Г. А. (2013). Обзор подходов к организации физического уровня в СУБД. Труды СПИИРАН, 1(24), 222-276. https://doi.org/10.15622/sp.24.15
Раздел
Статьи
Авторы, которые публикуются в данном журнале, соглашаются со следующими условиями:
Авторы сохраняют за собой авторские права на работу и передают журналу право первой публикации вместе с работой, одновременно лицензируя ее на условиях Creative Commons Attribution License, которая позволяет другим распространять данную работу с обязательным указанием авторства данной работы и ссылкой на оригинальную публикацию в этом журнале.
Авторы сохраняют право заключать отдельные, дополнительные контрактные соглашения на неэксклюзивное распространение версии работы, опубликованной этим журналом (например, разместить ее в университетском хранилище или опубликовать ее в книге), со ссылкой на оригинальную публикацию в этом журнале.
Авторам разрешается размещать их работу в сети Интернет (например, в университетском хранилище или на их персональном веб-сайте) до и во время процесса рассмотрения ее данным журналом, так как это может привести к продуктивному обсуждению, а также к большему количеству ссылок на данную опубликованную работу (Смотри The Effect of Open Access).
