Towards Self-Tuning Data Placement in Parallel Database Systems.

@inproceedings{DBLP:conf/sigmod/LeeKOTM00,
  author    = {Mong-Li Lee and
               Masaru Kitsuregawa and
               Beng Chin Ooi and
               Kian-Lee Tan and
               Anirban Mondal},
  editor    = {Weidong Chen and
               Jeffrey F. Naughton and
               Philip A. Bernstein},
  title     = {Towards Self-Tuning Data Placement in Parallel Database Systems},
  booktitle = {Proceedings of the 2000 ACM SIGMOD International Conference on
               Management of Data, May 16-18, 2000, Dallas, Texas, USA},
  publisher = {ACM},
  year      = {2000},
  isbn      = {1-58113-218-2},
  pages     = {225-236},
  ee        = {http://doi.acm.org/10.1145/342009.335416, db/conf/sigmod/LeeKOTM00.html},
  crossref  = {DBLP:conf/sigmod/2000},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Abstract

Copyright © 2000 by the ACM, Inc., used by permission. Permission to make digital or hard copies is granted provided that copies are not made or distributed for profit or direct commercial advantage, and that copies show this notice on the first page or initial screen of a display along with the full citation.

Online Edition

References

[1]

Kiran J. Achyutuni, Edward Omiecinski, Shamkant B. Navathe: Two Techniques for On-Line Index Modification in Shared Nothing Parallel Databases. SIGMOD Conference 1996: 125-136 BibTeX

[2]

Thomas E. Anderson, David E. Culler, David A. Patterson: A Case for NOW (Networks Of Workstations). IEEE Micro 15(1): 54-64(1995) BibTeX

[3]

Elisa Bertino, Beng Chin Ooi, Ron Sacks-Davis, Kian-Lee Tan, Justin Zobel, Boris Shidlovsky, Barbara Catania: Indexing Techniques for Advanced Database Systems. Kluwer 1997, ISBN 0-7923-9985-4
BibTeX

[4]

Theodore Johnson, Padmashree Krishna: Lazy Updates for Distributed Search Structure. SIGMOD Conference 1993: 337-346 BibTeX

[5]

...

[6]

Brigitte Kröll, Peter Widmayer: Distributing a Search Tree Among a Growing Number of Processors. SIGMOD Conference 1994: 265-276 BibTeX

[7]

David B. Lomet: Replicated Indexes for Distributed Data. PDIS 1996: 108-119 BibTeX

[8]

C. Mohan, Inderpal Narang: Algorithms for Creating Indexes for Very Large Tables Without Quiescing Updates. SIGMOD Conference 1992: 361-370 BibTeX

[9]

Edward Omiecinski: Concurrent Storage Structure Conversion: from B+ Tree to Linear Hash File. ICDE 1988: 589-596 BibTeX

[10]

Edward Omiecinski, Liehuey Lee, Peter Scheuermann: Concurrent File Reorganization for Record Clustering: A Performance Study. ICDE 1992: 265-272 BibTeX

[11]

Beng Chin Ooi, Kian-Lee Tan, Cui Yu, Stéphane Bressan: Indexing the Edges - A Simple and Yet Efficient Approach to High-Dimensional Indexing. PODS 2000: 166-174 BibTeX

[12]

Raghu Ramakrishnan: Database Management Systems. WCB/McGraw-Hill 1998, ISBN 0-07-050775-9
BibTeX

[13]

...

[14]

Peter Scheuermann, Gerhard Weikum, Peter Zabback: ``Disk Cooling'' in Parallel Disk Systems. IEEE Data Eng. Bull. 17(3): 29-40(1994) BibTeX

[15]

Peter Scheuermann, Gerhard Weikum, Peter Zabback: Data Partitioning and Load Balancing in Parallel Disk Systems. VLDB J. 7(1): 48-66(1998) BibTeX

[16]

Gary H. Sockut, Balakrishna R. Iyer: A Survey on Online Reorganization in IBM Products and Research. IEEE Data Eng. Bull. 19(2): 4-11(1996) BibTeX

[17]

...

[18]

Radek Vingralek, Yuri Breitbart, Gerhard Weikum: Snowball: Scalable Storage on Networks of Workstations with Balanced Load. Distributed and Parallel Databases 6(2): 117-156(1998) BibTeX

[19]

...

[20]

Chendong Zou, Betty Salzberg: On-line Reorganization of Sparsely-populated B+trees. SIGMOD Conference 1996: 115-124 BibTeX

[21]

Chendong Zou, Betty Salzberg: Safely and Efficiently Updating References During On-line Reorganization. VLDB 1998: 512-522 BibTeX