Two Techniques for On-Line Index Modification in Shared Nothing Parallel Databases (1996)
| Venue: | In Proceedings of ACM/SIGMOD Annual Conference on Management of Data |
| Citations: | 5 - 0 self |
BibTeX
@INPROCEEDINGS{Achyutuni96twotechniques,
author = {Kiran Achyutuni and Edward Omiecinski and Shamkant B. Navathe},
title = {Two Techniques for On-Line Index Modification in Shared Nothing Parallel Databases},
booktitle = {In Proceedings of ACM/SIGMOD Annual Conference on Management of Data},
year = {1996},
pages = {125--136}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
this paper, we study two alternatives to index modification, namely OAT (One-At-a-Time page movement) and BULK (bulk page movement). OAT and BULK are two extremes on the spectrum of the granularity of data movement. OAT and BULK differ in two respects: first, OAT uses very little additional disk space (at most one extra page), whereas BULK uses a large amount of disk space. Second, BULK uses sequential prefetch I/O to optimize on the number of I/Os during index modification, while OAT does not. Using an experimental testbed, we show that BULK is an order of magnitude faster than OAT. In terms of the impact on transaction performance during reorganization, BULK and OAT perform differently: when the number of indexes to be modified is either one or two, OAT has a lesser impact on the transaction performance degradation. However, when the number of indexes is greater than 2, both techniques have the same impact on transaction performance.
