HKUST Library Institutional Repository Banner

HKUST Institutional Repository >
Computer Science and Engineering >
CSE Conference Papers >

Please use this identifier to cite or link to this item:
Title: Constraint-based algorithms for computing clique intersection joins
Authors: Mamoulis, Nikos
Papadias, Dimitris
Keywords: Spatial joins
Spatial query processing
Multi-way joins
Issue Date: 1998
Citation: Proceedings of the 6th ACM-GIS, Washington DC, ACM Press, 1998
Abstract: 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.
Rights: © ACM, 1998. This is the author's version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version was published in Proceedings of the 6th ACM-GIS, Washington DC, ACM Press, 1998
Appears in Collections:CSE Conference Papers

Files in This Item:

File Description SizeFormat
acmgis98.pdf61KbAdobe PDFView/Open

All items in this Repository are protected by copyright, with all rights reserved.