In multiprocessor shared-nothing database machines, the storage organization for a relation is independent of the strategy used to partition the relation. A database administrator for such a system has a wide range of alternatives when creating a relation. In this paper, we analyze the impact of three alternative partitioning strategies on the selection queries using different storage/access structures in a multiuser environment. We quantify the tradeoffs of each organization in the context of the Gamma database machine. The response time and throughput of the system are used as the performance metric for evaluating the alternative partitioning strategies
Today's computer applications have ever-increasing database system capabilities and performance. The...
Parallelism is key to high performance relational database systems. Since there are several parallel...
While several distributed (or �shared nothing�) database machines exist in the form of prototypes or...
We present a data partitioning technique for shared-nothing database systems. A unique feature of ou...
Abstract. Complex and data-intensive database queries mandate parallel processing strategies to achi...
Deciding on which data store to use is one of the most important aspects of every project. Besides t...
We investigate various load balancing approaches for hash-based join techniques popular in multicomp...
This paper describes an approach to performance estimation for shared-nothing parallel database syst...
We investigate various load balancing approaches for hash-based join techniques popular in multicomp...
Exploiting parallelism has become the key to building high-performance database systems. Several a...
In this paper we briefly present the design of a distributed relational data base system. Then, we d...
Many data sets follow certain distribution patterns, such as uniform distribution, normal distributi...
Dynamic load balancing is a prerequisite for effectively utilizing large parallel database systems. ...
The globally integrated contemporary business environment has prompted new challenges to database ar...
Due to their better price/performance ratios and scalability, Shared-Nothing computer systems are be...
Today's computer applications have ever-increasing database system capabilities and performance. The...
Parallelism is key to high performance relational database systems. Since there are several parallel...
While several distributed (or �shared nothing�) database machines exist in the form of prototypes or...
We present a data partitioning technique for shared-nothing database systems. A unique feature of ou...
Abstract. Complex and data-intensive database queries mandate parallel processing strategies to achi...
Deciding on which data store to use is one of the most important aspects of every project. Besides t...
We investigate various load balancing approaches for hash-based join techniques popular in multicomp...
This paper describes an approach to performance estimation for shared-nothing parallel database syst...
We investigate various load balancing approaches for hash-based join techniques popular in multicomp...
Exploiting parallelism has become the key to building high-performance database systems. Several a...
In this paper we briefly present the design of a distributed relational data base system. Then, we d...
Many data sets follow certain distribution patterns, such as uniform distribution, normal distributi...
Dynamic load balancing is a prerequisite for effectively utilizing large parallel database systems. ...
The globally integrated contemporary business environment has prompted new challenges to database ar...
Due to their better price/performance ratios and scalability, Shared-Nothing computer systems are be...
Today's computer applications have ever-increasing database system capabilities and performance. The...
Parallelism is key to high performance relational database systems. Since there are several parallel...
While several distributed (or �shared nothing�) database machines exist in the form of prototypes or...