ON COMPILING QUERIES IN RECURSIVE FIRST-ORDER DATABASES.

Lawrence J. Henschen; Shamim A. Naqvi

doi:10.1145/2422.2423

ON COMPILING QUERIES IN RECURSIVE FIRST-ORDER DATABASES.

Lawrence J. Henschen^*, Shamim A. Naqvi

^*Corresponding author for this work

Computer Science

Research output: Contribution to journal › Article › peer-review

87 Scopus citations

Abstract

A first-order database is defined as a function-free first-order theory in which the ground units serve as the extensional database and the proper nonlogical axioms serve as the intensional database. The following problem is addressed: Given a recursive nonlogical axiom and the form of a potential query, can one describe a set of database retrieval requests that gives the correct answers and is guaranteed to terminate. The solution uses resolution-proof techniques over connection graphs to derive a program of relational database operations that gives all the answers to a query and has a well-defined termination condition.

Original language	English (US)
Pages (from-to)	47-85
Number of pages	39
Journal	Journal of the ACM
Volume	31
Issue number	1
DOIs	https://doi.org/10.1145/2422.2423
State	Published - Jan 1 1983

ASJC Scopus subject areas

Software
Control and Systems Engineering
Information Systems
Hardware and Architecture
Artificial Intelligence

Access to Document

10.1145/2422.2423

Cite this

@article{54020ce8ff99479097dff9bf466d5e27,

title = "ON COMPILING QUERIES IN RECURSIVE FIRST-ORDER DATABASES.",

abstract = "A first-order database is defined as a function-free first-order theory in which the ground units serve as the extensional database and the proper nonlogical axioms serve as the intensional database. The following problem is addressed: Given a recursive nonlogical axiom and the form of a potential query, can one describe a set of database retrieval requests that gives the correct answers and is guaranteed to terminate. The solution uses resolution-proof techniques over connection graphs to derive a program of relational database operations that gives all the answers to a query and has a well-defined termination condition.",

author = "Henschen, {Lawrence J.} and Naqvi, {Shamim A.}",

year = "1983",

month = jan,

day = "1",

doi = "10.1145/2422.2423",

language = "English (US)",

volume = "31",

pages = "47--85",

journal = "Journal of the ACM",

issn = "0004-5411",

publisher = "Association for Computing Machinery (ACM)",

number = "1",

}

TY - JOUR

T1 - ON COMPILING QUERIES IN RECURSIVE FIRST-ORDER DATABASES.

AU - Henschen, Lawrence J.

AU - Naqvi, Shamim A.

PY - 1983/1/1

Y1 - 1983/1/1

N2 - A first-order database is defined as a function-free first-order theory in which the ground units serve as the extensional database and the proper nonlogical axioms serve as the intensional database. The following problem is addressed: Given a recursive nonlogical axiom and the form of a potential query, can one describe a set of database retrieval requests that gives the correct answers and is guaranteed to terminate. The solution uses resolution-proof techniques over connection graphs to derive a program of relational database operations that gives all the answers to a query and has a well-defined termination condition.

AB - A first-order database is defined as a function-free first-order theory in which the ground units serve as the extensional database and the proper nonlogical axioms serve as the intensional database. The following problem is addressed: Given a recursive nonlogical axiom and the form of a potential query, can one describe a set of database retrieval requests that gives the correct answers and is guaranteed to terminate. The solution uses resolution-proof techniques over connection graphs to derive a program of relational database operations that gives all the answers to a query and has a well-defined termination condition.

UR - http://www.scopus.com/inward/record.url?scp=0020843353&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0020843353&partnerID=8YFLogxK

U2 - 10.1145/2422.2423

DO - 10.1145/2422.2423

M3 - Article

AN - SCOPUS:84976859018

SN - 0004-5411

VL - 31

SP - 47

EP - 85

JO - Journal of the ACM

JF - Journal of the ACM

IS - 1

ER -

ON COMPILING QUERIES IN RECURSIVE FIRST-ORDER DATABASES.

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this