This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
The Effect of Index Partitioning Schemes on the Performance of Distributed Query Processing
June 1993 (vol. 5 no. 3)
pp. 510-522

An indexing scheme called partitioned global indexes (PGI) for a locally distributed database system is presented. The scheme builds a global index for the entire relation and partitions the index across the sites. A strategy for processing such an index is also presented. In order to evaluate the performance of the scheme, a simulation model is developed. The simulation results are compared to the classical scheme, called partial indexes (PI), in which corresponding index and data entries are stored at the same site. The advantages and disadvantages of the indexing schemes when processing conjuctive queries are analytically investigated. Analysis and simulation experiments show that tradeoffs between the new and the classical scheme.

[1] P. Agrawal, D. Bitton, K. Gull, C. Liu, and C. Yu, "A case study for distributed query processing," inProc. Int. Symp. Databases in Parallel and Distributed Syst., Austin, TX, Dec. 1988, pp. 124-130.
[2] P. A. Bernstein, N. Goodman, E. Wong, G. L. Reeve, and J. Rothmie, "Query processing in a system for distributed database (SDD-I),"ACM Trans. Database Syst., vol. 6, Dec. 1981.
[3] S. Ceri and G. Pelagatti,Distributed Databases: Principles and Systems, McGraw-Hill, New York, 1984.
[4] G. Copeland and T. Keller, "A comparison of high-availability media recovery techniques," inProc. 1989 ACM SIGMOD Conf., Portland, May 1989.
[5] D. Dewitt, R. H. Gerber, G. Graefe, M. L. Heytens, K. B. Kumar, and M. Muralikrishna, "GAMMA--A high performance dataflow database machine," inProc. 12th Int. Conf. VLDB, Kyoto, Japan, Aug. 1986, pp. 228-237.
[6] D. DeWitt, S. Ghandeharizadeh, and D. Schneider, "A performance analysis of the gamma database machine," inProc. ACM-SIGMOD Int. Conf. Management Data, Chicago, IL, May 1988.
[7] R. Epstein, M. Stonebraker, and E. Wong, "Distributed query processing in a relational data base system," inProc. 1978 ACM SIGMOD Int. Conf. Management of Data. New York: ACM Press, May 1978, pp. 169-180.
[8] G. Gardarin and P. Valduriez,Relational Databases and Knowledge Bases. New York: Addison-Wesley, 1989.
[9] S. Lafortune and E. Wong, "A state transition model for distributed query processing,"ACM Trans. Database Syst., vol. 11, pp. 294- 322, Sept. 1986.
[10] J. Liebeherr, I. F. Akyildiz, and E. Omiecinski, "Performance comparison of index partitioning schemes for distributed query processing,"24th Hawaii Int. Conf. Syst. Sci., Koloa, HI, Jan. 1991, pp. 317-323.
[11] G. Lohman, C. Mohan, L. Haas, B. Lindsay, P. Selinger, P. Wilms, and D. Daniels, "Query processing in R*,"Query Processing in Database Systems, W. Kim, D. Batory, and D. Reiner, Eds. New York: Springer Verlag, 1985, pp. 31-47.
[12] H. Lu and M. Carey, "Some experimental results on distributed join algorithms in a local network,"Proc. VLDB Conf., 1985, pp. 292-304.
[13] L. F. Mackert and G. M. Lohman, "R*optimizer validation and performance evaluation for distributed queries," inProc. 12th Int. Conf. Very Large Data Bases, Kyoto, Japan, 1986, pp. 149-159.
[14] W. Perrizo, J. Lin, and W. Hoffman, "Algorithms for distributed query processing in broadcast local area networks,"IEEE Trans. Knowledge Data Eng., vol. 1, pp. 215-225, 1989.
[15] C. H. Sauer, E. A. MacNair, J. F. Kurose, "The Research Queueing Package Version 2,"IBM Research Division, Yorktown Heights, NY, 1982.
[16] M. K. Vernon, E.D. Lazowska, and J. Zahorjan, "An accurate and efficient performance analysis technique for multiprocessor snooping cache-consistency protocols," inProc. 15th Annu. Int. Symp. Comput. Architecture, Honolulu, HI, May 1988, pp. 308-315.
[17] M. Stonebraker, "The design of XPRS," inProc. 14th Int. Conf. VLDB, pp. 318-330, Los Angeles, Aug. 1988.
[18] X. Wang and W. S. Luk, "Parallel join algorithms on a network of workstations," inProc. IEEE and ACM Int. Symp. Databases in Parallel and Distributed Systems, Dec. 1988.
[19] H. Yoo and S. Lafortune, "An intelligent search method for query optimization by semijoins,"IEEE Trans. Knowledge Data Eng., vol. 1, pp. 226-237, 1989.
[20] C. Yu et al., "Algorithms to Process Distributed Queries in Fast Local Networks,"IEEE Trans. Computers, Oct. 1987, pp. 1153-1164.

Index Terms:
performance evaluation; index partitioning schemes; performance; distributed query processing; partitioned global indexes; locally distributed database system; global index; simulation model; partial indexes; data entries; conjuctive queries; distributed databases; indexing; performance evaluation; query processing
Citation:
J. Liebeherr, E. Omiecinski, I.F. Akyildiz, "The Effect of Index Partitioning Schemes on the Performance of Distributed Query Processing," IEEE Transactions on Knowledge and Data Engineering, vol. 5, no. 3, pp. 510-522, June 1993, doi:10.1109/69.224201
Usage of this product signifies your acceptance of the Terms of Use.