The DOI matches its Crossref record; 37 of the 37 references it cites were found in a registry or an index.
The temporal query language TQuel
Abstract
Recently, attention has been focused on temporal databases , representing an enterprise over time. We have developed a new language, Tquel , to query a temporal database. TQuel was designed to be a minimal extension, both syntactically and semantically, of Quel, the query language in the Ingres relational database management system. This paper discusses the language informally, then provides a tuple relational calculus semantics for the TQuel statements that differ from their Quel counterparts, including the modification statements. The three additional temporal constructs defined in Tquel are shown to be direct semantic analogues of Quel's where clause and target list. We also discuss reducibility of the semantics to Quel's semantics when applied to a static database. TQuel is compared with ten other query languages supporting time.
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 · cited 2×
“b (3+4) ] (Ba)(3b)(S)(A(a) A B(b) A C(c) A u[l] = a[l] A u[2] = b[l] A u[3] = c[l] A u[4] = Last(a[3], b[3]) A u[5] = First(a[4], b[4]) A Before(u[4], u[5]) A u[6] = 12346 A u[7] = 0 Aa[2]=b[2]Ab[2]=c[2] A UWore(h~(aM, bPl), cL31) V JWore(cWl, at31)) A Before(1009, a[6]) A Before(a[5], 1019) A Before(1009, b[6]) A Bef…”
A relational model of data for large shared data banks
Codd, E. F. (1970) · Communications of the ACM · doi:10.1145/362384.362685 · Cited by 5,547
Proceedings of the International Joint Conference on Artificial Intelligence 2007
Bundy, A. (2007) · International Joint Conference on Artificial Intelligence · Cited by 2,761
Towards a general theory of action and time
Allen, J. F. (1984) · Artificial Intelligence · doi:10.1016/0004-3702(84)90008-0 · Cited by 2,559
The Proper Treatment of Quantification in Ordinary English
Montague, R. (1973) · Approaches to Natural Language · doi:10.1007/978-94-010-2506-5_10 · Cited by 2,069
Extending the database relational model to capture more meaning
Codd, E. F. (1979) · ACM Transactions on Database Systems · doi:10.1145/320107.320109 · Cited by 1,559
The design and implementation of INGRES
Stonebraker, M., Held, G., Wong, E., & Kreps, P. (1976) · ACM Transactions on Database Systems · doi:10.1145/320473.320476 · Cited by 886
Database description with SDM: a semantic database model
Hammer, M., & Mc Leod, D. (1981) · ACM Transactions on Database Systems · doi:10.1145/319587.319588 · Cited by 753
(1968) · PMLA/Publications of the Modern Language Association of America · doi:10.1632/s0030812900035720 · Cited by 590
A Temporal Logic for Reasoning about Processes and Plans*
McDermott, D. (1982) · Cognitive Science · doi:10.1207/s15516709cog0602_1 · Cited by 493
Rescher, N., & Urquhart, A. (1971) · LEP Library of Exact Philosophy · doi:10.1007/978-3-7091-7664-1 · Cited by 394
On optimizing an SQL-like nested query
Kim, W. (1982) · ACM Transactions on Database Systems · doi:10.1145/319732.319745 · Cited by 393
Snodgrass, & Ahn, L. (1986) · Computer · doi:10.1109/mc.1986.1663327 · Cited by 371
Making smalltalk a database system
Copeland, G. P., & Maier, D. (1984) · Proceedings - ACM-SIGMOD International Conference on Management of Data · doi:10.1145/602259.602300 · Cited by 366
An interval-based representation of temporal knowledge
Allen, J. F. (1981) · Cited by 357
Equivalence of Relational Algebra and Relational Calculus Query Languages Having Aggregate Functions
Klug, A. (1982) · Journal of the ACM · doi:10.1145/322326.322332 · Cited by 319
The Natural Philosophy of Time
Whitrow, G. J. (1962) · CERN Document Server (European Organization for Nuclear Research) · Cited by 275
Formal semantics for time in databases
Clifford, J., & Warren, D. S. (1983) · ACM Transactions on Database Systems · doi:10.1145/319983.319986 · Cited by 225
Human Factors Studies of Database Query Languages: A Survey and Assessment
Reisner, P. (1981) · ACM Computing Surveys · doi:10.1145/356835.356837 · Cited by 210
On an algebra for historical relational databases: two views
Clifford, J., & Tansel, A. U. (1985) · Proceedings of the 1985 ACM SIGMOD international conference on Management of data · doi:10.1145/318898.318922 · Cited by 181
A temporally oriented data model
Ariav, G. (1986) · ACM Transactions on Database Systems · doi:10.1145/7239.7350 · Cited by 178
A system for reasoning about time
Vilain, M. (1982) · National Conference on Artificial Intelligence · Cited by 166
The historical relational data model (HRDM) and algebra based on lifespans
Clifford, J., & Croker, A. (1987) · Proceedings - International Conference on Data Engineering · doi:10.1109/icde.1987.7272420 · Cited by 159
Mechanizing temporal knowledge
Kahn, K., & Gorry, G. A. (1977) · Artificial Intelligence · doi:10.1016/0004-3702(77)90015-7 · Cited by 155
Adding time dimension to relational model and extending relational algebra
Tansel, A. U. (1986) · Information Systems · doi:10.1016/0306-4379(86)90014-1 · Cited by 132
Designing DBMS support for the temporal dimension
Lum, V. Y., Dadam, P., Erbe, R., Guenauer, J., Pistor, P., Walch, G., Werner, H.-D., & Woodfill, J. (1984) · Proceedings - ACM-SIGMOD International Conference on Management of Data · doi:10.1145/602259.602276 · Cited by 123
Vm: representing time-dependent relations in a medical setting
Fagan, L. M. (1980) · Cited by 111
Temporal aspects of logical procedure definition
Sernadas, A. (1980) · Information Systems · doi:10.1016/0306-4379(80)90009-5 · Cited by 101
Information Modeling in the Context of System Development.
Bubenko, J. A. (1980) · IFIP Congress · Cited by 91
Snodgrass, R., & Ahn, I. (1985) · ACM SIGMOD Record · doi:10.1145/971699.318921 · Cited by 75
Self-citationKim, W. B. (1979) · ACM Computing Surveys · doi:10.1145/356778.356780 · Cited by 72
LEGOL 2.0: A relational specification language for complex rules
Jones, S. E., Mason, P., & Stamper, R. K. (1979) · Information Systems · doi:10.1016/0306-4379(79)90023-1 · Cited by 71
The temporal query language TQuel
Snodgrass, R. T. (1984) · ACM SIGACT-SIGMOD Symposium on Principles of Database Systems (PODS) · doi:10.1145/588011.588041 · Cited by 58
Self-citationGadia, S. K. (1985) · ACM SIGACT-SIGMOD Symposium on Principles of Database Systems (PODS) · doi:10.1145/6012.15406 · Cited by 37
Inheritance and persistence in database programming languages
Buneman, P., & Atkinson, M. (1986) · ACM SIGMOD Record · doi:10.1145/16856.16858 · Cited by 37
Implementation of a time expert in a data base system
Overmyer, R., & Stonebraker, M. R. (1982) · ACM SIGMOD Record · doi:10.1145/984505.984509 · Cited by 23
A control structure for time dependent reasoning
Long, W. J., & Russ, T. A. (1983) · International Joint Conference on Artificial Intelligence · Cited by 18
Cited by
Telos: representing knowledge about information systems
Mylopoulos, J., Borgida, A., Jarke, M., & Koubarakis, M. (1990) · ACM Transactions on Information Systems · doi:10.1145/102675.102676 · Cited by 786
Modeling and querying moving objects
Prasad Sistla, A., Wolfson, O., Chamberlain, S., & Dao, S. (2002) · Proceedings 13th International Conference on Data Engineering · doi:10.1109/icde.1997.581973 · Cited by 605
Synchronization and storage models for multimedia objects
Little, T. D. C., & Ghafoor, A. (1990) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.53017 · Cited by 532
Continuous queries over append-only databases
Terry, D., Goldberg, D., Nichols, D., & Oki, B. (1992) · Proceedings of the 1992 ACM SIGMOD international conference on Management of data · doi:10.1145/130283.130333 · Cited by 399
Spatial SQL: a query and presentation language
Egenhofer, M. J. (1994) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.273029 · Cited by 378
Metadata
- Authors
- Snodgrass, R.
- Venue
- ACM Transactions on Database Systems
- Published
- 1987-06
- Volume
- 12
- Issue
- 2
- Pages
- 247-298
- ISSN
- 0362-5915 (ISSN-L)
- 1557-4644
- OpenAlex
- W2067481201
- Cited by
- 607
- References
- 37
- FWCI
- 28.41
- 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.