The Alexander Method - a technique for the processing of recursive axioms in deductive databases (Q1820593): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
(4 intermediate revisions by 3 users not shown) | |||
Property / author | |||
Property / author: Jeremy Rohmer / rank | |||
Property / author | |||
Property / author: Jean-Marc Kerisit / rank | |||
Property / author | |||
Property / author: Jeremy Rohmer / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Jean-Marc Kerisit / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4199578 / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/bf03037407 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2036240164 / rank | |||
Normal rank |
Latest revision as of 10:31, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The Alexander Method - a technique for the processing of recursive axioms in deductive databases |
scientific article |
Statements
The Alexander Method - a technique for the processing of recursive axioms in deductive databases (English)
0 references
1986
0 references
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.
0 references
saturation
0 references
recursive axioms
0 references
deductive databases
0 references
relational query
0 references
virtual relations
0 references
Horn clauses
0 references
relational program
0 references