On the complexity of queries in the logical data model

Authors:
G. M. Kuper;M. Y. Vardi
Affiliations:
IBM Watson Research Center;IBM Almaden Research Center
Venue:
Lecture notes in computer science on ICDT '88
Year:
1988

Citing 0
Cited 10

On accessing object-oriented databases: expressive power, complexity, and restrictions

SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
Untyped sets, invention, and computable queries

PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Database theory column

ACM SIGACT News
On the power of rule-based languages with sets

PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Tractable query languages for complex object databases

PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Converting nested algebra expressions into flat algebra expressions

ACM Transactions on Database Systems (TODS)
Database method schemas and object creation

PODS '93 Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The logical data model

ACM Transactions on Database Systems (TODS)
Computing queries with higher-order logics

Theoretical Computer Science - Logic, language, information and computation
The Descriptive Complexity of the Deterministic Exponential Time Hierarchy

Electronic Notes in Theoretical Computer Science (ENTCS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the main features of updates in databases. Recent results on updates are briefly described and used to raise various questions. It is argued that well-accepted query properties like safety and determinism should not be strictly enforced ...