Interrogating a Relational Data File

Remarks on the Admissibility of Input Queries

J. L. Kuhns

ResearchPublished 1970

This report continues the work, begun in RM-5428, 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 database 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 consisting 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.

Order a Print Copy

Format
Paperback
Page count
59 pages
List Price
$20.00
Buy link
Add to Cart

Document Details

  • Availability: Available
  • Year: 1970
  • Print Format: Paperback
  • Paperback Pages: 59
  • Paperback Price: $20.00
  • Document Number: R-511-PR

Citation

RAND Style Manual
Kuhns, J. L., Interrogating a Relational Data File: Remarks on the Admissibility of Input Queries, RAND Corporation, R-511-PR, 1970. As of September 20, 2024: https://www.rand.org/pubs/reports/R0511.html
Chicago Manual of Style
Kuhns, J. L., Interrogating a Relational Data File: Remarks on the Admissibility of Input Queries. Santa Monica, CA: RAND Corporation, 1970. https://www.rand.org/pubs/reports/R0511.html. Also available in print form.
BibTeX RIS

This publication is part of the RAND report series. The report series, a product of RAND from 1948 to 1993, represented the principal publication documenting and transmitting RAND's major research findings and final research.

This document and trademark(s) contained herein are protected by law. This representation of RAND intellectual property is provided for noncommercial use only. Unauthorized posting of this publication online is prohibited; linking directly to this product page is encouraged. Permission is required from RAND to reproduce, or reuse in another form, any of its research documents for commercial purposes. For information on reprint and reuse permissions, please visit www.rand.org/pubs/permissions.

RAND is a nonprofit institution that helps improve policy and decisionmaking through research and analysis. RAND's publications do not necessarily reflect the opinions of its research clients and sponsors.