Skip to main content

Collectively Find Spatial Objects in Time-Dependent Spatial Network

  • Conference paper
  • First Online:
Advances in Computational Intelligence (ICCI 2015)

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 509))

Included in the following conference series:

  • 781 Accesses

Abstract

With the rapid revolution of GPS-equipped devices, discovery of spatial objects with user’s requirement in a city that takes minimum travelling time is a very big challenge. To retrieve spatial objects, we use some spatial queries that have both textual description and location of objects. All existing queries in spatial network focus on finding single objects rather than group of objects, and also assume that each edge of spatial network has constant weight. But in real-world scenario weight of each edge varies and depends on various factor for, e.g., congestion, road blocking, etc. In this paper, we propose a query that collectively finds a group of spatial objects in such a way that group’s keyword matches with query’s keyword and sum of their traveling time is minimum using objects near to the query location and also has lowest inter-object distance with considering the lowest congestion in their path. The aim of this query is to help users in application like emergency services, trip planning, etc.

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

Access this chapter

Institutional subscriptions

References

  1. Samet, H., Sankaranarayanan, J., Alborzi, H.: Scalable network distance browsing inspatial databases. In: Proceedings of SIGMOD (2008)

    Google Scholar 

  2. Kolahdouzan, M., Shahabi, C.: Voronoi-based k-NN search in spatial networks. In: Proceedings of VLDB (2004)

    Google Scholar 

  3. Papadias, D., Zhang, J., Mamoulis, N., Tao, Y.: Query processing in spatial networks. In: Proceedings of VLDB (2003)

    Google Scholar 

  4. Xin, C., Cong, G., Jensen, C.S., Ooi, B.C.: Collective spatial keyword querying. In: Proceedings of the 2011 International Conference on Management of Data—SIGMOD 11 (2011)

    Google Scholar 

  5. Guttman, A.: R-trees: a dynamic index structure for spatial searching. In: Proceedings of SIGMOD (1984)

    Google Scholar 

  6. Bentley, J.L.: Multidimensional binary search trees used for associative searching. Commun. ACM 18(9), 509–517 (1975)

    Article  MATH  Google Scholar 

  7. Finkel, R., Bentley, J.: Quad trees: a data structure for retrieval on composite keys. Acta Informatica 4(1), 1–9 (1974)

    Article  MATH  Google Scholar 

  8. Kolahdouzan, M., Shahabi, C.: Voronoi-based k nearest neighbor search for spatial network databases. In: Proceedings of 30th International Conference Very Large Data Bases, pp. 840–851 (2004)

    Google Scholar 

  9. Zhang, D., Ooi, B.C., Tung, A.K.H.: Locating mapped resources in web 2.0. In: ICDE, pp. 521–532 (2010)

    Google Scholar 

  10. Jagadish, H., Ooi, B., Tan, K.-L., Yu, C., Zhang, R.: iDistance: An adaptive b+-tree based indexing method for nearest neighbour search. ACM Trans. Database Syst. 30(2), 364–397 (2005)

    Article  Google Scholar 

  11. Zhang, D., Chee, Y.M., Mondal, A., Tung, A.K.H., Kitsuregawa, M.: Keyword search in spatial databases: towards searching by document. In: ICDE, pp. 688–699 (2009)

    Google Scholar 

  12. Cho, H.-J., Chung, C.-W.: An efficient and scalable approach to CNN queries in a road network. In: Proceedings of 31st International Conference Very Large Data Bases, pp. 865–876 (2005)

    Google Scholar 

  13. Mouratidis, K., Papadias, D., Hadjieleftheriou, M.: Conceptual partitioning: an efficient method for continuous nearest neighbor monitoring. In: Proceedings of ACM SIGMOD International Conference on Management of Data, pp. 634–645 (2005)

    Google Scholar 

  14. Jensen, C.S., Kolarvr, J., Pedersen, T.B., Timko, I.: Nearest neighbor queries in road networks. In: Proceedings of 11th ACM International Symposium on Advances in Geographic Information Systems, pp. 1–8 (2003)

    Google Scholar 

  15. Deng, K., Zhou, X., Shen, H.T., Xu, K., Lin, X.: Surface k-NN query processing. In: Proceedings of 22nd International Conference on Data Engineering, p. 78 (2006)

    Google Scholar 

  16. Qin, L., Yu, J.X., Ding, B., Ishikawa, Y.: Monitoring aggregate k-NN objects in road networks. In: Proceedings of SSDBM, pp. 168–186 (2008)

    Google Scholar 

  17. Li, F., Cheng, D., Hadjieleftheriou, M., Kollios, G., Teng, S.-H.: On trip planning queries in spatial databases. In: Proceedings of SSTD, pp. 273–290 (2005)

    Google Scholar 

  18. Cho, H.-J., Chung, C.-W.: An efficient and scalable approach to cnn queries in a road network. In: Proceedings of VLDB, pp. 865–876 (2005)

    Google Scholar 

  19. Mouratidis, K., Papadias, D., Hadjieleftheriou, M.: Conceptual partitioning: an efficient method for continuous nearest neighbor monitoring. In: Proceedings of SIGMOD, pp. 634–645 (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Abdul Wahid .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer Science+Business Media Singapore

About this paper

Cite this paper

Wahid, A., Haider, M.T.U. (2017). Collectively Find Spatial Objects in Time-Dependent Spatial Network. In: Sahana, S.K., Saha, S.K. (eds) Advances in Computational Intelligence. ICCI 2015. Advances in Intelligent Systems and Computing, vol 509. Springer, Singapore. https://doi.org/10.1007/978-981-10-2525-9_38

Download citation

  • DOI: https://doi.org/10.1007/978-981-10-2525-9_38

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-10-2524-2

  • Online ISBN: 978-981-10-2525-9

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics