Constraint-based algorithms for computing clique intersection joins
Nikos Mamoulis, Dimitris Papadias · 1998
Spatial joins constitute one of the most active research topics in spatial query processing. This paper deals with the processing of clique intersection joins using R-trees. A clique intersection join will retrieve all n-tuples of objects that pair-wise overlap. The corresponding MBR-based filter step retrieves n-tuples of rectangles that intersect at some common point. Here we modify three algorithms, first proposed in [13], for the specific problem and experimentally evaluate their performance using data sets of various densities. 1.1 Keywords Spatial joins, spatial query processing, multi-way joins