The Alexander Method - a technique for the processing of recursive axioms in deductive databases
type: Item
instance of: scholarly article
title: The Alexander Method - a technique for the processing of recursive axioms in deductive databases
zbMATH Open document ID: 0615.68062
DOI: 10.1007/BF03037407
author: R. Lescoeur
author: Jeremy Rohmer
author: Jean-Marc Kerisit
published in: New Generation Computing
publication date: 1986-01-01T00:00:00Z
review text: We propose a technique for handling recursive axioms in deductive databases. More precisely, we solve the following problem: Given a relational query including virtual relations defined from axioms (Horn clauses, with variables in the conclusion predefined in the hypotheses), which can be recursive, how to translate this query into a relational program, i.e. a set of relational operations concerning only real relations (not virtual). Our solution has the following properties: (1) the program to evaluate the query always terminates, (2) the relational program is produced by a pure compilation of a source query and of the axioms, and is independent of the data values (there is no run-time), (3) the relational operations are optimized: they focus towards the computation of the query, without needless computations. As far as we know, the Alexander Method is the first solution exhibiting all these properties.
Mathematics Subject Classification ID: 68T15
Mathematics Subject Classification ID: 68P20
zbMATH DE Number: 3997191
zbMATH Keywords: saturation
zbMATH Keywords: recursive axioms
zbMATH Keywords: deductive databases
zbMATH Keywords: relational query
zbMATH Keywords: virtual relations
zbMATH Keywords: Horn clauses
zbMATH Keywords: relational program
Wikidata QID: Q114693233
MaRDI profile type: Publication
cites work: Q4199578
full work available at URL: https://doi.org/10.1007/bf03037407
OpenAlex ID: W2036240164
description: scientific article; zbMATH DE number 3997191