The state of the art in distributed query processing
The DOI matches its Crossref record; 51 of the 51 references it cites were found in a registry or an index.
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Compilers: Principles, Techniques, and Tools
Aho, A. V., Sethi, R., & Ullman, J. D. (1986) · Cited by 8,478
Transaction Processing: Concepts and Techniques
Gray, J., & Reuter, A. (1992) · Cited by 3,000
Federated database systems for managing distributed, heterogeneous, and autonomous databases
Sheth, A. P., & Larson, J. A. (1990) · ACM Computing Surveys · doi:10.1145/96602.96604 · Cited by 2,476
Principles of Distributed Database Systems
Özsu, M. T., & Valduriez, P. (2020) · Springer eBooks · doi:10.1007/978-3-030-26253-2 · Cited by 2,345
Access path selection in a relational database management system
Selinger, P. G., Astrahan, M. M., Chamberlin, D. D., Lorie, R. A., & Price, T. G. (1979) · Proceedings of the 1979 ACM SIGMOD international conference on Management of data - SIGMOD '79 · doi:10.1145/582095.582099 · Cited by 2,188
Data Cube: A Relational Aggregation Operator Generalizing Group-By, Cross-Tab, and Sub-Totals
Gray, J., Chaudhuri, S., Bosworth, A., Layman, A., Reichart, D., Venkatrao, M., Pellow, F., & Pirahesh, H. (1997) · Data Mining and Knowledge Discovery · doi:10.1023/a:1009726021843 · Cited by 2,134
Tanenbaum, A. S. (1992) · Cited by 1,912
Korth, H. F., & Silberschatz, A. (1980) · Cited by 1,777
Answering queries using views: A survey
Halevy, A. Y. (2001) · The VLDB Journal · doi:10.1007/s007780100054 · Cited by 1,510
(1988) · Computer Science Press, Inc. eBooks · Cited by 1,435
Cited by
Linked Data: Evolving the Web into a Global Data Space
Heath, T., & Bizer, C. (2011) · Synthesis lectures on the semantic web · doi:10.2200/s00334ed1v01y201102wbe001 · Cited by 2,018
TinyDB: an acquisitional query processing system for sensor networks
Madden, S. R., Franklin, M. J., Hellerstein, J. M., & Hong, W. (2005) · ACM Transactions on Database Systems · doi:10.1145/1061318.1061322 · Cited by 1,899
The cougar approach to in-network query processing in sensor networks
Yao, Y., & Gehrke, J. (2002) · ACM SIGMOD Record · doi:10.1145/601858.601861 · Cited by 1,328
PNUTS: Yahoo!'s hosted data serving platform
Cooper, B. F., Ramakrishnan, R., Srivastava, U., Silberstein, A., Bohannon, P., Jacobsen, H.-A., Puz, N., Weaver, D., & Yerneni, R. (2008) · Proceedings of the VLDB Endowment · doi:10.14778/1454159.1454167 · Cited by 958
The design of an acquisitional query processor for sensor networks
Madden, S., Franklin, M. J., Hellerstein, J. M., & Hong, W. (2003) · Proceedings of the 2003 ACM SIGMOD international conference on Management of data · doi:10.1145/872757.872817 · Cited by 927
Yu, Y., Isard, M., Fetterly, D., Budiu, M., Erlingsson, Ú., Gunda, P. K., & Currey, J. (2008) · doi:10.5555/1855741.1855742 · Cited by 689
Query Processing in Sensor Networks
Madden, S., & Gehrke, J. (2004) · Chapman & Hall/CRC Computer & Information Science Series · doi:10.1201/9780203487068.sec6 · Cited by 460
Semantic Overlay Networks for P2P Systems
Crespo, A., & Garcia-Molina, H. (2005) · Lecture Notes in Computer Science · doi:10.1007/11574781_1 · Cited by 429
Network-Aware Operator Placement for Stream-Processing Systems
Pietzuch, P., Ledlie, J., Shneidman, J., Roussopoulos, M., Welsh, M., & Seltzer, M. (2006) · 22nd International Conference on Data Engineering (ICDE'06) · doi:10.1109/icde.2006.105 · Cited by 428
Knowledge communication and translation – a knowledge transfer model
Liyanage, C., Elhag, T., Ballal, T., & Li, Q. (2009) · Journal of Knowledge Management · doi:10.1108/13673270910962914 · Cited by 426
Survey of research towards robust peer-to-peer networks: Search methods
Risson, J., & Moors, T. (2006) · Computer Networks · doi:10.1016/j.comnet.2006.02.001 · Cited by 386
A taxonomy of Data Grids for distributed data sharing, management, and processing
Venugopal, S., Buyya, R., & Ramamohanarao, K. (2006) · ACM Computing Surveys · doi:10.1145/1132952.1132955 · Cited by 351
Low Latency Geo-distributed Data Analytics
Pu, Q., Ananthanarayanan, G., Bodik, P., Kandula, S., Akella, A., Bahl, P., & Stoica, I. (2015) · Proceedings of the 2015 ACM Conference on Special Interest Group on Data Communication · doi:10.1145/2785956.2787505 · Cited by 246
“1) Distributed databases: While big-data frameworks currently operate only within a single cluster, work on distributed databases has been a popular topic [22, 27]; see surveys in [40, 44].”
BackgroundA survey of structured P2P systems for RDF data storage and retrieval
Filali, I., Bongiovanni, F., Huet, F., & Baude, F. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-23074-5_2 · Cited by 19
Metadata
- Authors
- Kossmann, D.
- Venue
- ACM Computing Surveys
- Published
- 2000-12
- Volume
- 32
- Issue
- 4
- Pages
- 422-469
- ISSN
- 0360-0300 (ISSN-L)
- 1557-7341
- OpenAlex
- W2112101330
- Cited by
- 813
- References
- 51
- FWCI
- 32.01
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.