Due to advances in computer technology, many organizations have a large number of workstation-class machines connected by LAN. Such a network of workstations (NOW) can be used for parallel processing, including database query processing. This paper proposes a new load sharing algorithm for hash join processing on NOWs. This new algorithm combines a chunking method with hash join to manage dynam...

DEFINITION Spatial join operation is used to combine two or more datasets with respect to a spatial predicate. The predicate can be a combination of directional, distance, and topological spatial relations. In the case of nonspatial joins, the joining attributes must be of the same type, but for spatial joins they can be of different types. Usually each spatial attribute is represented by its m...

Database query processing traditionally relies on three alternative join algorithms: index nested loops join exploits an index on its inner input, merge join exploits sorted inputs, and hash join exploits differences in the sizes of the join inputs. Cost-based query optimization chooses the most appropriate algorithm for each query and for each operation. Unfortunately , mistaken algorithm choi...

i.p.s. hypergroups are canonical hypergroups such that$[forall(a,x),a+xni x]longrightarrow[a+x=x].$i.p.s. hypergroups were investigated in [1], [2], [3], [4] and it was proved thatif the order is less than 9, they are strongly canonical (see [13]). in this paperwe obtain the sequences of fuzzy sets and of join spaces determined (see [8])by all i.p.s. hypergroups of order seven. for the meaning ...