Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
By Topic

Performance comparison of index partitioning schemes for distributed query processing

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Liebeherr, J. ; Coll. of Comput., Georgia Inst. of Technol., Atlanta, GA, USA ; Akyildiz, I.F. ; Omiecinski, Edward

The benefit of using indexes for processing queries in a database system is well known. The use of indexes in distributed database systems is equally justified. In a distributed database environment a relation may be horizontally partitioned across the nodes of the system and indexes may be created for the fragment of the relation that resides at each node. However as an alternative, one might construct each index on the entire relation, i.e., global indexes, and then partition each index between the nodes. Two approaches are presented for processing such an index partitioning scheme in response to a range query and their performance is compared with the typical scheme. The performance of these schemes is evaluated in terms of the response time, system throughput, network utilization and disk utilization while varying the number of nodes and query

Published in:

System Sciences, 1991. Proceedings of the Twenty-Fourth Annual Hawaii International Conference on  (Volume:i )

Date of Conference:

8-11 Jan 1991