Skip to main content
Log in

Continuous top-k spatial–keyword search on dynamic objects

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

Abstract

As the popularity of SNS- and GPS-equipped mobile devices rapidly grows, numerous location-based applications have emerged. A common scenario is that a large number of users change location and interests from time to time; e.g., a user watches news, blogs, and videos while moving outside. Many online services have been developed based on continuously querying spatial–keyword objects. For instance, Twitter adjusts advertisements based on the location and the content of the message a user has just tweeted. In this paper, we investigate the case of dynamic spatial–keyword objects whose locations and keywords change over time. We study the problem of continuously tracking top-\(k\) dynamic spatial–keyword objects for a given set of queries. Answering this type of queries benefits many location-aware services such as e-commerce potential customer identification, drone delivery, and self-driving stores. We develop a solution based on a grid index. To deal with the changing locations and keywords of objects, our solution first finds the set of queries whose results are affected by the change and then updates the results of these queries. We propose a series of indexing and query processing techniques to accelerate the two procedures. We also discuss batch processing to cope with the case when multiple objects change locations and keywords in a time interval and top-\(k\) results are reported afterward. Experiments on real and synthetic datasets demonstrate the efficiency of our method and its superiority over alternative solutions.

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

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17
Fig. 18
Fig. 19
Fig. 20
Fig. 21
Fig. 22

Similar content being viewed by others

Notes

  1. This scoring function is also used in [31].

  2. One may want to keep only the \((k+1)\)th object, but this object may change state while q is outside both \(Q_{prev}\) and \(Q_{next}\), hence difficult to track.

  3. A special case is \(SimST(o^{t'}, q) = q.score(k, t)\). o is the kth result at \(t'\) and no further action is required. We omit it in the pseudo-code for conciseness.

References

  1. Agrawal, P., Arasu, A., Kaushik, R.: On indexing error-tolerant set containment. In: SIGMOD, pp. 927–938 (2010)

  2. Ahuja, R., Armenatzoglou, N., Papadias, D., Fakas, G.J.: Geo-social keyword search. In: SSTD, pp. 431–450 (2015)

  3. Bayardo, R.J., Ma, Y., Srikant, R.: Scaling up all pairs similarity search. In: WWW, pp. 131–140 (2007)

  4. Chaudhuri, S., Ganti, V., Kaushik, R.: A primitive operator for similarity joins in data cleaning. In: ICDE, pp. 5 (2006)

  5. Chen, L., Cong, G., Cao, X.: An efficient query indexing mechanism for filtering geo-textual data. In: SIGMOD, pp. 749–760 (2013)

  6. Chen, L., Cong, G., Cao, X., Tan, K.: Temporal spatial-keyword top-k publish/subscribe. In: ICDE, pp. 255–266 (2015)

  7. Chen, L., Cong, G., Jensen, C.S., Wu, D.: Spatial keyword query processing: an experimental evaluation. PVLDB 6(3), 217–228 (2013)

    Google Scholar 

  8. Chen, L., Shang, S., Zhang, Z., Cao, X., Jensen, C.S., Kalnis, P.: Location-aware top-k term publish/subscribe. In: ICDE, pp. 749–760 (2018)

  9. Cong, G., Jensen, C.S.: Querying geo-textual data: spatial keyword queries and beyond. In: SIGMOD, pp. 2207–2212 (2016)

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

    Google Scholar 

  11. Dong, Y., Chen, H., Kitagawa, H.: Continuous search on dynamic spatial keyword objects. In: ICDE, pp. 1578–1581 (2019)

  12. Düntgen, C., Behr, T., Güting, R.H.: Berlinmod: a benchmark for moving object databases. VLDB J. 18(6), 1335–1368 (2009)

    Article  Google Scholar 

  13. Foursquare. Foursquare check-in dataset. https://sites.google.com/site/yangdingqi/home/foursquare-dataset (2019)

  14. Gao, Y., Qin, X., Zheng, B., Chen, G.: Efficient reverse top-k boolean spatial keyword queries on road networks. IEEE Trans. Knowl. Data Eng. 27(5), 1205–1218 (2015)

    Article  Google Scholar 

  15. Guo, L., Shao, J., Aung, H.H., Tan, K.: Efficient continuous top-k spatial keyword queries on road networks. Geoinformatica 19(1), 29–60 (2015)

    Article  Google Scholar 

  16. Guo, L., Zhang, D., Li, G., Tan, K., Bao, Z.: Location-aware pub/sub system: when continuous moving queries meet dynamic event streams. In: SIGMOD, pp. 843–857 (2015)

  17. Huang, W., Li, G., Tan, K., Feng, J.: Efficient safe-region construction for moving top-k spatial keyword queries. In: CIKM, pp. 932–941 (2012)

  18. Li, G., Wang, Y., Wang, T., Feng, J.: Location-aware publish/subscribe. In: KDD, pp. 802–810 (2013)

  19. Lu, Y., Cong, G., Lu, J., Shahabi, C.: Efficient algorithms for answering reverse spatial-keyword nearest neighbor queries. In: SIGSPATIAL/GIS, pp. 82:1–82:4 (2015)

  20. Lu, Y., Lu, J., Cong, G., Wu, W., Shahabi, C.: Efficient algorithms and cost models for reverse spatial-keyword k-nearest neighbor search. ACM Trans. Database Syst. 39(2), 13:1–13:46 (2014)

    Article  MathSciNet  Google Scholar 

  21. Mahmood, A.R., Aref, W.G.: Query processing techniques for big spatial-keyword data. In: SIGMOD, pp. 1777–1782, (2017)

  22. Mann, W., Augsten, N., Bouros, P.: An empirical evaluation of set similarity join techniques. PVLDB 9(9), 636–647 (2016)

    Google Scholar 

  23. Mouratidis, K., Bakiras, S., Papadias, D.: Continuous monitoring of top-k queries over sliding windows. In: SIGMOD, pp. 635–646 (2006)

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

  25. NYC Open Data: Green taxi trip data. https://data.cityofnewyork.us/Transportation/2016-Green-Taxi-Trip-Data/hvrh-b6nb/ (2016)

  26. Rocha-Junior, J.B., Gkorgkas, O., Jonassen, S., Nørvåg, K.: Efficient processing of top-k spatial keyword queries. In: SSTD, pp 205–222 (2011)

  27. Twitter. Geotagged tweets from the us. https://datorium.gesis.org/xmlui/handle/10.7802/1166 (2016)

  28. Wang, J., Li, G., Feng, J.: Can we beat the prefix filtering? An adaptive framework for similarity join and search. In: SIGMOD, pp. 85–96 (2012)

  29. Wang, P., Xiao, C., Qin, J., Wang, W., Zhang, X., Ishikawa, Y.: Local similarity search for unstructured text. In: SIGMOD, pp. 1991–2005 (2016)

  30. Wang, X., Qin, L., Lin, X., Zhang, Y., Chang, L.: Leveraging set relations in exact and dynamic set similarity join. VLDB J. 28(2), 267–292 (2019)

    Article  Google Scholar 

  31. Wang, X., Zhang, Y., Zhang, W., Lin, X., Huang, Z.: SKYPE: top-k spatial-keyword publish/subscribe over sliding window. PVLDB 9(7), 588–599 (2016)

    Google Scholar 

  32. Wang, X., Zhang, Y., Zhang, W., Lin, X., Wang, W.: Ap-tree: efficiently support location-aware publish/subscribe. VLDB J. 24(6), 823–848 (2015)

    Article  Google Scholar 

  33. Wu, D., Yiu, M.L., Jensen, C.S.: Moving spatial keyword queries: formulation, methods, and analysis. ACM Trans. Database Syst. 38(1), 7:1–7:47 (2013)

  34. Xiao, C., Wang, W., Lin, X., Yu, J.X., Wang, G.: Efficient similarity joins for near-duplicate detection. ACM Trans. Database Syst. 36(3), 15:1–15:41 (2011)

    Article  Google Scholar 

  35. Xiong, X., Mokbel, M.F., Aref, W.G.: SEA-CNN: scalable processing of continuous k-nearest neighbor queries in spatio-temporal databases. In: ICDE, pp. 643–654 (2005)

  36. Yang, D., Zhang, D., Zheng, V.W., Yu, Z.: Modeling user activity preference by leveraging user spatial temporal characteristics in lbsns. IEEE Trans. Syst. Man Cybern. Syst. 45(1), 129–142 (2015)

    Article  Google Scholar 

  37. Yao, Z., Fu, Y., Liu, B., Liu, Y., Xiong, H.: POI recommendation: a temporal matching between POI popularity and user regularity. In: ICDM, pp. 549–558 (2016)

  38. Yelp. Yelp dataset. https://www.yelp.com/dataset (2019)

  39. Yi, K., Yu, H., Yang, J., Xia, G., Chen, Y.: Efficient maintenance of materialized top-k views. In: ICDE, pp. 189–200 (2003)

  40. Young, N.E.: Greedy set-cover algorithms. In: Encyclopedia of Algorithms. Springer, Berlin (2008)

  41. Yu, X., Pu, K.Q., Koudas, N.: Monitoring k-nearest neighbor queries over moving objects. In: ICDE, pp. 631–642 (2005)

  42. Zhao, J., Gao, Y., Chen, G., Jensen, C.S., Chen, R., Cai, D.: Reverse top-k geo-social keyword queries in road networks. In: ICDE, pp. 387–398 (2017)

  43. Zheng, B., Zheng, K., Xiao, X., Su, H., Yin, H., Zhou, X., Li, G.: Keyword-aware continuous kNN query on road networks. In: ICDE, pp. 871–882 (2016)

Download references

Acknowledgements

Chuan Xiao was supported by JSPS Kakenhi 17H06099, 18H04093, and 19K11979. Hanxiong Chen was supported by JSPS Kakenhi 19K12114. Jeffrey Xu Yu was supported by the Research Grants Council of Hong Kong, China, Nos. 14203618 and 14202919. Hiroyuki Kitagawa was supported by JSPS Kakenhi 19H04114.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Chuan Xiao.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Dong, Y., Xiao, C., Chen, H. et al. Continuous top-k spatial–keyword search on dynamic objects. The VLDB Journal 30, 141–161 (2021). https://doi.org/10.1007/s00778-020-00627-4

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00778-020-00627-4

Keywords

Navigation