A survey of parallel execution strategies for transitive closure and logic programs

DMCA

A survey of parallel execution strategies for transitive closure and logic programs (1993)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Filippo Cacace , Stefano Ceri , Maurice Houtsma

Venue:	DISTRIBUTED AND PARALLEL DATABASES
Citations:	24 - 6 self

BibTeX

@ARTICLE{Cacace93asurvey,
    author = {Filippo Cacace and Stefano Ceri and Maurice Houtsma},
    title = {A survey of parallel execution strategies for transitive closure and logic programs},
    journal = {DISTRIBUTED AND PARALLEL DATABASES},
    year = {1993},
    volume = {1},
    pages = {337--382}
}

OpenURL

Abstract

An important feature of database technology of the nineties is the use of parallelism for speeding up the execution of complex queries. This technology is being tested in several experimental database architectures and a few commercial systems for conventional select-project-join queries. In particular, hash-based fragmentation is used to distribute data to disks under the control of different processors in order to perform selections and joins in parallel. With the development of new query languages, and in particular with the definition of transitive closure queries and of more general logic programming queries, the new dimension of recursion has been added to query processing. Recursive queries are complex; at the same time, their regular structure is particularly suited for parallel execution, and parallelism may give a high efficiency gain. We survey the approaches to parallel execution of recursive queries that have been presented in the recent literature. We observe that research on parallel execution of recursive queries is separated into two distinct subareas, one focused on the transitive closure of Relational Algebra expressions, the other one focused on optimization of more general Datalog queries. Though the subareas seem radically different because of the approach and formalism used, they have many common features. This is not surprising, because most typical Datalog queries can be solved by means of the transitive closure of simple

Keyphrases

transitive closure recursive query parallel execution strategy logic program parallel execution several experimental database architecture complex query high efficiency gain typical datalog query recent literature distinct subareas general datalog query hash-based fragmentation regular structure database technology conventional select-project-join query commercial system new query language transitive closure query new dimension different processor important feature relational algebra expression general logic programming query many common feature

DMCA