Skip to main content
Log in

Spatial query processing for fuzzy objects

  • Regular Paper
  • Published:
The VLDB Journal Aims and scope Submit manuscript

Abstract

Range and nearest neighbor queries are the most common types of spatial queries, which have been investigated extensively in the last decades due to its broad range of applications. In this paper, we study this problem in the context of fuzzy objects that have indeterministic boundaries. Fuzzy objects play an important role in many areas, such as biomedical image databases and GIS communities. Existing research on fuzzy objects mainly focuses on modeling basic fuzzy object types and operations, leaving the processing of more advanced queries largely untouched. In this paper, we propose two new kinds of spatial queries for fuzzy objects, namely single threshold query and continuous threshold query, to determine the query results which qualify at a certain probability threshold and within a probability interval, respectively. For efficient single threshold query processing, we optimize the classical R-tree-based search algorithm by deriving more accurate approximations for the distance function between fuzzy objects and the query object. To enhance the performance of continuous threshold queries, effective pruning rules are developed to reduce the search space and speed up the candidate refinement process. The efficiency of our proposed algorithms as well as the optimization techniques is verified with an extensive set of experiments using both synthetic and real datasets.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Achtert, E., Bohm, C., Kroger, P., Kunath, P., Pryakhin, A., Renz, M.: Efficient reverse k-nearest neighbor search in arbitrary metric spaces. In: Proceedings of SIGMOD, pp. 515–526 (2006)

  2. Agarwal P., Edelsbrunner H., Schwarzkopf O., Welzl E.: Euclidean minimum spanning trees and bichromatic closest pairs. Discret. Comput. Geom. 6(1), 407–422 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  3. Altman D.: Fuzzy set theoretic approaches for handling imprecision in spatial analysis. Int. J. Geogr. Inf. Sci. 8(3), 271–289 (1994)

    Article  Google Scholar 

  4. Andrew A.M.: Another efficient algorithm for convex hulls in two dimensions. Inf. Process. Lett. 9, 216–219 (1979)

    Article  MATH  Google Scholar 

  5. Badel A., Mornon J., Hazout S.: Searching for geometric molecular shape complementarity using bidimensional surface profiles. J. Mol. Graph. 10(4), 205–211 (1992)

    Article  Google Scholar 

  6. Beckmann N., Kriegel H., Schneider R., Seeger B.: The R*s-tree: an efficient and robust access method for points and rectangles. ACM Sigmod Rec. 19(2), 322–331 (1990)

    Article  Google Scholar 

  7. Benetis, R., Jensen, C., Simonas, G.: Nearest neighbor and reverse nearest neighbor queries for moving objects. In: Proceedings of IDEAS, pp. 44–53 (2002)

  8. Berchtold, S., Keim, D., Kriegel, H.: The x-tree: An index structure for high-dimensional data. In: Proceedings of VLDB (1996)

  9. Bloch I.: On fuzzy distances and their use in image processing under imprecision. Pattern Recogn. 32(11), 1873–1895 (1999)

    Article  Google Scholar 

  10. Chaudhuri B., Rosenfeld A.: On a metric distance between fuzzy sets. Pattern Recogn. Lett. 17(11), 1157–1160 (1996)

    Article  Google Scholar 

  11. Cheng, R., Kalashnikov, D., Prabhakar, S.: Evaluating probabilistic queries over imprecise data. In: Proceedings of SIGMOD, pp. 551–562 (2003)

  12. Cormen, T., Leiserson, C., Rivest, R., Stein, C.: Introduction to algorithms. The MIT Press (2001)

  13. Corral A., Manolopoulos Y., Theodoridis Y., Vassilakopoulos M.: Closest pair queries in spatial databases. SIGMOD Rec. 29(2), 189–200 (2000)

    Article  Google Scholar 

  14. Dietzfelbinger M., Hagerup T., Katajainen J., Penttonen M.: A reliable randomized algorithm for the closest-pair problem. J. Algorithms 25(1), 19–51 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  15. Dilo A., Rolf A., Stein A.: A system of types and operators for handling vague spatial objects. Int. J. Geogr. Inf. Sci. 21(4), 397–426 (2007)

    Article  Google Scholar 

  16. Fagin, R., Kumar, R., Sivakumar, D.: Comparing top k lists. In: ACM-SIAM Symposium on Discrete algorithms, pp. 28–36 (2003)

  17. Guttman A.: R-trees: a dynamic index structure for spatial searching. ACM Sigmod Rec. 14(2), 47–57 (1984)

    Article  Google Scholar 

  18. Hinrichs K., Nievergelt J., Schorn P.: Plane-sweep solves the closest pair problem elegantly. Inf. Process. Lett. 26(5), 255–261 (1988)

    Article  MathSciNet  Google Scholar 

  19. Hjaltason G., Samet H.: Incremental distance join algorithms for spatial databases. ACM SIGMOD Rec. 27(2), 237–248 (1998)

    Article  Google Scholar 

  20. Hjaltason G., Samet H.: Distance browsing in spatial databases. TODS 24(2), 265–318 (1999)

    Article  Google Scholar 

  21. Iwerks, G., Samet, H., Smith, K.: Continuous k-nearest neighbor queries for continuously moving points with updates. In: Proceedings of VLDB, pp. 512–523 (2003)

  22. Khuller S., Matias Y.: A simple randomized sieve algorithm for the closest-pair problem. Inf. Comput. 118(1), 34–37 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  23. Korn, F., Sidiropoulos, N., Faloutsos, C., Siegel, E., Protopapas, Z.: Fast nearest neighbor search in medical image databases. In: Proceedings of VLDB, pp. 215–226 (1996)

  24. Kriegel, H., Kröger, P., Kunath, P., Renz, M.: Generalizing the optimality of multi-step k-nearest neighbor query processing. In: Advances in Spatial and Temporal Databases, pp. 75–92 (2007)

  25. Ljosa, V., Singh, A.: Probabilistic segmentation and analysis of horizontal cells. In: Proceedings of ICDM, pp. 980–985 (2006)

  26. Ljosa, V., Singh, A.: Top-k spatial joins of probabilistic objects. In: Proceedings of ICDE, pp. 566–575 (2008)

  27. Papadopoulos, A., Manolopoulos, Y.: Performance of nearest neighbor queries in R-trees. In: Proceedings of ICDT, pp. 394–408 (1997)

  28. Peng S., Urbanc B., Cruz L., Hyman B., Stanley H.: Neuron recognition by parallel potts segmentation. Natl Acad Sci 100(7), 3847–3852 (2003)

    Article  Google Scholar 

  29. Preparata F., Shamos M.: Computational Geometry: An Introduction. Springer, Berlin (1985)

    Google Scholar 

  30. Roussopoulos, N., Kelley, S., Vincent, F.: Nearest neighbor queries. In: Proceedings of SIGMOD, pp. 71–79 (1995)

  31. Saltenis S., Jensen C., Leutenegger S., Lopez M.: Indexing the positions of continuously moving objects. ACM Sigmod Rec. 29(2), 331–342 (2000)

    Article  Google Scholar 

  32. Schmitz C., Grolms N., Hof P., Boehringer R., Glaser J., Korr H.: A stereological study using a novel three-dimensional analysis method to estimate the nearest neighbor distance distributions of cells in thick sections. Cereb. Cortex 12(9), 954–960 (2002)

    Article  Google Scholar 

  33. Schneider, M.: Uncertainty management for spatial data in databases: fuzzy spatial data types. In: Proceedings of SSD, pp. 330–354 (1999)

  34. Schneider, M.: Metric operations on fuzzy spatial objects in databases. In: Proceedings of ACM GIS, pp. 21–26 (2000)

  35. Schneider, M.: A design of topological predicates for complex crisp and fuzzy regions. In: Proceedings of ICCM, pp. 103–116 (2001)

  36. Schneider, M.: Fuzzy topological predicates, their properties, and their integration into query languages. In: Proceedings of GIS, pp. 9–14 (2001)

  37. Schwarz C., Smid M., Snoeyink J.: An optimal algorithm for the on-line closest-pair problem. Algorithmica 12(1), 18–29 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  38. Seidl, T., Kriegel, H.: Efficient user-adaptable similarity search in large multimedia databases. In: Proceedings of VLDB, pp. 506–515 (1997)

  39. Seidl, T., Kriegel, H.: Optimal multi-step k-nearest neighbor search. In: Proceedings of SIGMOD, pp. 154–165 (1998)

  40. Tang, X., Kainz, W.: Analysis of topological relations between fuzzy regions in a general fuzzy topological space. In: Symposium on Geospatial Theory, Processing and Applications (2002)

  41. Tao, Y., Cheng, R., Xiao, X., Ngai, W., Kao, B., Prabhakar, S.: Indexing multi-dimensional uncertain data with arbitrary probability density functions. In: Proceedings of VLDB, pp. 922–933 (2005)

  42. Tao, Y., Papadias, D., Shen, Q.: Continuous nearest neighbor search. In: Proceedings of VLDB, pp. 287–298 (2002)

  43. Tao, Y., Papadias, D., Sun, J.: The tpr*-tree: An optimized spatio-temporal access method for predictive queries. In: Proceedings of VLDB, pp. 790–801 (2003)

  44. Weber, R., Schek, H., Blott, S.: A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. In: Proceedings of VLDB, pp. 194–205 (1998)

  45. Yu, C., Ooi, B., Tan, K., Jagadish, H.: Indexing the distance: an efficient method to kNN processing. In: Proceedings of VLDB, pp. 421–430 (2001)

  46. Zadeh L.: Fuzzy sets. Inf. Control 8, 338–353 (1965)

    Article  MathSciNet  MATH  Google Scholar 

  47. Zheng, K., Fung, P., Zhou, X.: K-nearest neighbor search for fuzzy objects. In: Proceedings of SIGMOD, pp. 699–710 (2010)

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Kai Zheng.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zheng, K., Zhou, X., Fung, P.C. et al. Spatial query processing for fuzzy objects. The VLDB Journal 21, 729–751 (2012). https://doi.org/10.1007/s00778-012-0266-x

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00778-012-0266-x

Keywords

Navigation