Integrity constraint checking in stratified databases
Open accessIntegrity signals
Registry
Cites
Statistics
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The above method is a refinement of the LST method in that Θ is used not only to simplify integrity constraints at the topmost level but throughout testing to prune non-relevant branches.
“The above method can be seen as a refinement of the LST method [61], in the sense that Θ is not only used to simplify the integrity constraints at the topmost level (i.e. affecting the bodies of integrity constraints), but is used throughout the testing of the integrity constraints to prune non-relevant branches.”
From Creating specialised integrity checks through partial evaluation of meta-interpreters (1998) · cites this paper as [61]
The main difference with the exposition in [63,61] is that the authors calculate pos(U) and neg(U) in one step instead of in two.
“The main difference with the exposition in [63,61] is that we calculate pos(U) and neg(U) in one step instead of in two.”
From Creating specialised integrity checks through partial evaluation of meta-interpreters (1998) · cites this paper as [61]
The LST method not only removes integrity constraints but also instantiates them, possibly generating several specialised integrity constraints for a single unspecialised one.
“However, the LST method [61] not only removes integrity constraints but also instantiates them, possibly generating several specialised integrity constraints for a single unspecialised one.”
From Creating specialised integrity checks through partial evaluation of meta-interpreters (1998) · cites this paper as [61]
For the example database with Db+ = {man(a) ←}, Db− = ∅, the LST method of [61] generates the simplified integrity constraints false ← man(a), woman(a) and false ← parent(a, Y), unmarried(a), independently of the facts in Db=.
“The LST method of [61] will then generate the following simplified integrity constraints:”
From Creating specialised integrity checks through partial evaluation of meta-interpreters (1998) · cites this paper as [61]
The LST techniques [61] often perform very well in practice, even for relational or hierarchical databases [22].
“compare their efficiency with the one of the LST techniques [61], which often performs very well in practice, even for relational or hierarchical databases [22].”
From Creating specialised integrity checks through partial evaluation of meta-interpreters (1998) · cites this paper as [61]
Running LST on a generic update allowed the deduction that the second integrity constraint cannot be violated by the update, while the other integrity constraints remain unchanged.
“So, by running LST on a generic update we were just able to deduce that the second integrity constraint cannot be violated by the update – the other integrity constraints remain unchanged.”
From Creating specialised integrity checks through partial evaluation of meta-interpreters (1998) · cites this paper as [61]
Some existing integrity checking methods, such as the Lloyd-Sonenberg-Topor method [61], are not amenable to specialisation using current techniques.
“We have also argued why some existing integrity checking methods, like, e.g., the Lloyd-Sonenberg-Topor method [61], are not amenable to specialisation using current techniques.”
From Creating specialised integrity checks through partial evaluation of meta-interpreters (1998) · cites this paper as [61]
Even for relational databases with complex views, deductive database approaches such as the LST method [61] seem to be the most competitive ones available.
“However, even for relational databases - with complex views – the deductive database approaches, such as the LST method [61], seem to be the most competitive ones available.”
From Creating specialised integrity checks through partial evaluation of meta-interpreters (1998) · cites this paper as [61]
Compared with an unspecialised implementation of the well known approach by Lloyd et al. [61], the results show that big performance improvements, also reaching and exceeding 2 orders of magnitude, can be obtained.
“We also compared the specialised update procedures with an unspecialised implementation of the well known approach by Lloyd et al. in [61], and the results show that big performance improvements, also reaching and exceeding 2 orders of magnitude, can be obtained.”
From Creating specialised integrity checks through partial evaluation of meta-interpreters (1998) · cites this paper as [61]
Cited by
Sorted by citations
Creating specialised integrity checks through partial evaluation of meta-interpreters
Leuschel, M., & De Schreye, D. (1998) · The Journal of Logic Programming · doi:10.1016/s0743-1066(97)10012-7 · Cited by 29 · see citing works
- Authors
- Lloyd, J. W., Sonenberg, E. A., & Topor, R. W.
- Affiliations
- The University of Melbourne (AU)
- Corresponding author
- Topor, R.W.
- ORCID
- Lloyd, J.W.
- Venue
- The Journal of Logic Programming
- Publisher
- Elsevier BV
- Published
- 1987-12
- Volume
- 4
- Issue
- 4
- Pages
- 331-343
- ISSN
- 0743-1066 (ISSN-L)
- OpenAlex
- W2075950442
- Cited by
- 116
- References
- 0
- Citations by year
- 2025: 1 · 2022: 1 · 2017: 1 · 2016: 2 · 2015: 1 · 2013: 2 · 2012: 1
- FWCI
- 5.69
- Type
- journal article
- Language
- en
- Open access
- bronze
- doi.org
- Licence
- Locations
- The Journal of Logic Programming (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Logic, Reasoning, and Knowledge
- Physical Sciences › Computer Science › Computer Networks and Communications › Advanced Database Systems and Queries
- Physical Sciences › Computer Science › Artificial Intelligence › Logic, programming, and type systems
- Keywords
- integrity constraint checking, constraint simplification, correctness proofs
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