Download:
|
by Jerome Robinson, Shutian Lin
ftp://ftp.essex.ac.uk/pub/csc/technical-reports/CSM-225.ps.Z
Add To MetaCart
Abstract:
Synchronous chain recursions are a very frequent form of query in deductive database systems. Efficient query-processing is required, and algorithms suitable for parallel processing are needed. This paper generalises the arithmetic method of query answering (by integer arithmetic on path lengths in the query subgraph of the database diagraph) to N-chain recursions.
Citations
|
21
|
Magic counting methods
– Sacca, Zaniolo
- 1987
|
|
7
|
Chain-Split Evaluation in Deductive Databases
– Han
- 1995
|
|
6
|
Optimization of linear logic programs using counting methods
– Greco, Zaniolo
- 1992
|
|
6
|
Asynchronous Chain Recursions
– Han, Lu
- 1989
|
|
6
|
An Introduction to Data Structures with Applications
– Tremblay, Sorenson
- 1976
|
|
5
|
Synchronized Counting Method
– Aly, Ozsoyoglu
- 1989
|
|
5
|
On Compiling Queries
– Henschen, Naqvi
- 1984
|
|
3
|
Compiling General Linear Recursions by Variable Connection Graph Analysis
– Han
- 1989
|
|
3
|
Classification and Compilation of Linear Recursive Queries in Deductive Databases
– Youn, Kim, et al.
- 1992
|
|
3
|
Efficient Recursive Query Processing using Wavefront Methods
– Yu, Zhang
- 1987
|
|
2
|
Arithmetic for Parallel Linear Recursive Query Evaluation in Deductive Databases
– unknown authors
|
|
2
|
An Algorithmic Approach for Handling Cyclic and Non-cyclic Linear Recursive Queries
– Wu
- 1988
|
|
1
|
On the Power of Query-Independent Compilation
– Han
|
|
1
|
A Simple Characterisation of Uniform Boundedness for a Class of Recursions
– Naughton, Sagiv
- 1991
|
|
1
|
An Introduction to the Theory of Numbers", Fifth Ed. Published by Jojn Wiley
– Niven, H
- 1991
|
|
1
|
Answering Linear Recursive Queries in Cyclic Databases
– Wu, Henschen
|
