Please use this identifier to cite or link to this item:

Evaluation of Iceberg Distance Joins

Authors Shou, Yutao
Mamoulis, Nikos
Cao, Huiping
Papadias, Dimitris
Cheung, David W.
Issue Date 2003
Source Lecture Notes in Computer Science , v. 2750, 2003, p. 270-288
Summary The iceberg distance join returns object pairs within some distance from each other, provided that the first object appears at least a number of times in the result, e.g., "find hotels which axe within 1km to at least 10 restaurants". The output of this query is the subset of the corresponding distance join (e.g., "find hotels which are within 1km to some restaurant") that satisfies the additional cardinality constraint. Therefore, it could be processed by using a conventional spatial join algorithm and then filtering-out the non-qualifying pairs. This approach, however, is expensive, especially when the cardinality constraint is highly selective. In this paper, we propose output-sensitive algorithms that prune the search space by integrating the cardinality with the distance constraint. We deal with cases of indexed/non-indexed datasets and evaluate the performance of the proposed techniques with extensive experimental evaluation covering a wide range of problem parameters.
ISSN 0302-9743
Rights The original publication is available at Please use the appropriate URL and/or DOI for the article.The access script to link to it is:
Language English
Format Article
Access View full-text via DOI
View full-text via Web of Science
View full-text via Scopus
Files in this item:
File Description Size Format
papadias10.pdf 448712 B Adobe PDF