ACM DL

Database Systems (TODS)

Menu

Search Issue
enter search term and/or author name

Archive


ACM Transactions on Database Systems (TODS), Volume 20 Issue 2, June 1995

Incremental computation of nested relational query expressions
Lars Baekgaard, Leo Mark
Pages: 111-148
DOI: 10.1145/210197.210198
Efficient algorithms for incrementally computing nested query expressions do not exist. Nested query expressions are query expressions in which selection/join predicates contain subqueries. In order to respond to this problem, we propose a...

Efficient checking of temporal integrity constraints using bounded history encoding
Jan Chomicki
Pages: 149-186
DOI: 10.1145/210197.210200
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...

Fast algorithms for universal quantification in large databases
Goetz Graefe, Richard L. Cole
Pages: 187-236
DOI: 10.1145/210197.210202
Universal quantification is not supported directly in most database systems despite the fact that it adds significant power to a system's query processing and inference capabilities, in particular for the analysis of many-to-many relationships...