|
ABSTRACT
Query processing is investigated for relational databases distributed over several computers organized in a star network. Minimal response-time processing strategies are presented for queries involving the select, project, and join commands. These strategies depend on system parameters such as communication costs and different machine processing speeds; database parameters such as relation cardinality and file size; and query parameters such as estimates of the size and number of tuples in the result relation. The optimal strategies specify relation preparation processes, the shipping strategy, serial or parallel processing, and, where applicable, the site of join filtering and merging. Strategies for optimizing select and join queries have been implemented and tested.
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
|
|
| |
2
|
BERNSTEIN, P. A., AND CHIU, D.W. Using semi-joins to solve relational queries. Tech. Rep. 7901-7901, Computer Corporation of America, Boston, 1979.
|
| |
3
|
CHAN, A., AND NIAMIR, B. On estimating the cost of accessing records in blocked database organizations. Comput. J., to be published.
|
 |
4
|
|
| |
5
|
EPSTEIN, R., STONEBRAKER, M., AND WONG, E. Distributed query processing in a relational data base system. Memor. UCB/ERL M78/18, Electronics Research Lab., Univ. of California, Berkeley, April 1978.
|
 |
6
|
P. Griffiths Selinger , M. M. Astrahan , D. D. Chamberlin , R. A. Lorie , T. G. Price, Access path selection in a relational database management system, Proceedings of the 1979 ACM SIGMOD international conference on Management of data, May 30-June 01, 1979, Boston, Massachusetts
[doi> 10.1145/582095.582099]
|
| |
7
|
HEVNER, R., AND YAO, S.B. Query processing on a distributed database. In Proc. 1978 Berkeley Workshop on Distributed Data Management and Computer Networks (Aug. 1978), NTIS, Washington, D.C.
|
| |
8
|
HEVNER, R., AND YAO, S.B. Query processing in distributed database systems. IEEE Trans. Soflw. Eng. SE-5, 3 (May 1979).
|
| |
9
|
|
| |
10
|
|
| |
11
|
|
| |
12
|
MERRETT, W., AND OTOO, E. Distribution models of relations. In Proc. 5th Int. Conf. Very Large Data Bases (Rio de Janeiro, Oct. 3-5), ACM, New York, 1979, pp. 418-425.
|
| |
13
|
|
 |
14
|
|
| |
15
|
TING, P.D., AND TSICHRITZIS, D.C. A Micro-DBMS for a distributed data base. In Proc. 4th Int. Conf. Very Large Data Bases (West Berlin, Sept. 13-15), ACM, New York, 1978, pp. 200-206.
|
| |
16
|
TONG, E. Retrieving dispersed data from SDD-I: A system for distributed databases. In Proc. 1977 Berkeley Workshop on Distributed Data Management and Computer Networks (May 1977}, NTIS, Washington, D.C.
|
 |
17
|
|
 |
18
|
|
 |
19
|
|
Peer to Peer - Readers of this Article have also read:
-
Open signaling for ATM, internet and mobile networks (OPENSIG'98)
ACM SIGCOMM Computer Communication Review
29, 1
Andrew T. Campbell
, Irene Katzela
, Kazuho Miki
, John Vicente
-
Active bridging
ACM SIGCOMM Computer Communication Review
27, 4
D. Scott Alexander
, Marianne Shaw
, Scott M. Nettles
, Jonathan M. Smith
-
Active electronic mail
Proceedings of the 2002 ACM symposium on Applied computing
S. Karnouskos
, A. Vasilakos
-
Object-oriented database management system for process control systems—development and evaluation
Proceedings of the 1999 ACM symposium on Applied computing
Ryuji Wakizono
, Toshikazu Kawamura
, Takehiko Tsuchiya
, Takahiro Hatanaka
, Tatsuji Tanaka
-
Data structures for quadtree approximation and compression
Communications of the ACM
28, 9
Hanan Samet
|