ACM Home Page
Please provide us with feedback. Feedback
Set query optimization in distributed database systems
Full text PdfPdf (1.29 MB)
Source ACM Transactions on Database Systems (TODS) archive
Volume 11 ,  Issue 3  (September 1986) table of contents
Pages: 265 - 293  
Year of Publication: 1986
ISSN:0362-5915
Authors
Bezalel Gavish  Univ. of Rochester, Rochester, NY
Arie Segev  Univ. of California, Berkeley
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 10,   Downloads (12 Months): 115,   Citation Count: 11
Additional Information:

abstract   references   cited by   index terms   review   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/6314.6488
What is a DOI?

ABSTRACT

This paper addresses the problem of optimizing queries that involve set operations (set queries) in a distributed relational database system. A particular emphasis is put on the optimization of such queries in horizontally partitioned database systems. A mathematical programming model of the set query problem is developed and its NP-completeness is proved. Solution procedures are proposed and computational results presented. One of the main results of the computational experiments is that, for many queries, the solution procedures are not sensitive to errors in estimating the size of results of set operations.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
APERS, P. M.G. Distributed query processing=. Minimum response time schedules for relations. IR 53, Vrije Univ., Amsterdam, Nov. 1979.
 
2
APERS, P. M. G., HEVNER, A. R., AND YAO, S. B. Optimization algorithms for distributed queries. IEEE Trans. Softw. Eng. SE-9, l (Jan. 1983), 57-68.
3
 
4
CORNUEJOLS, G., FISHER, M. L., AND NEMHAUSER, G.L. Location of bank accounts to optimize float. Manage. Sci. 23, 8 (Apr. 1977), 789-810.
 
5
DANIELS, D. Query compilation in a distributed database system. IBM Res. Rep. RJ3423, Mar. 1982.
 
6
DANIELS, D., SELINGER, P., HAAS, L., LINDSAY, B., MOHAN, C., WALKER, A., AND WILMS, P. An introduction to distributed query compilation in R*. IBM Res. Rep. RJ3497, June 1982.
 
7
EPSTEIN, R. S., STONEBRAKER, M., AND WONG, E. Distributed query processing in a relational database system. In Proceedings ACM-SIGMOD (May 1979), 169-180.
 
8
EPSTEIN, R. S., AND STONEBRAKER~ M. Analysis of query processing strategies for distributed database systems. In Proceedings of the 6th International Conference on Very Large Data Bases (1980).
 
9
ERLENKOTTER, D. A dual based procedure for uncapacitated facility location. Oper. Res. 26, 1 (1978), 992-1009.
 
10
 
11
GAVISH, B. Topological design of centralized computer networks--Formulations and algorithms. Networks 12 (1982), 355-377.
 
12
GAVlSH, B., AND SE(}EV, A. Set query optimization in horizontally partitioned distributed database systems. Working Paper QM 8304, Graduate School of Management, Univ. of Rochester, Rochester, N.Y., 1983.
 
13
HELD, G. D., STONEnRAKER, M., AND WONG, E. INGRES--a relational DBMS. In Proceedings of AFIPS 1975 National Computer Conference (Arlington, Va., 1975), 409-416.
 
14
HEVNER, A. R., AND YAO, S.B. Query processing in distributed database systems. IEEE Trans. Softw, Eng. SE-5, 3 (May 1979), 177-187.
 
15
 
16
PAIK, I. S., AND DELOBEL, C. A strategy for optimizing the distributed query processing. In Proceedings of the 1st International Conference on Distributed Computing Systems (Huntsville, Ala., Oct. 1979).
 
17
PEEBLES, R. W., AND MANNING, E.D. A computer architecture for large (distributed) databases. In Proceedings o{ the Con{erence on Very Large Data Bases (Framingham, Mass., Sept. 1975).
 
18
PELA6ATTI, G., AND SCHREInER, F.A. A model of an access strategy in a distributed database system. In Proceedings of the IFIP-TC2, Database Architecture (Venice, 1979).
 
19
ROTHNIE, J. B., AND GOODMAN, N. A survey of R&D in distributed database management. In Proceedings of the International Con{erence on Very Large Data Bases (Tokyo, Oct. 1977).
20
 
21
SELINGER, P. G., AND ADIBA, M.E. Access path selection in distributed data base management systems. In Proceedings of the International Conference on Databases (July 1980), 204-215.
 
22
STONHBR^KER, M., AND NEUHOLD, E. A distributed database version of INGRES. In Proceedings of the 3rd Berkeley Workshop on Distributed Data Management and Computer Networks (May 1977).
 
23
WILLIAMS, R., ET AL. R*. An overview of the architecture. IBM Res. Rep. RJ3325, Dec. 198i.
 
24
WONG, E. Retrieving dispersed data from SDD-I: A system for distributed databases. In Proceedings of the 3rd Berkeley Workshop on Distributed Data Management and Computer Networks (May 1977), 217-235.
25
26
 
27
ZLOOF, M.M. Query-By-Example. IBM Syst. J. 4 (1977), 324-343.

CITED BY  11


REVIEW

"Jason Gait : Reviewer"

A set query is a sequence of relations between a set of tuples and a distributed collection of sets of tuples, followed by set operations. Given a set query, and assuming that: (1)fragments o  more...

Collaborative Colleagues:
Bezalel Gavish: colleagues
Arie Segev: colleagues