PRISMA/DB: a parallel, main memory relational DBMS

Apers, Peter M. G.; Berg, C.A. van den; Flokstra, Jan; Grefen, Paul; Kersten, Martin; Wilschut, A.N.

doi:10.1109/69.180605

Cited by 77 publications

(21 citation statements)

References 28 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A dialect of the extended relational algebra presented in this paper has been used as the main database manipulation language (DML) in the PRISMA/DB parallel main-memory database system [2]. This language, called XRA, is described in detail in [ 1 l] and includes a number of constructs not covered by this paper for reasons of brevity, such as operators for range-based data fragmentation and recursively defined expressions, and transaction brackets (begin and commit).…”

Section: The Practice: Prismadbmentioning

confidence: 99%

“…This language, called XRA, is described in detail in [ 1 l] and includes a number of constructs not covered by this paper for reasons of brevity, such as operators for range-based data fragmentation and recursively defined expressions, and transaction brackets (begin and commit). This section describes the use of the algebra-based XRA language in the PRISMA/DB system in short; some issues are covered more extensively in [2]. First, an overview of the use of XRA in PRISMAiDB is given.…”

Section: The Practice: Prismadbmentioning

confidence: 99%

See 1 more Smart Citation

Extending a multi-set relational algebra to a parallel environment

Grefen

Flokstra

1996

Distrib Parallel Databases

View full text Add to dashboard Cite

Parallel database systems will very probably be the future for high-performance data-intensive applications. In the past decade, many parallel database systems have been developed, together with many languages and approaches to specify operations in these systems. A common background is still missing, however. This paper proposes an extended relational algebra for this purpose, based on the well-known standard relational algebra. The extended algebra provides both complete database manipulation language features, and data distribution and process allocation primitives to describe parallelism. It is defined in terms of multi-sets of tuples to allow handling of duplicates and to obtain a close connection to the world of high-performance data processing. Due to its algebraic nature, the language is well suited for optimization and parallelization through expression rewriting. The proposed language can be used as a database manipulation language on its own, as has been done in the PRISMA parallel database project, or as a formal basis for other languages, like SQL.

show abstract

Section: The Practice: Prismadbmentioning

confidence: 99%

Section: The Practice: Prismadbmentioning

confidence: 99%

Extending a multi-set relational algebra to a parallel environment

Grefen

Flokstra

1996

Distrib Parallel Databases

View full text Add to dashboard Cite

show abstract

“…Gupta and Widom, for example, have described several means of improving the accuracy of distributed query processing by exploiting information stored (or cached) locally [4], while others have exploited parallel query evaluation techniques for this purpose [1,5]. However, as we shall show in this paper, it is also possible to reduce inaccuracy by making use of temporal reasoning techniques.…”

Section: Introductionmentioning

confidence: 98%

Increasing the Accuracy of Time-Tabled Condition Monitoring

Jin

Embury

2003

IFIP Advances in Information and Communication Technology

View full text Add to dashboard Cite

Many applications benefit from the ability to monitor the value of conditions over large, possibly distributed data sets. However, mechanisms to achieve this typically impose a performance overhead that the owners and users of such systems may be unwilling to accept. A compromise solution is to allow system owners to decide at what times they will allow computational resources to be given over to condition monitoring and at what times they will not. This allows the system owner to maintain maximum throughput rates during the most important periods of the day or week, while still reaping the benefits of a limited form of condition monitoring. The monitoring is "limited" because the results will contain inaccuracies. However, in some applications, even inaccurate information about conditions will be of value, if it can be provided at minimal cost to the organisation in question. This approach is called non-intrusive condition monitoring.In this paper, we discuss a variety of methods for reducing the inaccuracy of nonintrusive condition monitoring in distributed information systems. The methods employ a range of temporal reasoning techniques, and promise differing degrees of improvement in accuracy. They also each impose different costs on the operation of the system as a whole. We present some experimental results which support our categorisation of the costs and benefits of the proposed methods.

show abstract

“…Finally, architecting single database instances as a sharednothing system has been studied using specialized hardware during the era of parallel database systems, most notably in the Gamma Project [7] and Prisma/DB [2]. Since the number of cores and memory controllers, and thereby the penalties for treating memory uniformly, are bound to increase, we expect shared-nothing to become the dominant architecture even for centralized databases.…”

Section: Related Workmentioning

confidence: 99%

Predictable performance for unpredictable workloads

et al. 2009

View full text Add to dashboard Cite

This paper introduces Crescando: a scalable, distributed relational table implementation designed to perform large numbers of queries and updates with guaranteed access latency and data freshness. To this end, Crescando leverages a number of modern query processing techniques and hardware trends. Specifically, Crescando is based on parallel, collaborative scans in main memory and so-called "querydata" joins known from data-stream processing. While the proposed approach is not always optimal for a given workload, it provides latency and freshness guarantees for all workloads. Thus, Crescando is particularly attractive if the workload is unknown, changing, or involves many different queries. This paper describes the design, algorithms, and implementation of a Crescando storage node, and assesses its performance on modern multi-core hardware.

show abstract

PRISMA/DB: a parallel, main memory relational DBMS

Cited by 77 publications

References 28 publications

Extending a multi-set relational algebra to a parallel environment

Extending a multi-set relational algebra to a parallel environment

Increasing the Accuracy of Time-Tabled Condition Monitoring

Predictable performance for unpredictable workloads

Contact Info

Product

Resources

About