Loading...
Loading...

Go to the content (press return)

Testing termination of query satisfiability checking on expressive database schemas

Author
Rull, G.; Farré, C.; Teniente, E.; Urpi, T.
Type of activity
Report
Date
2010-03-19
Code
ESSI-TR-10-4
Repository
http://hdl.handle.net/2117/6734 Open in new window
Abstract
A query is satisfiable if there is at least one consistent instance of the database in which it has a non-empty answer. Defining queries on a database schema and checking their satisfiability can help the database designer to be sure whether the produced database schema is what was intended. The formulation of such queries may easily require the use of some arithmetic comparisons or negated expressions. Unfortunately, checking the satisfiability of this class of queries on a database schema that...
Group of research
GESSI - Group of Software and Service Engineering
IMP - Information Modelling and Processing
inLab FIB

Participants

Attachments