Efficient checking of temporal integrity constraints using bounded history encoding
Open accessThe DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Abstract
We present an efficient implementation method for temporal integrity constraints formulated in Past Temporal Logic. Although the constraints can refer to past states of the database, their checking does not require that the entire database history be stored. Instead, every database state is extended with auxiliary relations that contain the historical information necessary for checking constraints. Auxiliary relations can be implemented as materialized relational views.
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
Maintaining knowledge about temporal intervals
Allen, J. F. (1983) · Communications of the ACM · doi:10.1145/182.358434 · Cited by 7,593
Towards a Theory of Declarative Knowledge
Apt, K. R., Blair, H. A., & Walker, A. (1988) · Foundations of Deductive Databases and Logic Programming · doi:10.1016/b978-0-934613-40-8.50006-3 · Cited by 1,151
Deriving Production Rules for Incremental View Maintenance
Ceri, S., & Widom, J. (1999) · Materialized Views · doi:10.7551/mitpress/4472.003.0035 · Cited by 330 · cited 1×
“If triggers are supported by the DBMS, they can be used to maintain the materialized views [Ceri and Widom 1991].”
Method
Cited by
Boselli, R., Cesarini, M., Mercorio, F., & Mezzanzanica, M. (2014) · Proceedings of the International Conference on Automated Planning and Scheduling · doi:10.1609/icaps.v24i1.13667 · Cited by 24
“As argued by Chomicki (1995), FDs are expressive enough to model static constraints, which evaluate the current state of the database, but they do not take into account how the the database state has evolved over time.”
Background
Metadata
- Authors
- Chomicki, J.
- Venue
- ACM Transactions on Database Systems
- Published
- 1995-06
- Volume
- 20
- Issue
- 2
- Pages
- 149-186
- ISSN
- 0362-5915 (ISSN-L)
- 1557-4644
- OpenAlex
- W2025315843
- Cited by
- 190
- References
- 3
- FWCI
- 9.65
- 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: Efficient checking of temporal integrity constraints using bounded history encoding. https://app.cochat.ai/papers/10.1145/210197.210200
- The paper
- Chomicki, J. (1995). Efficient checking of temporal integrity constraints using bounded history encoding. ACM Transactions on Database Systems. https://doi.org/10.1145/210197.210200
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.