Abstract
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 are 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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Arge, L., Procopiuc, O., Ramaswamy, S., Suel, T., Vahrenhold, J., Vitter, J.S.: A unified approach for indexed and non-indexed spatial joins. In: Zaniolo, C., Grust, T., Scholl, M.H., Lockemann, P.C. (eds.) EDBT 2000. LNCS, vol. 1777, p. 413. Springer, Heidelberg (2000)
Arge, L., Procopiuc, O., Ramaswamy, S., Suel, T., Vitter, J.S.: Scalable sweeping-based spatial join. In: Proc. of VLDB Conference (1998)
Beckmann, N., Kriegel, H.-P., Schneider, R., Seeger, B.: The R*-tree: An efficient and robust access method for points and rectangles. In: Proc. of ACM SIGMOD Int’l Conference (1990)
Beyer, K.S., Ramakrishnan, R.: Bottom-up computation of sparse and iceberg cubes. In: Proc. of ACM SIGMOD Int’l Conference (1999)
Böhm, C., Braunmüller, B., Krebs, F., Kriegel, H.-P.: Epsilon grid order: an algorithm for the similarity join on massive high dimensional data. In: Proc. of ACM SIGMOD Int’l Conference (2001)
Brinkhoff, T., Kriegel, H.-P., Seeger, B.: Efficient processing of spatial joins using R–trees. In: Proc. of ACM SIGMOD Int’l Conference (1993)
Bureau of the Census, TIGER/Line Precensus files: 1990 Technical Documentation (1989)
Corral, A., Manolopoulos, Y., Theodoridis, Y., Vassilakopoulos, M.: Closest pair queries in spatial databases. In: Proc. of ACM SIGMOD Int’l Conference (2000)
Dittrich, J.-P., Seeger, B.: Data redundancy and duplicate detection in spatial join processing. In: Proc. of Int’l Conf. on Data Engineering, ICDE (2000)
Fang, M., Shivakumar, N., Garcia-Molina, H., Motwani, R., Ullman, J.D.: Computing iceberg queries efficiently. In: Proc. of VLDB Conference (1998)
Guttman, A.: R–trees: a dynamical index structure for spatial searching. In: Proc. of ACM SIGMOD Int’l Conference (1984)
Han, J., Pei, J., Dong, G., Wang, K.: Efficient computation of iceberg cubes with complex measures. In: Proc. of ACM SIGMOD Int’l Conference (2001)
Hjaltason, G.R., Samet, H.: Incremental distance join algorithms for spatial databases. In: Proc. of ACM SIGMOD Int’l Conference (1998)
Hjaltason, G.R., Samet, H.: Distance browsing in spatial databases. TODS 24(2), 265–318 (1999)
Huang, Y.-W., Jing, N., Rundensteiner, E.A.: Spatial joins using Rtrees: Breadth-first traversal with global optimizations. In: Proc. of VLDB Conference (1997)
Koudas, N., Sevcik, K.C.: Size separation spatial join. In: Proc. of ACM SIGMOD Int’l Conference (1997)
Koudas, N., Sevcik, K.C.: High dimensional similarity joins: Algorithms and performance evaluation. In: Proc. of Int’l Conf. on Data Engineering, ICDE (1998)
Lo, M.-L., Ravishankar, C.V.: Spatial joins using seeded trees. In: Proc. of ACM SIGMOD Int’l Conference (1994)
Lo, M.-L., Ravishankar, C.V.: Spatial hash-joins. In: Proc. of ACM SIGMOD Int’l Conference (1996)
Luo, G., Naughton, J.F., Ellmann, C.: A non-blocking parallel spatial join algorithm. In: Proc. of Int’l Conf. on Data Engineering, ICDE (2002)
Mamoulis, N., Papadias, D.: Integration of spatial join algorithms for processing multiple inputs. In: Proc. of ACM SIGMOD Int’l Conference (1999)
Papadias, D., Kalnis, P., Zhang, J., Tao, Y.: Efficient OLAP operations in spatial data warehouses. In: Jensen, C.S., Schneider, M., Seeger, B., Tsotras, V.J. (eds.) SSTD 2001. LNCS, vol. 2121, p. 443. Springer, Heidelberg (2001)
Patel, J.M., DeWitt, D.J.: Partition based spatial-merge join. In: Proc. of ACM SIGMOD Int’l Conference (1996)
Penn State University Libraries, Digital Chart of the World (1997), http://www.maproom.psu.edu/dcw/
Shim, K., Srikant, R., Agrawal, R.: High-dimensional similarity joins. In: Proc. of Int’l Conf. on Data Engineering, ICDE (1997)
Shin, H., Moon, B., Lee, S.: Adaptive multi-stage distance join processing. In: Proc. of ACM SIGMOD Int’l Conference (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Shou, Y., Mamoulis, N., Cao, H., Papadias, D., Cheung, D.W. (2003). Evaluation of Iceberg Distance Joins. In: Hadzilacos, T., Manolopoulos, Y., Roddick, J., Theodoridis, Y. (eds) Advances in Spatial and Temporal Databases. SSTD 2003. Lecture Notes in Computer Science, vol 2750. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45072-6_16
Download citation
DOI: https://doi.org/10.1007/978-3-540-45072-6_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40535-1
Online ISBN: 978-3-540-45072-6
eBook Packages: Springer Book Archive