Global parallel index for multi-processors database systems

Authors:
David Taniar;J. Wenny Rahayu
Affiliations:
School of Business Systems, Monash University, Clayton, Vic. 3800, Australia;Department of Computer Science and Engineering, La Trobe University, Australia
Venue:
Information Sciences: an International Journal
Year:
2004

Citing 7
Cited 15

Concurrent operations on B*-trees with overtaking

Journal of Computer and System Sciences
Concurrent search structure algorithms

ACM Transactions on Database Systems (TODS)
Parallel database systems: the future of high performance database systems

Communications of the ACM
Database management systems

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

ACM Transactions on Database Systems (TODS)
Ubiquitous B-Tree

ACM Computing Surveys (CSUR)
Fundamentals of Database Systems

Fundamentals of Database Systems

Semantic Segmentation Tree for image content representation

International Journal of Virtual Technology and Multimedia
Mobile service oriented architectures for NN-queries

Journal of Network and Computer Applications
Compound treatment of chained declustered replicas using a parallel btree for high scalability and availability

DEXA'10 Proceedings of the 21st international conference on Database and expert systems applications: Part II
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
Efficient k-nearest neighbor searches for parallel multidimensional index structures

DASFAA'06 Proceedings of the 11th international conference on Database Systems for Advanced Applications
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
Mobile Peer-to-Peer data dissemination in wireless ad-hoc networks

Information Sciences: an International Journal
Indexing moving objects for directions and velocities queries

Information Systems Frontiers

Quantified Score

Hi-index	0.07

Visualization

Abstract

In this paper, we propose a global B+ indexing tree structure for parallel database systems. A global B+ indexing tree is a tree structure used for indexing where the complete index tree is partially partitioned into multi-processors but the overall structure of global index is still maintained. We also present algorithms for maintenance of global B+ indexing trees (e.g. insertion and deletion of nodes), and describe operation algorithms (e.g. search and join) on tables that are indexed using global B+ indexing trees.