Abstract
The query evaluation in a deductive database system requires not only a number of deductive laws to be processed but also a large volume of facts to be matched. To achieve more parallelism embedded in the logical representation of deductive databases, this paper proposes a parallel execution method that expands an AND-OR query tree with a breadth-first strategy. In order to cope with the recursive invocation of a query, the AND/OR tree is expanded in an incremental way. As a result, the two major operations, fact-matching and law-expanding, of the query evaluation can be performed separately. Compared with other approaches to parallelize the query evaluation process, the proposed method eliminates the producer-consumer dependency among shared variables and provides a convenient way to collect all alternative answers by the late binding of the variables in a query.
| Original language | English |
|---|---|
| Pages (from-to) | 89-99 |
| Number of pages | 11 |
| Journal | Unknown Journal |
| Volume | 22 |
| Issue number | 2 |
| DOIs | |
| Publication status | Published - 2000 Jan 1 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Software
- Hardware and Architecture
- Computer Science Applications
- Computer Graphics and Computer-Aided Design
Cite this
}
Parallel evaluation of a deductive query with a breadth-first search strategy. / Oh, Sang H.; Lee, Won Suk.
In: Unknown Journal, Vol. 22, No. 2, 01.01.2000, p. 89-99.Research output: Contribution to journal › Article
TY - JOUR
T1 - Parallel evaluation of a deductive query with a breadth-first search strategy
AU - Oh, Sang H.
AU - Lee, Won Suk
PY - 2000/1/1
Y1 - 2000/1/1
N2 - The query evaluation in a deductive database system requires not only a number of deductive laws to be processed but also a large volume of facts to be matched. To achieve more parallelism embedded in the logical representation of deductive databases, this paper proposes a parallel execution method that expands an AND-OR query tree with a breadth-first strategy. In order to cope with the recursive invocation of a query, the AND/OR tree is expanded in an incremental way. As a result, the two major operations, fact-matching and law-expanding, of the query evaluation can be performed separately. Compared with other approaches to parallelize the query evaluation process, the proposed method eliminates the producer-consumer dependency among shared variables and provides a convenient way to collect all alternative answers by the late binding of the variables in a query.
AB - The query evaluation in a deductive database system requires not only a number of deductive laws to be processed but also a large volume of facts to be matched. To achieve more parallelism embedded in the logical representation of deductive databases, this paper proposes a parallel execution method that expands an AND-OR query tree with a breadth-first strategy. In order to cope with the recursive invocation of a query, the AND/OR tree is expanded in an incremental way. As a result, the two major operations, fact-matching and law-expanding, of the query evaluation can be performed separately. Compared with other approaches to parallelize the query evaluation process, the proposed method eliminates the producer-consumer dependency among shared variables and provides a convenient way to collect all alternative answers by the late binding of the variables in a query.
UR - http://www.scopus.com/inward/record.url?scp=0034476244&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0034476244&partnerID=8YFLogxK
U2 - 10.1080/1206212X.2000.11441605
DO - 10.1080/1206212X.2000.11441605
M3 - Article
AN - SCOPUS:0034476244
VL - 22
SP - 89
EP - 99
JO - Review of Economic Dynamics
JF - Review of Economic Dynamics
SN - 1094-2025
IS - 2
ER -