Interrogating a Relational Data File: Remarks on the Admissibility of Input Queries

Item

Title
Interrogating a Relational Data File: Remarks on the Admissibility of Input Queries
Creator
Kuhns, J. L.
Date
1970
Identifier
AD0721671
AD0721671
Abstract
The report continues the work, of developing and implementing a theory of data retrieval for a computerized question-answering system in which the queries are represented as formulas of the predicate calculus and the data base consists of atomic sentences. Algorithms for processing queries involving a full vocabulary of binary operators are given. It is shown that definite formulas having at most two levels of operators from certain minimal operator sets can always be transformed into proper formulas (i.e., formulas consiting entirely of definite subformulas) and algorithms for these 'admissibility' transformations are given. In addition to the conventional operators, a new form of universal quantification is proposed for query systems. Rules for evaluation are given, and it is shown that the class of definite formulas is closed under this new 'generalized universal quantification.' Finally, theoretical limitations on methods of determining propriety through admissibility transformations are discussed.
Date Issued
1970-11
Extent
47
Corporate Author
RAND Corporation
Corporate Report Number
R-511-PR
Contract
F44620-67-C-0045
DoD Project
Project RAND
Distribution Conflict
No
Access Rights
THIS DOCUMENT HAS BEEN APPROVED FOR PUBLIC RELEASE AND SALE; ITS DISTRIBUTION IS UNLIMITED.
Photo Quality
Not Needed
Distribution Classification
1
Special Scanning Requirements
Foldout page
DTIC Record Exists
Yes
Report Availability
Full text available by request
Type
report
Format
47 pages ; 28 cm.

Export