Implementing deductive databases by linear programming

Colin Bell*, Anil Nerode, Raymond T. Ng, V. S. Subrahmanian

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contribution

19 Scopus citations

Abstract

Logic programs incorporate forms of SLD resolution as the basis for query processing. Existing and past generations of Prolog systems have left deduction to run-time, and this may account for the poor run-time performance of such systems. Our work tries to minimize run-time deduction by shifting the deductive process to compile-time, not run-time. We also propose a query processing system based on linear programming compilation. We discuss how such a system can be supported efficiently at run-time by relational database systems. Then we describe our implemented prototype compiler. Finally, we report experimental results using this compiler.

Original languageEnglish (US)
Title of host publicationProceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems
PublisherPubl by ACM
Pages283-292
Number of pages10
ISBN (Print)0897915194, 9780897915199
DOIs
StatePublished - 1992
Externally publishedYes
EventProceedings of the 11th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems - San Diego, CA, USA
Duration: Jun 2 1992Jun 4 1992

Publication series

NameProceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems

Conference

ConferenceProceedings of the 11th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems
CitySan Diego, CA, USA
Period6/2/926/4/92

ASJC Scopus subject areas

  • Software
  • Information Systems
  • Hardware and Architecture

Fingerprint

Dive into the research topics of 'Implementing deductive databases by linear programming'. Together they form a unique fingerprint.

Cite this