Algorithms for merged indexes

B-tree and index into two layers of abstraction. In addition, this paper provides algorithms for (i) concurrency control and recovery including locking of individual keys and of complex objects, for (ii) data definition operations including adding and removing individual indexes in a merged index, for (iii) update operations including bulk insertions and bulk deletions, for (iv) enforcement of relational integrity constraints from uniqueness constraints to foreign key constraints, and for (v) query processing including caching in query execution plans dominated by nested iteration and index navigation. Within such a merged index, the set of tables, views, and indexes can evolve without restriction. The set of clustering columns can also evolve freely. A relational query processor can search and update index records just as in traditional indexes. With these abilities, the proposed design may finally bring general masterdetail clustering and its performance advantages to traditional dat...

• Type: Conference
• Year: 2007
• Where: BTW
• Authors: Goetz Graefe
• Keywords: BTW 2007, Foreign Key Constraints, Merged Index, Relational Integrity Constraints