TY - GEN
T1 - Object-based query evaluation scheme for deductive databases in massively parallel computing environment
AU - Lee, Won S.
AU - Sheu, Phillip C.
PY - 1989
Y1 - 1989
N2 - An algorithm is introduced to evaluate queries in a massively parallel computing environment under an object-based representation of a database. By distributing facts into connected networks of processing elements, it is shown that parallel execution of a query can be achieved in a cooperative way, so that the conventional tuple-by-tuple evaluation can be avoided. Furthermore, it is shown that dependency imposed by shared variables is not a major problem in achieving AND parallelism any longer. Although only a single query is considered here, the evaluation scheme can be extended to multiple queries with multiple query networks and with replication of counters in the fact network.
AB - An algorithm is introduced to evaluate queries in a massively parallel computing environment under an object-based representation of a database. By distributing facts into connected networks of processing elements, it is shown that parallel execution of a query can be achieved in a cooperative way, so that the conventional tuple-by-tuple evaluation can be avoided. Furthermore, it is shown that dependency imposed by shared variables is not a major problem in achieving AND parallelism any longer. Although only a single query is considered here, the evaluation scheme can be extended to multiple queries with multiple query networks and with replication of counters in the fact network.
UR - http://www.scopus.com/inward/record.url?scp=0024860160&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0024860160&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:0024860160
SN - 0818619155
T3 - Proc Fifth Int Conf Data Eng
SP - 497
EP - 504
BT - Proc Fifth Int Conf Data Eng
A2 - Anon, null
PB - Publ by IEEE
T2 - Proceedings: Fifth International Conference on Data Engineering
Y2 - 6 February 1989 through 10 February 1989
ER -