Skip to main content

Efficient Algorithms for Solving Aggregate Keyword Routing Problems

  • Conference paper
  • First Online:
Database Systems for Advanced Applications (DASFAA 2019)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 11447))

Included in the following conference series:

  • 2789 Accesses

Abstract

With the emergence of smart phones and the popularity of GPS, the number of point of interest (POIs) is growing rapidly and spatial keyword search based on POIs has attracted significant attention. In this paper, we study a more sophistic type of spatial keyword searches that considers multiple query points and multiple query keywords, namely Aggregate Keyword Routing (AKR). AKR looks for an aggregate point m together with routes from each query point to m. The aggregate point has to satisfy the aggregate keywords, the routes from query points to the aggregate point have to pass POIs in order to complete the tasks specified by the task keywords, and the result route is expected to be the optimal one among all the potential results. In order to process AKR queries efficiently, we propose effective search algorithms, which support different aggregate functions. A comprehensive evaluation has been conducted to evaluate the performance of these algorithms with real datasets.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    https://www.foursquare.com.

References

  1. Chen, K., Sun, W., Tu, C., Chen, C., Huang, Y.: Aggregate keyword routing in spatial database. In: SIGSPATIAL, pp. 430–433. ACM (2012)

    Google Scholar 

  2. Cong, G., Jensen, C.S., Wu, D.: Efficient retrieval of the top-k most relevant spatial web objects. Proc. VLDB Endowment 2(1), 337–348 (2009)

    Article  Google Scholar 

  3. De Felipe, I., Hristidis, V., Rishe, N.: Keyword search on spatial databases. In: ICDE, pp. 656–665. IEEE (2008)

    Google Scholar 

  4. Deng, K., Sadiq, S., Zhou, X., Xu, H., Fung, G.P.C., Lu, Y.: On group nearest group query processing. TKDE 24(2), 295–308 (2012)

    Google Scholar 

  5. Li, F., Yao, B., Kumar, P.: Group enclosing queries. TKDE 23(10), 1526–1540 (2011)

    Google Scholar 

  6. Li, G., Feng, J., Xu, J.: Desks: direction-aware spatial keyword search. In: ICDE, pp. 474–485. IEEE (2012)

    Google Scholar 

  7. Li, Z., Xu, H., Lu, Y., Qian, A.: Aggregate nearest keyword search in spatial databases. In: APWEB, pp. 15–21. IEEE (2010)

    Google Scholar 

  8. Li, Z., Lee, K.C., Zheng, B., Lee, W.C., Lee, D., Wang, X.: Ir-tree: an efficient index for geographic document search. TKDE 23(4), 585–599 (2011)

    Google Scholar 

  9. Lian, X., Chen, L.: Probabilistic group nearest neighbor queries in uncertain databases. TKDE 20(6), 809–824 (2008)

    Google Scholar 

  10. Luo, Y., Chen, H., Furuse, K., Ohbo, N.: Efficient methods in finding aggregate nearest neighbor by projection-based filtering. In: Gervasi, O., Gavrilova, M.L. (eds.) ICCSA 2007. LNCS, vol. 4707, pp. 821–833. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-74484-9_70

    Chapter  Google Scholar 

  11. Luo, Y., Furuse, K., Chen, H., Ohbo, N.: Finding aggregate nearest neighbor efficiently without indexing. In: Proceedings of the 2nd international conference on Scalable information systems. p. 48. Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering (2007)

    Google Scholar 

  12. Papadias, D., Shen, Q., Tao, Y., Mouratidis, K.: Group nearest neighbor queries. In: ICDE, pp. 301–312. IEEE (2004)

    Google Scholar 

  13. Papadias, D., Tao, Y., Mouratidis, K., Hui, C.K.: Aggregate nearest neighbor queries in spatial databases. TODS 30(2), 529–576 (2005)

    Article  Google Scholar 

  14. Sharifzadeh, M., Shahabi, C.: Vor-tree: R-trees with voronoi diagrams for efficient processing of spatial nearest neighbor queries. Proc. VLDB Endowment 3(1–2), 1231–1242 (2010)

    Article  Google Scholar 

  15. Sun, W.W., Chen, C.N., Zhu, L., Gao, Y.J., Jing, Y.N., Li, Q.: On efficient aggregate nearest neighbor query processing in road networks. JCST 30(4), 781–798 (2015)

    MathSciNet  Google Scholar 

  16. Sun, W., et al.: Merged aggregate nearest neighbor query processing in road networks. In: CIKM, pp. 2243–2248. ACM (2013)

    Google Scholar 

  17. Sun, W., Chen, C., Zheng, B., Chen, C., Zhu, L., Liu, W., Huang, Y.: Fast optimal aggregate point search for a merged set on road networks. Inform. Sci. 310, 52–68 (2015)

    Article  Google Scholar 

  18. Yao, B., Tang, M., Li, F.: Multi-approximate-keyword routing in GIS data. In: SIGSPATIAL, pp. 201–210. ACM (2011)

    Google Scholar 

  19. Yiu, M.L., Mamoulis, N., Papadias, D.: Aggregate nearest neighbor queries in road networks. TKDE 17(6), 820–833 (2005)

    Google Scholar 

  20. Zhang, C., Zhang, Y., Zhang, W., Lin, X.: Inverted linear quadtree: efficient top K spatial keyword search. TKDE 28(7), 1706–1721 (2016)

    Google Scholar 

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

    Google Scholar 

  22. Zhang, P., Lin, H., Gao, Y., Lu, D.: Aggregate keyword nearest neighbor queries on road networks. GeoInformatica 22(2), 237–268 (2018)

    Article  Google Scholar 

  23. Zhu, L., Jing, Y., Sun, W., Mao, D., Liu, P.: Voronoi-based aggregate nearest neighbor query processing in road networks. In: SIGSPATIAL, pp. 518–521. ACM (2010)

    Google Scholar 

Download references

Acknowledgment

This research is supported in part by the National Natural Science Foundation of China under grant 61772138, the National Key Research and Development Program of China under grant 2018YFB0505000, and the National Research Foundation, Prime Ministers Office, Singapore under its International Research Centres in Singapore Funding Initiative.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Weiwei Sun .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Jiang, Q., Sun, W., Zheng, B., Chen, K. (2019). Efficient Algorithms for Solving Aggregate Keyword Routing Problems. In: Li, G., Yang, J., Gama, J., Natwichai, J., Tong, Y. (eds) Database Systems for Advanced Applications. DASFAA 2019. Lecture Notes in Computer Science(), vol 11447. Springer, Cham. https://doi.org/10.1007/978-3-030-18579-4_42

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-18579-4_42

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-18578-7

  • Online ISBN: 978-3-030-18579-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics