Loading...
Loading...

Go to the content (press return)

Computing explanations for unlively queries in databases

Author
Rull, G.; Farré, C.; Teniente, E.; Urpi, T.
Type of activity
Report
Date
2007-06
Code
LSI-07-23-R
Repository
http://hdl.handle.net/2117/86232 Open in new window
Abstract
A query is lively in a database schema if it returns a non-empty answer for some database satisfying the schema. Debugging a database schema requires not only determining queries (as well as views or tables) that are not lively, but also fixing them. To make that task easier it is required to provide the designer with some explanation of why a query is not lively. To the best of our knowledge, the existing methods for liveliness checking in databases do not provide such explanations. An explanat...
Citation
Rull, G., Farré, C., Teniente, E., Urpí, T. "Computing explanations for unlively queries in databases". 2007.
Keywords
Database schema validation, Existing methods, Query liveliness
Group of research
GESSI - Group of Software and Service Engineering
IMP - Information Modelling and Processing
inLab FIB

Participants

Attachments