Identifying the Most Endangered Objects from Spatial Datasets

  • Hua Lu
  • Man Lung Yiu
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5566)

Abstract

Real-life spatial objects are usually described by their geographic locations (e.g., longitude and latitude), and multiple quality attributes. Conventionally, spatial data are queried by two orthogonal aspects: spatial queries involve geographic locations only; skyline queries are used to retrieve those objects that are not dominated by others on all quality attributes. Specifically, an object p i is said to dominate another object p j if p i is no worse than p j on all quality attributes and better than p j on at least one quality attribute. In this paper, we study a novel query that combines both aspects meaningfully. Given two spatial datasets P and S, and a neighborhood distance δ, the most endangered object query (MEO) returns the object s ∈ S such that within the distance δ from s, the number of objects in P that dominate s is maximized. MEO queries appropriately capture the needs that neither spatial queries nor skyline queries alone have addressed. They have various practical applications such as business planning, online war games, and wild animal protection. Nevertheless, the processing of MEO queries is challenging and it cannot be efficiently evaluated by existing solutions. Motivated by this, we propose several algorithms for processing MEO queries, which can be applied in different scenarios where different indexes are available on spatial datasets. Extensive experimental results on both synthetic and real datasets show that our proposed advanced spatial join solution achieves the best performance and it is scalable to large datasets.

Keywords

Quality Attribute Neighborhood Distance Spatial Object Skyline Query Spatial Query 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Borzonyi, S., Kossmann, D., Stocker, K.: The Skyline Operator. In: Proc. of ICDE, pp. 421–430 (2001)Google Scholar
  2. 2.
    Brinkhoff, T., Kriegel, H.-P., Seeger, B.: Efficient Processing of Spatial Joins Using R-Trees. In: Proc. of SIGMOD, pp. 237–246 (1993)Google Scholar
  3. 3.
    Böhm, C.: A Cost Model for Query Processing in High Dimensional Data Spaces. ACM TODS 25(2), 129–178 (2000)CrossRefGoogle Scholar
  4. 4.
    Butz, A.R.: Alternative Algorithm for Hilbert’s Space-Filling Curve. IEEE TOC C-20(4), 424–426 (1971)MATHGoogle Scholar
  5. 5.
    Du, Y., Zhang, D., Xia, T.: The Optimal-Location Query. In: Bauzer Medeiros, C., Egenhofer, M.J., Bertino, E. (eds.) SSTD 2005. LNCS, vol. 3633, pp. 163–180. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  6. 6.
    Huang, X., Jensen, C.S.: In-Route Skyline Querying for Location-Based Services. In: Kwon, Y.-J., Bouju, A., Claramunt, C. (eds.) W2GIS 2004. LNCS, vol. 3428, pp. 120–135. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  7. 7.
    Huang, Z., Lu, H., Ooi, B.C., Tung, A.K.H.: Continuous Skyline Queries for Moving Objects. IEEE TKDE 18(12), 1645–1658 (2006)Google Scholar
  8. 8.
    Koudas, N., Sevcik, K.C.: High Dimensional Similarity Joins: Algorithms and Performance Evaluation. In: Proc. of ICDE, pp. 466–475 (1998)Google Scholar
  9. 9.
    Li, C., Ooi, B.C., Tung, A.K.H., Wang, S.: DADA: A Data Cube for Dominant Relationship Analysis. In: Proc. of SIGMOD, pp. 659–670 (2006)Google Scholar
  10. 10.
    Li, C., Tung, A.K.H., Jin, W., Ester, M.: On Dominating Your Neighborhood Profitably. In: Proc. of VLDB, pp. 818–829 (2007)Google Scholar
  11. 11.
    Moon, B., Jagadish, H.V., Faloutsos, C., Saltz, J.H.: Analysis of the Clustering Properties of the Hilbert Space-Filling Curve. IEEE TKDE 13(1), 124–141 (2001)Google Scholar
  12. 12.
    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, pp. 443–459. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  13. 13.
    Papadias, D., Tao, Y., Fu, G., Seeger, B.: An Optimal and Progressive Algorithm for Skyline Queries. In: Proc. of SIGMOD, pp. 467–478 (2003)Google Scholar
  14. 14.
    Sharifzadeh, M., Shahabi, C.: The Spatial Skyline Queries. In: Proc. of VLDB, pp. 751–762 (2006)Google Scholar
  15. 15.
    Xia, T., Zhang, D., Kanoulas, E., Du, Y.: On Computing Top-t Most Influential Spatial Sites. In: Proc. of VLDB, pp. 946–957 (2005)Google Scholar
  16. 16.
    Yiu, M.L., Dai, X., Mamoulis, N., Vaitis, M.: Top-k Spatial Preference Queries. In: Proc. of ICDE, pp. 1076–1085 (2007)Google Scholar
  17. 17.
    Zhang, D., Du, Y., Xia, T., Tao, Y.: Progressive Computation of the Min-dist Optimal-Location Query. In: Proc. of VLDB, pp. 643–654 (2006)Google Scholar
  18. 18.
    Zheng, B., Lee, K.C.K., Lee, W.-C.: Location-Dependent Skyline Query. In: Proc. of MDM, pp. 148–155 (2008)Google Scholar
  19. 19.
    Zhu, M., Papadias, D., Zhang, J., Lee, D.L.: Top-k Spatial Joins. IEEE TKDE 17(4), 567–579 (2005)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Hua Lu
    • 1
  • Man Lung Yiu
    • 1
  1. 1.Department of Computer ScienceAalborg UniversityDenmark

Personalised recommendations