Parallelizing multidimensional index structures

K. V.Ravi Kanth, Divyakant Agrawal, Amr El Abbadi, Ambuj Singh, Terence R. Smith

Research output: Contribution to journalConference article


Indexing multidimensional data is inherently complex leading to slow query processing. This behavior becomes more pronounced with the increase in database size and/or number of dimensions. In this paper, we address this issue by processing an index structure in parallel. First, we study different ways of partitioning an index structure. We then propose efficient algorithms for processing each query in parallel on the index structure. Using these strategies, we parallelized two multidimensional index structures - R* and LIB and evaluated the performance gains for the Gazetteer and the Catalog data of the Alexandria Digital Library on the Meiko CS-2.

Original languageEnglish
Pages (from-to)376-383
Number of pages8
JournalIEEE Symposium on Parallel and Distributed Processing - Proceedings
Publication statusPublished - 1 Dec 1996
EventProceedings of the 1996 8th IEEE Symposium on Parallel and Distributed Processing - New Orleans, LA, USA
Duration: 23 Oct 199626 Oct 1996


ASJC Scopus subject areas

  • Engineering(all)

Cite this

Kanth, K. V. R., Agrawal, D., El Abbadi, A., Singh, A., & Smith, T. R. (1996). Parallelizing multidimensional index structures. IEEE Symposium on Parallel and Distributed Processing - Proceedings, 376-383.