A Taxonomy of Indexing Schemes for Parallel Database Systems

Authors:
David Taniar;J. Wenny Rahayu
Affiliations:
School of Business Systems, Monash University, PO Box 63B, Clayton, Victoria 3800, Australia. David.taniar@infotech.monash.edu.au;Department of Computer Science and Computer Engineering, La Trobe University, Bundoora, Victoria 3083, Australia. wenny@cs.latrobe.edu.au
Venue:
Distributed and Parallel Databases
Year:
2002

Citing 11
Cited 17

Concurrent operations on B*-trees with overtaking

Journal of Computer and System Sciences
Concurrent search structure algorithms

ACM Transactions on Database Systems (TODS)
Hybrid-range partitioning strategy: a new declustering strategy for multiprocessor databases machines

Proceedings of the sixteenth international conference on Very large databases
Parallel database systems: the future of high performance database systems

Communications of the ACM
A performance analysis of alternative multi-attribute declustering strategies

SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
Fundamentals of database systems (2nd ed.)

Fundamentals of database systems (2nd ed.)
Database management systems

Database management systems
Efficient locking for concurrent operations on B-trees

ACM Transactions on Database Systems (TODS)
Oracle parallel processing

Oracle parallel processing
Ubiquitous B-Tree

ACM Computing Surveys (CSUR)
The Effect of Index Partitioning Schemes on the Performance of Distributed Query Processing

IEEE Transactions on Knowledge and Data Engineering

Losers and finders: indexing audio-visual digital media

Proceedings of the 5th conference on Creativity & cognition
PathScape: indexing audio-visual digital media

Proceedings of the 5th conference on Creativity & cognition
Path conscious caching of B+ tree indexes in a shared disks cluster

Journal of Parallel and Distributed Computing
A novel data replication and management protocol for mobile computing systems

Mobile Information Systems
The use of Hints in SQL-Nested query optimization

Information Sciences: an International Journal
Indexing schemes for multichannel data broadcasting in mobile databases

International Journal of Wireless and Mobile Computing
Mobile service oriented architectures for NN-queries

Journal of Network and Computer Applications
Composite RAID for rapid prototyping data grid

International Journal of Web and Grid Services
Voronoi-based range and continuous range query processing in mobile databases

Journal of Computer and System Sciences
Data warehouse design on the basis of Hierarchical Degenerate Snowflake (HDS)

International Journal of Business Intelligence and Data Mining
Path branch points in mobile navigation

Proceedings of the 8th International Conference on Advances in Mobile Computing and Multimedia
Voronoi-based multi-level range search in mobile navigation

Multimedia Tools and Applications
Mobile broadcast services with MIMO antennae in 4G wireless networks

World Wide Web
Multi-criteria optimization in GIS: continuous k-nearest neighbor search in mobile navigation

ICCSA'10 Proceedings of the 2010 international conference on Computational Science and Its Applications - Volume Part I
Mobile query services in a participatory embedded sensing environment

ACM Transactions on Embedded Computing Systems (TECS) - Special issue on embedded systems for interactive multimedia services (ES-IMS)
Dynamic View Management System for Query Prediction to View Materialization

International Journal of Data Warehousing and Mining
Indexing moving objects for directions and velocities queries

Information Systems Frontiers

Quantified Score

Hi-index	0.00

Visualization

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.