The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
Query processing in a system for distributed databases (SDD-1)
Abstract
This paper describes the techniques used to optimize relational queries in the SDD-1 distributed database system. Queries are submitted to SDD-1 in a high-level procedural language called Datalanguage. Optimization begins by translating each Datalanguage query into a relational calculus form called an envelope , which is essentially an aggregate-free QUEL query. This paper is primarily concerned with the optimization of envelopes. Envelopes are processed in two phases. The first phase executes relational operations at various sites of the distributed database in order to delimit a subset of the database that contains all data relevant to the envelope. This subset is called a reduction of the database. The second phase transmits the reduction to one designated site, and the query is executed locally at that site. The critical optimization problem is to perform the reduction phase efficiently. Success depends on designing a good repertoire of operators to use during this phase, and an effective algorithm for deciding which of these operators to use in processing a given envelope against a given database. The principal reduction operator that we employ is called a semijoin . In this paper we define the semijoin operator, explain why semijoin is an effective reduction operator, and present an algorithm that constructs a cost-effective program of semijoins, given an envelope and a database.
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
Introduction to Database Systems
(2006) · Foundations of Database Design · doi:10.1201/9781420003345.ch1 · Cited by 3,521
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
An introduction to database systems
Shneiderman, B. (1976) · Information Processing & Management · doi:10.1016/0306-4573(76)90015-7 · Cited by 1,024
Using Semi-Joins to Solve Relational Queries
Bernstein, P. A., & Chiu, D.-M. W. (1981) · Journal of the ACM · doi:10.1145/322234.322238 · Cited by 464
Self-citationProperties of a Model for Parallel Computations: Determinacy, Termination, Queueing
Karp, R. M., & Miller, R. E. (1966) · SIAM Journal on Applied Mathematics · doi:10.1137/0114108 · Cited by 421
Decomposition—a strategy for query processing
Wong, E., & Youssefi, K. (1976) · ACM Transactions on Database Systems · doi:10.1145/320473.320479 · Cited by 387
Self-citationImplementing a relational database by means of specialzed hardware
Babb, E. (1979) · ACM Transactions on Database Systems · doi:10.1145/320064.320065 · Cited by 254
Introduction to a system for distributed databases (SDD-1)
Rothnie, J. B., Bernstein, P. A., Fox, S., Goodman, N., Hammer, M., Landers, T. A., Reeve, C., Shipman, D. W., & Wong, E. (1980) · ACM Transactions on Database Systems · doi:10.1145/320128.320129 · Cited by 249
Self-citationConcurrency control in a system for distributed databases (SDD-1)
Bernstein, P. A., Shipman, D. W., & Rothnie, J. B. (1980) · ACM Transactions on Database Systems · doi:10.1145/320128.320131 · Cited by 227
Self-citationBernstein, P. A., & Goodman, N. (1981) · SIAM Journal on Computing · doi:10.1137/0210059 · Cited by 226
Self-citationDistributed query processing in a relational data base system
Epstein, R. S., Stonebraker, M. R., & Wong, E. (1978) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/509252.509292 · Cited by 213
Self-citationQuery Processing in Distributed Database System
Hevner, A. R., & Yao, S. B. (1979) · IEEE Transactions on Software Engineering · doi:10.1109/tse.1979.234179 · Cited by 212
Reliability mechanisms for SDD-1: a system for distributed databases
Hammer, M. M., & Shipman, D. W. (1980) · ACM Transactions on Database Systems · doi:10.1145/320610.320621 · Cited by 128
An algorithm for tree-query membership of a distributed query
Yu, C., & Özsoyoğlu, M. (2005) · IEEE Annual International Computer Software and Applications Conference (COMPSAC) · doi:10.1109/cmpsac.1979.762509 · Cited by 112
Performance evaluation of a relational associative processor
Ozkarahan, E. A., Schuster, S. A., & Sevcik, K. C. (1977) · ACM Transactions on Database Systems · doi:10.1145/320544.320553 · Cited by 94
Query optimization in star computer networks
Kerschberg, L., Ting, P. D., & Yao, S. B. (1982) · ACM Transactions on Database Systems · doi:10.1145/319758.319778 · Cited by 57
Cited by
Query evaluation techniques for large databases
Graefe, G. (1993) · ACM Computing Surveys · doi:10.1145/152610.152611 · Cited by 1,262
Concurrency Control in Distributed Database Systems
Bernstein, P. A., & Goodman, N. (1981) · ACM Computing Surveys · doi:10.1145/356842.356846 · Cited by 1,186
Self-citationPegasus, a workflow management system for science automation
Deelman, E., Vahi, K., Juve, G., Rynge, M., Callaghan, S., Maechling, P. J., Mayani, R., Chen, W., Ferreira da Silva, R., Livny, M., et al. (2015) · Future Generation Computer Systems · doi:10.1016/j.future.2014.10.008 · Cited by 861
“This well-known, DAG based declarative approach has been used extensively to represent computations from single processor systems, to multi-CPU and multi-core systems, and databases [9] [10] [11] [12] [13] [14].”
MethodThe state of the art in distributed query processing
Kossmann, D. (2000) · ACM Computing Surveys · doi:10.1145/371578.371598 · Cited by 813
Vertical partitioning algorithms for database design
Navathe, S., Ceri, S., Wiederhold, G., & Dou, J. (1984) · ACM Transactions on Database Systems · doi:10.1145/1994.2209 · Cited by 420
Metadata
- Authors
- Bernstein, P. A., Goodman, N., Wong, E., Reeve, C. L., & Rothnie, J. B.
- Venue
- ACM Transactions on Database Systems
- Published
- 1981-12
- Volume
- 6
- Issue
- 4
- Pages
- 602-625
- ISSN
- 0362-5915 (ISSN-L)
- 1557-4644
- OpenAlex
- W2023195086
- Cited by
- 493
- References
- 16
- FWCI
- 25.49
- 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.