Interleaving a Join Sequence with Semijoins in Distributed Query Processing

IEEE Transactions on Parallel and Distributed Systems

Volumn 3, Issue 5, 1992, Pages 611-621

  Chen, Ming Syan ^a   Yu, Philip S ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

QUERY LANGUAGES;

DISTRIBUTED QUERY PROCESSING; JOIN SEQUENCE TREE; REDUCIBLE SETS;

DISTRIBUTED DATABASE SYSTEMS;

EID: 0026927209     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/71.159044     Document Type: Article

References (27)

1. P. M. G. Apers, A. R. Hevner, and S. B. Yao, “Optimization algorithms for distributed queries,” IEEE Trans. Software Eng., vol. SE-9, no. 1, pp. 57–68, Jan. 1983.
2. P. A. Bernstein and D.-M. W Chiu, “Using semijoins to solve relational queries,” J. ACM, vol. 28, no. 1, pp. 25–40, Jan. 1981.
3. P. A. Bernstein, N. Goodman, E. Wong, C. Reeve, and J. B. Rothnie, “Query processing in a system for distributed databases (SDD-1),” ACM Trans. Database Syst., vol. 6, no. 4, pp. 602–625, Dec. 1981.
4. P. A. Black and W. S. Luk, “A new heuristic for generating semijoin programs for distributed query processing,” in Proc. IEEE COMPSAC, 1982, pp. 581–588.
5. S. Ceri and G. Pelagatti, Distributed Databases Principle and Systems. New York: McGraw-Hill, 1985.
6. A. L. P. Chen and V. O. K. Li, “Improvement algorithms for semijoin query processing programs in distributed database systems,” IEEE Trans. Comput., vol. C-33, no. 11, pp. 959–967, Nov. 1984.
7. A. L. P. Chen and V. O. K. Li, “Optimizing star queries in a distributed database system,” in Proc. 10th lnt. Conf. Very Large Data Bases, Aug. 1984, pp. 429–438.
8. M.-S. Chen and P. S. Yu, “Using combination of join and semijoins operations for distributed query processing,” in Proc. 10th Int. Conf. Distributed Comput. Syst., May 1990, pp. 328–335.
9. M.-S. Chen and P. S. Yu, “Using join operations as reducers in distributed query processing,” in Proc. 2nd Int. Symp. Databases in Parallel Distributed Syst., July 1990, pp. 116–123.
10. D.-M. Chiu, P. A. Bernstein, and Y.-C. Ho, “Optimizing chain queries in a distributed database system,” SIAM J. Comput., vol. 13, no. 1, pp. 116–134, Feb. 1984.
11. W. W. Chu and P. Hurley, “Optimal query processing for distributed database systems,” IEEE Trans. Comput., vol. C-31, no. 9, pp. 135–150, Sept. 1982.
12. N. Goodman and O. Shmueli, “The tree property is fundamental for query processing,” in Proc. ACM Symp. Principles Database Syst., 1982, pp. 40–48.
13. F. Harary, Graph Theory. Reading, MA: Addison-Wesley, 1969.
14. A. R. Hevner, “The optimization of query processing on distributed database systems,” Ph.D. dissertation, Purdue Univ., 1979.
15. A. R. Hevner and S. B. Yao, “Query processing in distributed database systems,” IEEE Trans. Software Eng., vol. SE-5, no. 5, pp. 177–187, May 1979.
16. Y. Kambayashi, M. Yoshikawa, and S. Yajima, “Query processing for distributed databases using generalized semi-joins,” ACM Proc. SIGMOD, pp. 151–160, 1982.
17. H. Kang and N. Roussopoulos, “Combining joins and semijoins in distributed query processing,” Tech. Rep. CS-TR-1794, Univ. Maryland, College Park, 1987.
18. S. Lafortune and E. Wong, “A state transition model for distributed query processing,” ACM Trans. Database Syst., vol. 11, no. 3, pp. 294–322, Sept. 1986.
19. G. M. Lohman, C. Mohan, L. M. Hass, B. G. Lindsay, P. G. Selinger, P. F. Wilms, and D. Daniels, “Query processing in R*,” Res. Rep. RJ 4272, IBM Res. Lab., San Jose, CA., Apr. 1984.
20. N. J. Nilsson, Principles of Artificial Intelligence. Berlin, Germany: Springer-Verlag, 1982.
21. S. Pramanik and D. Vineyard, “Optimizing join queries in distributed databases,” IEEE Trans. Software Eng., vol. SE-14, no. 9, pp. 1319–1326, Sept. 1988.
22. A. Segev, “Global heuristic for distributed query optimization,” in Proc. IEEE INFOCOM, 1986, pp. 388-394.
23. C. Wang, “The complexity of processing tree queries in distributed databases,” in Proc. 2nd IEEE Symp. Parallel Distributed Processing, Dec. 1990, pp. 604–611.
24. S. B. Yao, “Approximating block access in database organizations,” Commun. ACM, vol. 20, pp. 260–261, Apr. 1977.
25. H. Yoo and S. Lafortune, “An intelligent search method for query optimization by semijoins,” IEEE Trans. Knowledge Data Eng., vol. 1, no. 2, pp. 226–237, June 1989.
26. C. T. Yu, Z. Ozsoyoglu, and K. Lam, “Optimization of distributed tree queries,” J. Comput. Syst. Sci., vol. 29, no. 3, pp. 409-445, Dec. 1984.
27. C. T. Yu and C. C. Chang, “Distributed query processing,” ACM Comput. Surveys, vol. 16, no. 4, pp. 399–433, Dec. 1984.