|
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/14579
|
| Title: | RANGE NESTING: A FAST METHOD TO EVALUATE QUANTIFIED QUERIES |
| Authors: | Jarke, Matthias
Koch, Jurgen |
| Issue Date: | Dec-1982 |
| Publisher: | Stern School of Business, New York University |
| Series/Report no.: | IS-83-25 |
| Abstract: | Database queries explicitly containing existential and universal
quantification become increasingly important in a number of areas such
as integrity checking, interaction of databases, and statistical
databases. Using a concept of range nesting in relational calculus
expressions, the paper describes evaluation algorithms and
transformation methods for an important class of quantified relational
calculus queries called perfect expressions. This class includes
well-known classes of "easy" queries such as tree queries
(with free and existentially quantified variables only), and complacent
(disconnected) queries. |
| URI: | http://hdl.handle.net/2451/14579 |
| Appears in Collections: | IOMS: Information Systems Working Papers
|
All items in Faculty Digital Archive are protected by copyright, with all rights reserved.
|
