In this paper, the performance and characteristics of the execution of various join-trees on a
parallel DBMS are studied. The results of this study are a step into the direction of the design …

Publisher Summary Join algorithms have been extensively explored in the research
literature, and at many points during the history of community one might have concluded that …

Declarative Networking is a programming methodology that enables developers to concisely
specify network protocols and services, which are directly compiled to a dataflow framework …

Relational query optimizers have traditionally relied upon table cardinalities when
estimating the cost of the query plans they consider. While this approach has been and …

In recent years, a new class of applications has come to the forefront {p-marily due to the
advancement in our ability to collect data from multitudes of devices, and process them e …

We introduce the hash-merge join algorithm (HMJ, for short); a new nonblocking join
algorithm that deals with data items from remote sources via unpredictable, slow, or bursty …

To counter societal and economic problems caused by data silos on the Web, efforts such as
Solid strive to reclaim private data by storing it in permissioned documents over a large …

Publisher Summary This chapter presents a generic technique called progressive merge
join (PMJ) that eliminates the blocking behavior of sort-based join algorithms. The basic idea …

PRISMA/DB, a full-fledged parallel, main memory relational database management system
(DBMS) is described. PRISMA/DB's high performance is obtained by the use of parallelism …

A number of execution strategies for parallel evaluation of multi-join queries have been
proposed in the literature; their performance was evaluated by simulation. In this paper we …