The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Implementation of logical query languages for databases
Open accessAbstract
We examine methods of implementing queries about relational databases in the case where these queries are expressed in first-order logic as a collection of Horn clauses. Because queries may be defined recursively, straightforward methods of query evaluation do not always work, and a variety of strategies have been proposed to handle subsets of recursive queries. We express such query evaluation techniques as “capture rules” on a graph representing clauses and predicates. One essential property of capture rules is that they can be applied independently, thus providing a clean interface for query-evaluation systems that use several different strategies in different situations. Another is that there be an efficient test for the applicability of a given rule. We define basic capture rules corresponding to application of operators from relational algebra, a top-down capture rule corresponding to “backward chaining,” that is, repeated resolution of goals, a bottom-up rule, corresponding to “forward chaining,” where we attempt to deduce all true facts in a given class, and a “sideways” rule that allows us to pass results from one goal to another.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Depth-First Search and Linear Graph Algorithms
Tarjan, R. (1972) · SIAM Journal on Computing · doi:10.1137/0201010 · Cited by 6,081
Principles of Artificial Intelligence
Nilsson, N. J. (1982) · doi:10.1007/978-3-662-09438-9 · Cited by 3,457 · cited 1×
“not variables, and A(x, x) cannot unify with A(l, 2). See [ 12 ], for example, for a discussion of”
BackgroundClark, K. L. (1978) · Logic and Data Bases · doi:10.1007/978-1-4684-3384-5_11 · Cited by 2,000
The Semantics of Predicate Logic as a Programming Language
Van Emden, M. H., & Kowalski, R. A. (1976) · Journal of the ACM · doi:10.1145/321978.321991 · Cited by 1,449
Reiter, R. (1978) · Logic and Data Bases · doi:10.1007/978-1-4684-3384-5_3 · Cited by 990
Gallaire, H., & Minker, J. (1978) · Medical Entomology and Zoology · Cited by 559
A Proof Procedure Using Connection Graphs
Kowalski, R. (1975) · Journal of the ACM · doi:10.1145/321906.321919 · Cited by 251
A Search Technique for Clause Interconnectivity Graphs
Sickel (1976) · IEEE Transactions on Computers · doi:10.1109/tc.1976.1674701 · Cited by 83
Cited by
Sellis, T. K. (1988) · ACM Transactions on Database Systems · doi:10.1145/42201.42203 · Cited by 809
What you always wanted to know about Datalog (and never dared to ask)
Ceri, S., Gottlob, G., & Tanca, L. (1989) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.43410 · Cited by 700
Finding Regular Simple Paths in Graph Databases
Mendelzon, A. O., & Wood, P. T. (1995) · SIAM Journal on Computing · doi:10.1137/s009753979122370x · Cited by 399
XSB as an efficient deductive database engine
Sagonas, K., Swift, T., & Warren, D. S. (1994) · Proceedings of the 1994 ACM SIGMOD international conference on Management of data · doi:10.1145/191839.191927 · Cited by 321
Traversing Knowledge Graphs in Vector Space
Guu, K., Miller, J., & Liang, P. (2015) · Proceedings of the 2015 Conference on Empirical Methods in Natural Language Processing · doi:10.18653/v1/d15-1038 · Cited by 319
Metadata
- Authors
- Ullman, J. D.
- Venue
- ACM Transactions on Database Systems
- Published
- 1985-09
- Volume
- 10
- Issue
- 3
- Pages
- 289-321
- ISSN
- 0362-5915 (ISSN-L)
- 1557-4644
- OpenAlex
- W2027276583
- Cited by
- 373
- References
- 8
- FWCI
- 62.60
- Type
- journal article
- Language
- en
- Open access
- bronze
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Implementation of logical query languages for databases. https://app.cochat.ai/papers/10.1145/3979.3980
- The paper
- Ullman, J. D. (1985). Implementation of logical query languages for databases. ACM Transactions on Database Systems. https://doi.org/10.1145/3979.3980
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.