Name
Abstract | ||
|---|---|---|
To provide fast response in a relational data base management system (DMBS), the date base administrator (DBA) implements a set of access methods in the form of indexes. In this paper we propose composite B+tree indexes that are based on the B+ tree. Composite B+-tree indexes facilitate enforcing constraints, such as referential integrity rules, and enhance performing joins in a relational data base environment. We also study the performance of the composite B+ trees in a distributed data base system. The index itself can be centralized, distributed (as disjoint segments), or fragmented (as nondisjoint segments). We derive cost expressions for query processing for these index placement strategies, and present the results of simulation to compare the total cost of performing join operations with that of the semijoin technique. |
Year | DOI | Venue |
|---|---|---|
1988 | 10.1016/0164-1212(88)90004-0 | Journal of Systems and Software |
Keywords | Field | DocType |
indexation | Data mining,Composite index,Joins,Disjoint sets,Relational database,Access method,Expression (mathematics),Computer science,Relational algebra,Referential integrity | Journal |
Volume | Issue | ISSN |
8 | 2 | 0164-1212 |
Citations | PageRank | References |
1 | 0.44 | 8 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Bipin C. Desai | 1 | 622 | 54.42 |
| Pankaj Goyal | 2 | 1 | 0.44 |
| Fereidoon Sadri | 3 | 846 | 283.70 |