Journal ArticleDOI
Parallel database systems: open problems and new issues
Reads0
Chats0
TLDR
It is still an open issue to decide which of the various architectures among shared-memory, shared-disk, and shared-nothing, is best for database management under various conditions.Abstract:
Parallel database systems attempt to exploit recent multiprocessor computer architectures in order to build high-performance and high-availability database servers at a much lower price than equivalent mainframe computers. Although there are commercial SQL-based products, a number of open problems hamper the full exploitation of the capabilities of parallel systems. These problems touch on issues ranging from those of parallel processing to distributed database management. Furthermore, it is still an open issue to decide which of the various architectures among shared-memory, shared-disk, and shared-nothing, is best for database management under various conditions. Finally, there are new issues raised by the introduction of higher functionality such as knowledge-based or object-oriented capabilities within a parallel database system.read more
Citations
More filters
Journal ArticleDOI
Distributed and parallel database systems
M. Tamer Özsu,Patrick Valduriez +1 more
TL;DR: The maturation of database management system (DBMS) technology has coincided with significant developments in distributed computing and parallel processing technologies as discussed by the authors, and the end result is the development of distributed database management systems and parallel DBMS that are now the dominant data management tools for highly data-intensive applications.
Proceedings Article
Parallel Query Scheduling and Optimization with Time- and Space-Shared Resources
TL;DR: This work develops a general approach to the problem of scheduling distributed multi-dimensional resource units for all kinds of parallelism within and across queries and operators, and presents heuristic algorithms for various forms of the problem.
Proceedings Article
Dynamic Multi-Resource Load Balancing in Parallel Database Systems
Erhard Rahm,Robert Marek +1 more
TL;DR: This work discusses basic performance tradeoffs to consider and evalGate the performauce of several oad balancing strategies by means of a detailed simulation model and shows that the two subproblems should be addressed in au integrated way.
Proceedings Article
Dynamic Load Balancing in Hierarchical Parallel Database Systems
TL;DR: A dynamic execution model that maximizes local load balancing within shared-memory nodes and minimizes the need for load sharing across nodes is proposed, obtained by allowing each processor to execute any operator that can be processed locally, thereby taking full advantage of inter- and intra-operator parallelism.
Proceedings Article
Optimization Algorithms for Exploiting the Parallelism-Communication Tradeoff in Pipelined Parallelism
Waqar Hasan,Rajeev Motwani +1 more
TL;DR: This work addresses the problem of finding parallel plans for SQL queries using the two-phase approach of join ordering followed by parallelization, and develops fast algorithms that produce near-optimal schedules.
References
More filters
Journal ArticleDOI
A case for redundant arrays of inexpensive disks (RAID)
TL;DR: Five levels of RAIDs are introduced, giving their relative cost/performance, and a comparison to an IBM 3380 and a Fujitsu Super Eagle is compared.
Journal ArticleDOI
Parallel database systems: the future of high performance database systems
David J. DeWitt,Jim Gray +1 more
Journal ArticleDOI
Multiple-query optimization
TL;DR: The results show that using multiple- query processing algorithms may reduce execution cost considerably, and the presentation and analysis of algorithms that can be used for multiple-query optimization are presented.
Journal ArticleDOI
An amateur's introduction to recursive query processing strategies
TL;DR: In this article, the authors present a survey and comparison of various strategies for processing logic queries in relational databases, focusing on Horn Clauses with evaluable predicates but without function symbols.
Journal ArticleDOI
The Gamma database machine project
David J. DeWitt,Shahram Ghandeharizadeh,Donovan A. Schneider,A. Bricker,H.-I. Hsiao,R. Rasmussen +5 more
TL;DR: Gamma as mentioned in this paper is a relational database machine running on an Intel iPSC/2 hypercube with 32 processors and 32 disk drives, where all relations are horizontally partitioned across multiple disk drives enabling relations to be scanned in parallel.