ACM Home Page
Please provide us with feedback. Feedback
The state of the art in distributed query processing
Full text PdfPdf (455 KB)
Source ACM Computing Surveys (CSUR) archive
Volume 32 ,  Issue 4  (December 2000) table of contents
Pages: 422 - 469  
Year of Publication: 2000
ISSN:0360-0300
Author
Donald Kossmann  Univ. of Passau, Passau, Germany
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 157,   Downloads (12 Months): 1050,   Citation Count: 65
Additional Information:

abstract   references   cited by   index terms   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/371578.371598
What is a DOI?

ABSTRACT

Distributed data processing is becoming a reality. Businesses want to do it for many reasons, and they often must do it in order to stay competitive. While much of the infrastructure for distributed data processing is already there (e.g., modern network technology), a number of issues make distributed data processing still a complex undertaking: (1) distributed systems can become very large, involving thousands of heterogeneous sites including PCs and mainframe server machines; (2) the state of a distributed system changes rapidly because the load of sites varies over time and new sites are added to the system; (3) legacy systems need to be integrated—such legacy systems usually have not been designed for distributed data processing and now need to interact with other (modern) systems in a distributed environment. This paper presents the state of the art of query processing for distributed database and information systems. The paper presents the “textbook” architecture for distributed query processing and a series of techniques that are particularly useful for distributed database systems. These techniques include special join techniques, techniques to exploit intraquery paralleli sm, techniques to reduce communication costs, and techniques to exploit caching and replication of data. Furthermore, the paper discusses different kinds of distributed systems such as client-server, middleware (multitier), and heterogeneous database systems, and shows how query processing works in these systems.


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
3
 
4
5
 
6
ACM Computing Surveys. 1990. Special issue on heterogeneous databases. ACM Computing Surveys, 22, 13.
7
 
8
 
9
AKSOY,D.AND FRANKLIN, M. 1998. Scheduling for large-scale on-demand data broadcasting. In Proceedings IEEE INFOCOM Conference (San Francisco, CA, March).
10
11
 
12
13
 
14
BESTAVROS,A.AND CUNHA, C. 1996. Server-initiated document dissemination for the WWW. IEEE Data Engeneering Bulletin 19, 3 (Sept.), 3- 11.
15
 
16
17
 
18
 
19
20
 
21
22
23
 
24
25
 
26
 
27
28
29
30
31
32
33
 
34
35
 
36
37
 
38
 
39
40
 
41
42
43
 
44
45
 
46
 
47
 
48
EPSTEIN, R., STONEBRAKER, M., AND WONG, E. 1978. Query processing in a distributed relational database system. In Proceedings of the ACM SIGMOD Conference on Management of Data (Austin, TX, June), 169-180.
 
49
50
 
51
 
52
 
53
FERGUSON, D., NIKOLAOU,C.,AND YEMINI, Y. 1993. An economy for managing replicated data in autonomous decentralized systems. In Proceedings International Symposium on Autonomous and Decentralized Systems (Kawasaki, Japan).
 
54
55
 
56
57
58
59
60
61
 
62
63
64
 
65
GRAEFE, G. 1995. The cascades framework for query optimization. IEEE Data Engeneering Bulletin 18, 3 (Sept.), 19-29.
 
66
67
 
68
69
70
 
71
 
72
 
73
74
 
75
GWERTZMAN,J.AND SELTZER, M. 1994. The Case for Geographical Push-Caching. Technical Report HU TR-34-94, Harvard University, Cambridge, MA.
76
 
77
78
 
79
 
80
HARDER, T., MITSCHANG, B., NINK,U.,AND RITTER,N. 1995. Workstation/server-architekturen fur datenbankbasierte ingenieuranwendungen. Informatik-Forschung und Entwicklung 10,2 (May), 55-72.
81
 
82
 
83
HONG,W.AND STONEBRAKER, M. 1990. Parallel Query Processing in XPRS. Technical report UCB/ERL M90/47 (May), Department of Industrial Engineering and Operations Research and School of Business Administration, University of California, Berkeley, CA.
 
84
IEEE Data Engineering Bulletin. 1998. Special issue on interoperability. IEEE Data Engineering Bulleting, 21, 3.
85
 
86
87
 
88
89
 
90
91
92
 
93
94
 
95
96
97
98
99
 
100
 
101
LEVY, A. 1999. Answering Queries Using Views: A Survey. In preparation.
 
102
103
 
104
 
105
LORIE,R.AND WADE, B. 1979. The Compilation of a High Level Data Language. Technical Report RJ 2598, IBM Research, San Jose, CA.
 
106
LU,H.AND CAREY, M. 1985. Some experimental results on distributed join algorithms in a local network. In Proceedings of the Conference on Very Large Data Bases (VLDB) (Stockholm, Sweden), 229-304.
 
107
LUOTONEN,A.AND ALTIS, K. 1994. World-Wide Web Proxies. Technical report (April), CERN, Geneva, Switzerland.
 
108
 
109
MAIER, D., GRAEFE, G., SHAPIRO, L., DANIELS, S., KELLER, T. , AND VANCE, B. 1994. Issues in distributed object assembly. In T. OZSU,U.DAYAL, AND P. VAL- DURIEZ EDS., Distributed Object Management (San Mateo, CA, May 1994), 165-181. Morgan Kaufmann Publishers. International Workshop on Distributed Object Management.
 
110
 
111
112
 
113
 
114
115
 
116
OZCAN, F., NURAL, S., KOKSAL, P., EVRENDILEK,C.,AND DOGAC, A. 1997. Dynamic query optimization in multidatabases. IEEE Data Engineering Bulletin 20, 3 (Sept.), 38-45.
 
117
 
118
 
119
 
120
121
122
 
123
 
124
RELLY, L., SCHULDT, H., AND SCHEK, H.-J. 1998. Exporting database functionality-the concert way. IEEE Data Engeneering Bulletin 21,3 (Sept.), 40-48.
 
125
 
126
127
 
128
ROUSSOPOULOS, N., CHEN, C., KELLEY, S., DELIS, A., AND PAPAKONSTANTINOU, Y. 1995. The adms project: views r us. IEEE Data Engeneering Bulletin 18,2 (June), 19-28.
 
129
 
130
131
132
 
133
134
135
 
136
 
137
138
 
139
 
140
 
141
STONEBRAKER, M. 1985. The design and implementation of distributed INGRES. Reading, MA. Addison-Wesley.
 
142
STONEBRAKER, M. 1986. The case for shared nothing. IEEE Data Engeneering Bulletin 9, 1 (March), 4-9.
 
143
 
144
 
145
 
146
 
147
 
148
 
149
 
150
URHAN,T.AND FRANKLIN, M. 1999. Xjoin: Getting Fast Answers from Slow and Bursty Networks. Technical report CS-TR-3994 (Feb.), University of Maryland, College Park.
151
152
153
154
 
155
 
156
157
 
158
159
 
160
161
 
162

CITED BY  65