A problem-oriented inferential database system
- 1 August 1986
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Database Systems
- Vol. 11 (3), 323-356
- https://doi.org/10.1145/6314.6419
Abstract
Recently developed inferential database systems face some common problems: a very fast growth of search space and difficulties in recognizing inference termination (especially for recursive axioms). These shortcomings stem mainly from the fact that the inference process is usually separated from database operations. A problem-oriented inferential system i8 described which refers to the database prior to query (or subquery) processing, so that the inference from the very beginning is directed by data relevant to the query. A multiprocessor implementation of the system is presented based on a computer network conforming to database relations and axioms. The system provides an efficient indication of query termination, and is complete in the sense that it produces all correct answers to a query in a finite time.Keywords
This publication has 23 references indexed in Scilit:
- On compiling queries in recursive first-order databasesJournal of the ACM, 1984
- Operational characteristics of a harware-based pattern matcherACM Transactions on Database Systems, 1983
- Bidirectional Heuristic Search AgainJournal of the ACM, 1983
- On Evaluation of Queries Containing Derived Relations in a Relational Data BasePublished by Springer Nature ,1981
- Data Base ComputersPublished by Elsevier ,1980
- Communicating sequential processesCommunications of the ACM, 1978
- DEDUCE 2: Further Investigations of Deduction in Relational Data BasesPublished by Springer Nature ,1978
- An Overview and Introduction to Logic and Data BasesPublished by Springer Nature ,1978
- A relational model of data for large shared data banksCommunications of the ACM, 1970
- On sentences which are true of direct unions of algebrasThe Journal of Symbolic Logic, 1951