Minimization in Cooperative Response to Failing Database Queries (1997)
Cached
Download Links
- [www.cs.umd.edu]
- [www.cs.yorku.ca]
- [ftp.cs.umd.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | International Journal of Cooperative Information Systems |
| Citations: | 38 - 4 self |
BibTeX
@ARTICLE{Godfrey97minimizationin,
author = {Parke Godfrey},
title = {Minimization in Cooperative Response to Failing Database Queries},
journal = {International Journal of Cooperative Information Systems},
year = {1997},
volume = {6},
pages = {95--149}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
When a query fails, it is more cooperative to identify the cause of failure, rather than just to report the empty answer set. If there is not a cause for the query's failure, it is worthwhile to report the part of the query which failed. To identify a minimal failing subquery (MFS) of the query is the best way to do this. (This MFS is not unique; there may be many of them.) Likewise, to identify a maximal succeeding subquery (MSS) can help a user to recast a new query that leads to a non-empty answer set. Database systems do not provide the functionality of these types of cooperative responses. This may be, in part, because algorithmic approaches to finding the MFSs and the MSSs to a failing query are not obvious. The search space of subqueries is large. Despite work on MFSs in the past, the algorithmic complexity of these identification problems had remained uncharted. This paper shows the complexity profile of MFS and MSS identification. It is shown that there exists a simple algorit...
