Tracking Join and Self-Join Sizes in Limited Storage

Practical Algorithms for Tracking Database Join Sizes

We present novel algorithms for estimating the size of the natural join of two data streams that have efficient update processing times and provide excellent quality of estimates.

Join Sizes, Frequency Moments, and Applications

On the Estimation of Join Result Sizes

Good estimates of join result sizes are critical for query optimization in relational database management systems. We address the problem of incrementally obtaining accurate and consistent estimates of join result sizes. We have invented a new rule for choosing join selectivities for estimating join result sizes. The rule is part of a new unified algorithm called Algorithm ELS (Equivalence and ...

Streaming Similarity Self-Join

We introduce and study the problem of computing the similarity self-join in a streaming context (sssj), where the input is an unbounded stream of items arriving continuously. The goal is to find all pairs of items in the stream whose similarity is greater than a given threshold. The simplest formulation of the problem requires unbounded memory, and thus, it is intractable. To make the problem f...

Join spaces , soft join spaces and lattices

The aim of this paper is to initiate and investigate new (soft) hyperstructures, particularly (soft) join spaces, using important classes of lattices: modular and distributive. They are used in order to study (soft) hyperstructures constructed on the set of all convex sublattices of a lattice.