Database management systems will continue to manage large data volumes. Thus, efficient
algorithms for accessing and manipulating large sets and sequences will be required to …

The join operation is one of the fundamental relational database query operations. It
facilitates the retrieval of information from two different relations based on a Cartesian …

The latest techniques and principles of parallel and grid database processing The growth in
grid databases, coupled with the utility of parallel query processing, presents an important …

Principles of database query processing for advanced applications | Guide books skip to main
content ACM Digital Library home ACM corporate logo Google, Inc. (search) Advanced Search …

Shared nothing multiprocessor archit. ecture is known to be more scalable to support very
large databases. Compared to other join strategies, a hash-ba9ed join algorithm is …

Data placement in shared-nothing database systems has been studied extensively in the
past and various placement algorithms have been proposed. However, there is no …

The rate of increase in database size and response-time requirements has outpaced
advancements in processor and mass storage technology. One way to satisfy the increasing …

Providing the ability to elastically use more or fewer servers on demand (scale out and scale
in) as the load varies is essential for database management systems (DBMSes) deployed on …

In distributed database systems, tables are frequently fragmented and replicated over a
number of sites in order to reduce network communication costs. How to fragment, when to …

Intra-operator (or partitioned) parallelism is a well-established mechanism for achieving high
performance in parallel database systems. However, the problem of how to exploit …