A Taxonomy of Indexing Schemes for Parallel Database Systems David Taniar and J. Wenny Rahayu Return to Volume 12, Number 1, Jul 2002 Abstract In this paper, we present a taxonomy of indexing schemes in parallel database systems. Index partitioning is not recognized widely as yet. One of the reasons is that most of index structures are trees, not flat structures like tables, and consequently, index partitioning imposes some degree of complexity compared with common data partitioning for tables. We present three parallel indexing schemes, and discuss their maintenance strategies. We also analyze their storage requirements. DiSC'03 © 2003 Association for Computing Machinery