In this paper we study the reformulation of transitive closure queries on a fragmented graph. We split a query into several subqueries, each requiring only a fragment of the graph. We prove this reformulation to be correct for shortest path and bill of material queries. Here we describe the reformulation for an abstract graph, elsewhere we have described an actual implementation of our approach and some promising simulation results. We view the study of distributed computation of transitive closure queries as a result of the trend towards distributed computation. First selections were distributed to fragments of a relation, then fragmentation was used to compute joins in a distributed way, and now we are studying distributed computation of transitive closure queries. This should result in a deeper insight into the use and possible benefit of parallelism. Our work may be used in ordinary distributed databases as well as advanced multiprocessor database machines, such as PRISMA. Although this research was started to efficiently use distributed computation, it turns out to be beneficiary in a central environment as well. This is due to the introduction of extra selections, stemming from an appropriate fragmentation. This leads to extra focus on relevant data.
|Title of host publication||ICDT '90: Third International Conference on Database Theory Paris, France, December 12–14, 1990 : proceedings|
|Editors||Serge Abiteboul, Paris C. Kanellakis|
|Place of Publication||Berlin|
|Number of pages||15|
|Publication status||Published - 12 Dec 1990|
|Name||Lecture notes in computer science|
Houtsma, M. A. W., Houtsma, M. A. W., Apers, P. M. G., & Ceri, S. (1990). Complex transitive closure queries on a fragmented graph. In S. Abiteboul, & P. C. Kanellakis (Eds.), ICDT '90: Third International Conference on Database Theory Paris, France, December 12–14, 1990 : proceedings (pp. 470-484). (Lecture notes in computer science; Vol. 470). Berlin: Springer. https://doi.org/10.1007/3-540-53507-1_96