Recycling Secondary Index Structures *
Several important database reorganization techniques move tuples in a table from one location to another in a single pass. For example, the Mariposa distributed database system frequently moves or copies tables between sites. However, moving a table generally invalidates the pointers contained in it...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Text |
| Language: | English |
| Subjects: | |
| Online Access: | http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.70.583 http://s2k-ftp.cs.berkeley.edu:8000/postgres/papers/S2K-95-66.pdf |
| Summary: | Several important database reorganization techniques move tuples in a table from one location to another in a single pass. For example, the Mariposa distributed database system frequently moves or copies tables between sites. However, moving a table generally invalidates the pointers contained in its secondary indices. Because index reconstruction is extremely resource-intensive, table movement has been considered a expensive operation. In this paper, we present simple, efficient mechanisms for translating index pointers. We also demonstrate their effectiveness using performance measurements of an implementation in Mariposa. Use of these mechanisms will enable parallel and distributed systems like Mariposa to move tables more freely, pro viding many more options for performance-enhancing reorganizations of the database. 1. |
|---|