Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Asserting the optimality of serial SJRPs in processing simple queries in chain networks
Gursel G., Scheuermann P. Information Processing Letters19 (5):255-260,1984.Type:Article
Date Reviewed: Sep 1 1985

Minimization of the total volume of data transmissions (and consequently the time required) is an important goal in the processing of queries in distributed database systems. The problem of finding an optimal schedule of operations for a general class of queries in an arbitrary system is shown to be NP-hard [1]. In this paper, a simple subclass of queries in a special kind of network (namely a chain connected network) is considered and optimal solution strategies are developed. The authors show that if the result node coincides with one end of the chain, the optimal solution strategy is either a serial Semi-Join Reduction Program (SJRP), or two serial SJRPs merging at the result node. This extends the results obtained by other researchers which have shown that parallel transmissions are not cost effective in networks of arbitrary topology if the objective is total minimization.

This paper, like other notes appearing in Information Processing Letters, is fairly short and thus does not contain background information (material). The reader, therefore, must have the technical knowledge necessary in this subject, or should first read the earlier work by Gurse [2] cited in the article.

Reviewer:  F. Golshani Review #: CR109305
1) Sacco, G. M.; and Yao, S. B.Query optimization in distributed database systems, in Advances in Computers, Vol. 21, Academic Press, Orlando, FL, 1982, 225–273.
2) Gursel, G.Optimization of query processing in distributed database systems, PhD thesis, Dept. of Elect. Eng. and Comput. Sci., Northwestern Univ., 1983.
Bookmark and Share
 
Distributed Databases (H.2.4 ... )
 
 
Network Topology (C.2.1 ... )
 
 
Query Processing (H.2.4 ... )
 
Would you recommend this review?
yes
no
Other reviews under "Distributed Databases": Date
Federated database systems for managing distributed, heterogeneous, and autonomous databases
Sheth A., Larson J. ACM Computing Surveys 22(3): 183-236, 2001. Type: Article
Jul 1 1991
Nested transactions: an approach to reliable distributed computing
Moss J., Massachusetts Institute of Technology, Cambridge, MA, 1985. Type: Book (9780262132008)
Mar 1 1986
The complexity of distributed concurrency control
Kanellakis P. (ed), Papadimitriou C. SIAM Journal on Computing 14(1): 52-74, 1985. Type: Article
Dec 1 1985
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy