A Fork-Join program is one that consist of k ≥ 1 parallel tasks, which is a reasonable model for a large number of computing applications. When the parallel processor have multi-channels, later arrived tasks may finish executions earlier than the early arrived tasks and may join with the finished tasks from different programs. This phenomenon introduce correlation to tasks service times and is ...

Join has always been one of the most expensive queries to carry out in terms of the amount of time to process. This paper introduces a novel multi join algorithm to join multiple relations. The novel algorithm is based on a hashed-based join of two relations to produce a double index. This is done by scanning the two relations once. Instead of moving the records into buckets, a double index is ...

Sorting and join are the heart of most database operations. For main memory databases, the two operations are memory bounded not CPU. Especially the common step in both of them, record retrieval, causes a lot of random memory accesses. We present a new algorithm for fast record retrieval, distributeprobe-gather, or DPG. DPG is a cache conscious two pass algorithm for the main memory record retr...

String similarity join is widely used in many fields, e.g. data cleaning, web search, pattern recognition and DNA sequence matching. During the recent years, many similarity join methods have been proposed, for example Pass-Join, Ed-Join, Trie-Join, and so on, among which the Pass-Join algorithm based on edit distance can achieve much better overall performance than the others. But Pass-Join ca...

Microsoft SQL Server was successful for many years for transaction processing and decision support workloads with neither merge join nor hash join, relying entirely on nested loops and index nested loops join. How much difference do additional join algorithms really make, and how much system performance do they actually add? In a pure OLTP workload that requires only record-to-record navigation...

Within the last several years, a number of parallel algorithms for the join operation have been proposed. However, almost all of the algorithms did not take advantages of the underlying parallel storage structures or data declustering methods of the operand relations. This paper introduces the concept of parallel storage structure or declustering aware parallel join algorithm. A parallel B+-tre...

A vector instruction set is a well known method for exposing bandwidth to applications. Although extensively studied in the scientific programming community, less work exists on vectorizing other kinds of applications. This work examines vectorizing a traditional database operation, a Grace hash-join. We how to vectorize both the hash and join phases of the algorithm, and present performance re...

This paper introduced a method for producing immediate and result in multi-join query, in homogeneous and heterogeneous environment. In recent years Adaptive or Non Blocking join algorithms have attracted a lot of attention in streaming applications, where data is provided from autonomous data sources in heterogeneous network environments. This algorithms are better as compared to traditional a...

In this paper we study the signed Roman dominationnumber of the join of graphs. Specially, we determine it for thejoin of cycles, wheels, fans and friendship graphs.

In global computing applications the availability of a mechanism for some form of committed choice can be useful, and sometimes necessary. It can conveniently handle, e.g., contract stipulation, distributed agreements, and negotiations with nested choice points to be carried out concurrently. We propose a linguistic extension of the Join calculus for programming nested commits, called Committed...