|
Archive@NYU >
Stern School of Business >
IOMS: Information Systems Working Papers >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/2451/14565
|
| Title: | EXTERNAL SEMANTIC QUERY SIMPLIFICATION: A GRAPH-THEORETIC APPROACH AND
ITS IMPLEMENTATION IN PROLOG |
| Authors: | Jarke, Matthias |
| Issue Date: | Jun-1984 |
| Publisher: | Stern School of Business, New York University |
| Series/Report no.: | IS-84-51 |
| Abstract: | Semantic query simplification utilizes integrity constraints enforced in
a database system for reducing the number of tuple variables and terms
in a relational calculus query. To a large degree, this can be done by a
system that is external to the DBMS. The paper advocates the application
of database theory in such a system and describes a working prototype of
an external semantic query simplifier implemented in Prolog. The system
employs a graph-theoretic approach to integrate tableau techniques and
algorithms for the syntactic simplification of queries containing
inequality conditions. The use of integrity constraints is shown not
only to improve efficiency but also to permit more meaningful error
messages to be generated, particularly in the case of an empty query
result. The paper concludes with outlining an extension to the
multi-user case. |
| URI: | http://hdl.handle.net/2451/14565 |
| Appears in Collections: | IOMS: Information Systems Working Papers
|
All items in Faculty Digital Archive are protected by copyright, with all rights reserved.
|
