This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Partition Strategy for Distributed Query Processing in Fast Local Networks
June 1989 (vol. 15 no. 6)
pp. 780-793

A partition-and-replicate strategy for processing distributed queries referencing no fragmented relation is sketched. An algorithm is given to determine which relation and which copy of the relation is to be partitioned into fragments, how the relation is to be partitioned, and where the fragments are to be sent for processing. Simulation results show that the partition strategy is useful for processing queries in fast local network environments. The results also show that the number of partitions does not need to be large. The use of semijoins in the partition strategy is discussed. A necessary and sufficient condition for a semijoin to yield an improvement is provided.

[1] P. Apers, A. Hevner, and S. B. Yao, "Optimization algorithm for distributed queries,"IEEE Trans. Software Eng., 1983.
[2] P. Bernstein and D. Chiu, "Using semijoins to solve relational queries,"J. ACM, vol. 28, no. 1, pp. 25-40, Jan. 1981.
[3] P. A. Bernstein and N. Goodman, "The theory of semi-join," CCA, Tech. Rep., Nov. 1979.
[4] 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.
[5] D. Bitton, D. J. DeWitt, and C. Turbyfill, "Benchmarking database systems--A systematic approach," inProc. 1983 Very Large Data-base conf., Oct. 1983.
[6] P. A. Black and W. S. Luk, "A new heuristic for generating semijoin programs for distributed query processing," inProc. IEEE COMPSAC, 1982.
[7] D. Brill, M. Templeton, and C. T. Yu, "Distributed query processing strategies in Mermaid, A frontend to data management systems," inProc.IEEE Data Eng. Conf., Feb. 1984.
[8] A. Chanet al., "Overview of an ADA compatible distributed database manager," inProc. 1983 ACM SIGMOD Conf., San Jose, CA, May 1983, pp. 228-237.
[9] J. M. Chang, "A heuristic approach to distributed query processing," inProc. 8th Int. Conf. Very Large Data Bases, 1982, pp. 54- 61.
[10] J. M. Chang, "Query processing in a fragmented data base environment," Bell Lab., Tech. Rep., 1982.
[11] A. L. P. Chen and V. O. K. Li, "Deriving optimal semi-join programs for distributed query processing," inProc. IEEE INFOCOM, San Francisco, CA, Apr. 1984.
[12] A. L. P. Chen and V. O. K. Li, "Optimizing star queries in distributed database systems," inProc. 10th Int. Conf. Very Large Data Bases, 1984, pp. 429-438.
[13] A. L. P. Chen and V. O. K. Li, "Improvement algorithms for semi-join query processing programs in distributed database systems,"IEEE Trans. Comput., Nov. 1984.
[14] D.-M. Chiu, P. A. Bernstein, and Y.-C. Ho, "Optimizing chain queries in a distributed database system,"SIAM J. Comput., vol. 13, pp. 116-134, Feb. 1984.
[15] D. Chiu and Y. Ho, "A methodology for interpreting tree queries into optimal semi-join expressions," inProc. ACM SIGMOD, May 1980, pp. 169-178.
[16] W. W. Chu and P. Hurley, "Optimal query processing for distributed database systems,"IEEE Trans. Comput., vol. C-31, no. 9, pp. 835- 850, Sept. 1982.
[17] 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.
[18] B. Gavish and A. Segev, "Set query optimization on distr. data database Systems,"ACM TODS, vol. 11, no. 3, pp. 265-293, 1986.
[19] N. Goodman, P. A. Bernstein, E. Wong, C. Reeve, and J. B. Rothnie, "Query processing in a system for distributed databases (SDD- 1)," CCA, Tech. Rep., 1979.
[20] N. Goodman and O. Shmueli, "Transforming cyclic schemes into trees," inProc. ACM SIGACT-SIGMOD Conf. Principles of Databases, 1982.
[21] A. Hevner and S. B. Yao, "Query processing in distributed database systems,"IEEE Trans. Software Eng., vol. 5, no. 3, pp. 177-187, 1979.
[22] A. Hevner and S. B. Yao, "Querying distributed databases on local area networks,"Proc. IEEE, vol. 75, no. 5, pp. 563-572, May 1987.
[23] M. Jarke and J. Koch, "Query optimization in database systems,"ACM Comput. Surveys, vol. 16, no. 2, June 1984.
[24] L. Kerschberg and S. B. Yao, "Optimal distributed query processing," Bell Lab., Holmdel, NJ, 1980.
[25] G. Lohman, C. Mohan, L. Hass, B. Lindsay, P. Selinger, and P. Wilms, "Query processing in R*," IBM, Res. Rep. RJ4272, Apr. 1984.
[26] W. C. Luk and L. Luk, "Optimizing query processing strategies in a distributed database system," Simon Fraser Univ., Burnaby, B. C., Canada.
[27] 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.
[28] L. F. Mackert, and G. M. Lehman, "R*optimizer validation and performance evaluation for local queries," inProc. 1986 ACM SIGMOD Conf., 1986, pp. 84-95.
[29] R. McNaughton, "Scheduling with deadlines and loss functions,"Management Sci., vol. 6, no. 1, pp. 1-12, Oct. 1959.
[30] R. Muntz and E. Coffman, "Preemptive scheduling of real-time tasks on multiprocessor systems,"J. ACM, vol. 17, no. 2, pp. 324-338, 1970.
[31] G. Pelagatti and F. A. Schreiber, "A model of an access strategy in a distributed database system," inProc. Conf. Database Architecture, Venice, Italy, 1979.
[32] D. Sacca and G. Wiederhold, "Database partitioning in a cluster of processors,"ACM Trans. Database, Syst., vol. 10, no. 1, pp. 29- 56, Mar. 1985.
[33] G. M. Sacco, "Fragmentation: A technique for efficient query processing,"ACM Trans. Database Syst., vol. 11, no. 2, pp. 113-133, 1986.
[34] 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.
[35] P. Selinger and M. Adiba, "Access path selection in distributed database systems," inProc. First Int. Conf. Distributed Data Bases, Aberdeen, 1980.
[36] M. Templetonet al., "Mermaid-Experiences with network operation," inProc. 1986 2nd Int. Conf. Data Engineering, Los Angeles, CA, Feb. 1986.
[37] J. D. Ullman,Principles of Databases Systems. Rockville, MD: Computer Science Press, 1982.
[38] Williamset al., "R*: An overview of the architecture," inProc. 2nd Int. Conf. Databases, 1982.
[39] E. Wong and R. H. Katz, "Distributing a database for parallelism," inProc. ACM SIGMOD Int. Conf: on Management of Data, San Jose, CA, pp. 23-29, May 1983.
[40] E. Wong, "Retrieving dispersed data from SDD-1: A system for distributed databases," inProc. Berkeley Workshop Distributed Data Management and Computer Networks, Berkeley, CA, 1977.
[41] S. B. Yao, "Optimization of query evaluation algorithms,"ACM Trans. Database Syst., vol. 4, no. 2, pp. 133-155, June 1979.
[42] C. Yu and C. Chang, "Distributed query processing,"ACM Comput. Surveys, vol. 16, no. 4, pp. 399-433, Dec. 1984.
[43] C. T. Yu, C. C. Chang, M. Templeton, D. Brill, and E. Lund, "On the design of a distributed query processing strategy," inProc. Conf. ACM SIGMOD, 1983, pp. 30-39.
[44] C. T. Yu, C. C. Chang, M. Templeton, D. Brill, and E. Lund, "Query processing in a fragmented relational distributed system: Mermaid,"IEEE Trans. Software Eng., vol. SE-11, no. 8, pp. 795- 810, Aug. 1985.
[45] C. T. Yu, K. C. Guh, D. Brill, and A. L. P. Chen, "Partitioning relation for parallel processing in fast local networks," inProc. Int. Conf. Parallel Processing, 1986.
[46] C. T. Yu, K. C. Guh, C. C. Chang, C. H. Chen, M. Templeton, and D. Brill, "An algorithm to process queries in a fast distributed network," inProc. IEEE Real-Time Systems Symp., 1984, pp. 115-122.
[47] C. T. Yu, K. C. Guh, and A. L. P. Chen, "An integrated algorithm for distributed query processing," inProc. IFIP Conf. Distributed Processing, Oct. 5-7, 1987.
[48] C. Yu et al., "Algorithms to Process Distributed Queries in Fast Local Networks,"IEEE Trans. Computers, Oct. 1987, pp. 1153-1164.
[49] C. T. Yu, K. Lam, C. C. Chang, and S. K. Chang, "A promising approach to distributed query processing," inProc. Berkeley Workshop Distributed Data Management and Computer Networks, Berkeley, CA, Feb. 1982, pp. 363-390.
[50] C. T. Yu, L. Lilien, K. Guh, M. Templeton, D. Brill, and A. Chen, "Adaptive techniques for distributed query processing," inProc. IEEE Int. Conf. Data Eng., 1986, pp. 86-93.
[51] C. Yu and M. Ozsoyoglu, "An algorithm for tree query membership for a distributed query,"IEEE COMPSAC, Nov. 1979, pp. 306-312.

Index Terms:
simulation results; distributed query processing; partition-and-replicate strategy; fragmented relation; fast local network environments; semijoins; database theory; distributed databases; local area networks; query languages
Citation:
C.T. Yu, K.-C. Guh, D. Brill, A.L.P. Chen, "Partition Strategy for Distributed Query Processing in Fast Local Networks," IEEE Transactions on Software Engineering, vol. 15, no. 6, pp. 780-793, June 1989, doi:10.1109/32.24731
Usage of this product signifies your acceptance of the Terms of Use.