Algorithms for the database layout problem

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

Volumn 3363 LNCS, Issue , 2005, Pages 189-203

  Aggarwal, Gagan ^a   Feder, Tomás ^a,b   Motwani, Rajeev ^a   Panigrahy, Rina ^a   Zhu, An ^a  

^a Stanford University   (United States)

^b NONE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION RATIOS; DATA OBJECTS; DATABASE OBJECTS; DIRECT IMPACT; DISK DRIVE; ENTIRE SYSTEM; FORMAL ANALYSIS; I/O PERFORMANCE; LAYOUT PROBLEMS; OPTIMIZATION PROBLEMS; PERFORMANCE GUARANTEES; RANDOM DISK ACCESS;

DATABASE SYSTEMS; DISKS (STRUCTURAL COMPONENTS); DRIVES; OPTIMIZATION;

APPROXIMATION ALGORITHMS;

EID: 77049121512     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30570-5_13     Document Type: Conference Paper

References (11)

1. S. Agrawal, S. Chaudhuri, A. Das, and V. Narasayya. Automating Layout of Relational Databases. In Proceedings of 19th International Conference on Data Engineering, 2003, pp. 607-618.
2. The AutoAdmin Project. research.microsoft.com/dmx/AutoAdmin.
3. G. Copeland, W. Alexander, E. Boughter, and T. Keller. Data Placement in Bubba. In Proceedings of SIGMOD Conference, 1988, pp. 99-108.
4. H. Dewan, M. Hernandez, K. Mok, and S. Stolfo. Predictive Dynamic Load Balancing of Parallel Hash-Joins Over Heterogeneous Processors in the Presence of Data Skew. In Proceedings of PDIS, 1994, pp. 40-49.
5. N. Garg,V.V. Vazirani, and M. Yannakakis. Multiway cuts in directed and node weighted graphs. In Proceedings of 21st International Colloquium on Automata, Languages and Programming, 1994, pp. 487-498.
6. V. Kann, S. Khanna, J. Lagergren, and A. Panconesi. On the Hardness of Approximating Max k-Cut and its dual. Chicago Journal of Theoretical Computer Science, 1997.
7. M. Lee, M. Kitsuregawa, B. Ooi, K. Tan, and A. Mondal. Towards Self-Tuning Data Placement in Parallel Database Systems. In Proceedings of SIGMOD Conference, 2000, pp. 225-236.
8. L. Lee, P. Scheuermann, and R. Vingralek. File Assignment in Parallel I/O Systems with Minimum Variance and Service Time. IEEE Transactions on Computers, 1998.
9. E. Petrank. The Hardness Of Approximation: Gap Location. In Israel Symposium on Theory of Computing Systems, 1993, pp. 275-284.
10. P. Scheuermann, G. Weikum, and P. Zabback. Data Partitioning and Load Balancing in Parallel Disk Systems. The VLDB Journal, 7(1998): 48-66.
11. R. Vingralek, Y. Breitbart, and G. Weikum. SNOWBALL: Scalable Storage on Networks ofWorkstations with Balanced Load. Distributed and Parallel Databases, 6(1998): 117-158.