The lattice of the set partitions of [n] ordered by refinement is studied. Suppose r partitions p1, . . . , pr are chosen independently and uniformly at random. The probability tha...
This paper presents an innovative partitionbased time join strategy for temporal databases where time is represented by time intervals. The proposed method maps time intervals to ...
Partitioning is an important step in several database algorithms, including sorting, aggregation, and joins. Partitioning is also fundamental for dividing work into equal-sized (o...
The similarity join is an important database primitive which has been successfully applied to speed up applications such as similarity search, data analysis and data mining. The s...
The Partitioned Based Spatial-Merge Join (PBSM) of Patel and DeWitt and the Size Separation Spatial Join (S3 J) of Koudas and Sevcik are considered to be among the most efficient ...