Thc spatial join is a cuminon spalid query typc that requires n high processing cost due lo thc largc volume of spatial detil and the computntion-iiitcnsivc spatial opcrntions [ I , 12, 13, 141. A spalial join consists in testing cvcry two possible pairs of objects hdoinging to two spatia? daln sets against n spalial predicatc [ 1 I ] . This prcdicnte might be flveriiip, cross, wilhiit distaric...

We study how the existence in an algebraic lattice L of a chain of a given type is reflected in the join-semilattice K(L) of its compact elements. We show that for every chain α of size κ, there is a set B of at most 2 join-semilattices, each one having a least element such that an algebraic lattice L contains no chain of order type I(α) if and only if the join-semilattice K(L) of its compact e...

Traditionally, disjunction is taken to express an operator that takes two propositions A and B, and yields their join, A∪B. In more recent work, however, it has been argued that disjunction should rather be treated as generating a set of propositions, {A,B}. Each of the two approaches has certain vantage points that the other one lacks. Thus, it would be desirable to reconcile the two, combinin...

In a real life environment, spatial data is highly skewed. In general, there are two kinds of skews in spatial data. One is the placement skew and the other is the area skew. This paper introduces methods and the complexity of estimating the result sizes of the multi-way join for the area skewed spatial data. Especially, this paper describes the number and sort of the statistics which the optim...

2 This book is dedicated to my wife without whom this work could have been finished much earlier. • If anything can go wrong, it will. • If you change queues, the one you have left will start to move faster than the one you are in now. • Your queue always goes the slowest. • Whatever queue you join, no matter how short it looks, it will always take the longest for you to get served.

In the first section the lattice of subsets of distinct set is introduced. The join and meet operations are, respectively, union and intersection of sets, and the ordering relation is inclusion. It is shown that this lattice is Boolean, i.e. distributive and complimentary. The socond section introduced the poset generated in a distinct lattice by its ordering relation. Besides, it is proved tha...

summary by Dani ele Gardy]

A non-equijoin of relations R and S is a band join if the join predicate requires values in the join attribute of R to fall within a specified band about the values in the join attribute of S. This paper describes a new algorithm, termed a truncating-hash band join, for evaluating band joins. This algorithm is based on the idea of truncating join attribute values in order to ezecute band joins ...

The similarity join has become an important database primitive to support similarity search and data mining. A similarity join combines two sets of complex objects such that the result contains all pairs of similar objects. Well-known are two types of the similarity join, the distance range join where the user defines a distance threshold for the join, and the closest point query or k-distance ...

Based on the renowned method of Bitton et al. (see [1]) we develop a concise but comprehensive analytical model for the well-known Binary Merge Sort, Bitonic Sort, Nested-Loop Join and Sort Merge Join algorithm in a Grid Environment. We concentrate on a limited number of characteristic parameters to keep the analytical model clear and focused. Based on these results the paper proves that by sma...