Safe query languages for constraint databases
Open Access
- 1 March 1998
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Database Systems
- Vol. 23 (1) , 58-99
Abstract
In the database framework of Kanellakis et al. [1990] it was argued that constraint query languages should take constraint databases as input and give other constraint databases that use the same type of atomic constraints as output. This closed-form requirement has been difficult to realize in constraint query languages that contain the negation symbol. This paper describes a general approach to restricting constraint query languages with negation to safe subsets that contain only programs that are evaluable in closed-form on any valid constraint database input.Keywords
This publication has 32 references indexed in Scilit:
- Safe stratified Datalog with integer order does not have syntaxACM Transactions on Database Systems, 1998
- Constraint Query LanguagesJournal of Computer and System Sciences, 1995
- Handling Infinite Temporal DataJournal of Computer and System Sciences, 1995
- Algebraic and calculus query languages for recursively typed complex objectsJournal of Computer and System Sciences, 1993
- A closed-form evaluation for Datalog queries with integer (gap)-order constraintsTheoretical Computer Science, 1993
- Finite representation of infinite query answersACM Transactions on Database Systems, 1993
- Logic programming with setsJournal of Computer and System Sciences, 1990
- Constraint logic programming languagesCommunications of the ACM, 1990
- Structure and complexity of relational queriesJournal of Computer and System Sciences, 1982
- The Semantics of Predicate Logic as a Programming LanguageJournal of the ACM, 1976