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.
CITATION STYLE
Revesz, P. Z. (1998). Safe Query Languages for Constraint Databases. ACM Transactions on Database Systems, 23(1), 58–99. https://doi.org/10.1145/288086.288088
Mendeley helps you to discover research relevant for your work.