Efficient join algorithms have been developed for processing different types of non-equijoins like spatial join, band join, temporal join or similarity join. Each of these previously proposed join algorithms is tailor-cut for a specific type of join, and a generalization of these algorithms to other join types is not obvious. We present an efficient algorithm called bulk index join that can be ...

Join points are the composition points where aspects are composed with the base system. In other words they are target hooks in the base system where aspect’s implementation is weaved in. Join points are not defined separately in aspect-oriented design rather a pointcut model is designed which consists of related join points. Grouping of related join points in a pointcut depends on designer’s i...

Suppose $X$ is a simple graph. The $X-$join $Gamma$ of a set ofcomplete or empty graphs ${X_x }_{x in V(X)}$ is a simple graph with the following vertex and edge sets:begin{eqnarray*}V(Gamma) &=& {(x,y) | x in V(X) & y inV(X_x) },\ E(Gamma) &=& {(x,y)(x^prime,y^prime) | xx^prime in E(X) or else x = x^prime & yy^prime in E(X_x)}.end{eqnarray*}The $X-$join graph $Gamma$ is said to be re...

Spatial operations such as spatial join combine two objects on spatial predicates. It is different from relational join because objects have multi dimensions and spatial join consumes large execution time. Recently, many researches tried to find methods to improve the execution time. Parallel spatial join is one method to improve the execution time. Comparison between objects can be done in par...

This paper presents a solution to the problem of how to eeciently process queries which include join operations in the nested relational model. We focus on the join operation, and introduce a new join operator called P-join. The P-join operator merges two scheme trees. It combines the advantages of the extended natural join and recursive join for eecient data access. The algebraic expression of...

Rank join operators perform a relational join among two or more relations, assign numeric scores to the join results based on the given scoring function and return K join results with the highest scores. The top-K join results are obtained by accessing a subset of data from the input relations. This paper addresses the problem of getting topK join results from two or more search services which ...

By leveraging modern networking hardware (RDMA-enabled network cards), we can shift priorities in distributed database processing significantly. Complex and sophisticated mechanisms to avoid network traffic can be replaced by a scheme that takes advantage of the bandwidth and low latency offered by such interconnects. We illustrate this phenomenon with cyclo-join, an efficient join algorithm ba...

Efficient spatial query processing is very important since the applications of the spatial DBMS (e.g. GIS, CAD/CAM, LBS) handle massive amount of data and consume much time. Many spatial queries contain the multi-way spatial join due to the fact that they compute the relationships (e.g. intersect) among the spatial data. Thus, accurate estimation of the spatial join selectivity is essential to ...

Join is an operation that is frequently used and the most expensive in processing database queries. In this paper we propose a new efficient join algorithm(called the MLGFJoin) for relations indexed by the tnul~ilevrl grirlfile(MLGF), a multidimensional dynamic hashed file organization. The MLGF-Join uses the domain space partition maintained in the directory of the MLGF. The MLGF-Join can proc...

In this paper, a novel multi join algorithm to join multiple relations will be introduced. The novel algorithm is based on a hashed-based join algorithm of two relations to produce a double index. This is done by scanning the two relations once. But instead of moving the records into buckets, a double index will be built. This will eliminate the collision that can happen from a complete hash al...