PRISMA database machine: A distributed, main-memory approach

Apers, Peter M. G.; Kersten, Martin; Oerlemans, Hans

doi:10.1007/3-540-19074-0_82

Cited by 19 publications

(3 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This should result in a deeper insight into the use and possible benefit of parallelism. Our work may be used in ordinary distributed databases [29] as well as advanced multiprocessor database machines, such as PI~.ISMA [23,5].…”

Section: )mentioning

confidence: 99%

Complex transitive closure queries on a fragmented graph

Houstsma

Apers²,

Ceri

1990

Icdt '90

Self Cite

View full text Add to dashboard Cite

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 multiproeessor 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.

show abstract

Section: )mentioning

confidence: 99%

Complex transitive closure queries on a fragmented graph

Houstsma

Apers²,

Ceri

1990

Icdt '90

Self Cite

View full text Add to dashboard Cite

show abstract

“…In the PRISMA project we have developed a tightly-coupled, distributed database on a multiprocessor machine [4,29]. And following the observations above, we have implemented two user-interfaces on the system.…”

Section: Introductionmentioning

confidence: 99%

Algebraic optimization of recursive queries

Houtsma

Apers

1992

Data & Knowledge Engineering

View full text Add to dashboard Cite

Over the past few years, much attention has been paid to deductive databases. They offer a logic-based interface, and allow formulation of complex recursive queries. However, they do not offer appropriate update facilities, and do not support existing applications. To overcome these problems an SQL-like interface is required besides a logic-based interface.In the PRISMA project we have developed a tightly-coupled distributed database, on a multiprocessor machine, with two user interfaces: SQL and PRISMAIog. Query optimization is localized in one component: the relational query optimizer. Therefore, we have defined an eXtended Relational Algebra that allows recursive query formulation and can also be used for expressing executable schedules, and we have developed algebraic optimization strategies for recursive queries. In this paper we describe an optimization strategy that rewrites regular (in the context of formal grammars) mutually recursive queries into standard Relational Algebra and transitive closure operations. We also describe how to push selections into the resulting transitive closure operations. The reason we focus on algebraic optimization is that, in our opinion, the new generation of advanced database systems will be built starting from existing state-of-the-art relational technology, instead of building a completely new class of systems.

show abstract

“…And although many systems support parallelism in query execution, they do not yet support fragmentation; only few commercial systems support fragmentation, including Teradata and Tandem [29]. Advanced techniques based on data fragmentation and performance measurements for comparing them have been developed in a few research environments; among them, the Prisma machine, developed at Phitips and several Dutch universities [4,24], the Delta machine, developed at Wisconsin University [14,28], and the Bubba machine, developed at MCC [13].…”

Section: Introductionmentioning

confidence: 99%

An overview of parallel strategies for transitive closure on algebraic machines

Cacace

Ceri

Houstma

1991

Lecture Notes in Computer Science

View full text Add to dashboard Cite

An important feature of database technology of the nineties is the use of distributed computation for speeding up the execution of complex queries. Today, the use of parallelism is 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 multi-processor architectures without shared memory, in order to perform selections and joins in parallel.

show abstract

PRISMA database machine: A distributed, main-memory approach

Cited by 19 publications

References 2 publications

Complex transitive closure queries on a fragmented graph

Complex transitive closure queries on a fragmented graph

Algebraic optimization of recursive queries

An overview of parallel strategies for transitive closure on algebraic machines

Contact Info

Product

Resources

About