A taxonomy of indexing schemes for parallel database systems

Distributed and Parallel Databases

Volumn 12, Issue 1, 2002, Pages 73-106

  Taniar, David ^a   Rahayu, J Wenny ^b  

^a MONASH UNIVERSITY   (Australia)

^b LA TROBE UNIVERSITY   (Australia)

Author keywords

B+ trees; Data partitioning; Indexing; Parallel databases

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; INDEXING (OF INFORMATION); PARALLEL PROCESSING SYSTEMS;

PARALLEL DATABASE SYSTEMS;

DATABASE SYSTEMS;

EID: 0036644619     PISSN: 09268782     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1015682215394     Document Type: Article

References (18)

1. Organization and maintenance of large ordered indices
2. Concurrency of operations on B-trees
3. Overview of parallel architecture for databases
4. The ubiquitous B-Trees
5. Parallel database systems: The future of high performance database systems
6. Concurrent search and inserts in 2-3 trees
7. Hybrid-range partitioning strategy: A new declustering strategy for multiprocessor database machines
8. A performance analysis of alternative multi-attribute declustering strategies
9. A new method for concurrency in B-trees
10. Efficient locking for concurrent operations on B-trees
11. The effect of index partitioning schemes on the performance of distributed query processing
12. Concurrent operations on B-trees with overtaking
13. Concurrent search structure algorithms
14. Parallel join query algorithms involving index