Skip to main content

Efficient Group Processing for Multiple Reverse Top-k Geo-Social Keyword Queries

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

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

Included in the following conference series:

Abstract

A Reverse Top-k Geo-Social Keyword Query (RkGSKQ) aims to find all the users who have a given geo-social object in their top-k geo-social keyword query results. This query is practical in detecting prospective customers for online business in social networks. Existing work on RkGSKQ only explored efficient approaches in answering a single query per time, which could not be efficient in processing multiple queries in a query batch. In many real-life applications, multiple RkGSKQs for multiple query objects can be issued at the same time. To this end, in this paper, we focus on the efficient batch processing algorithm for multiple RkGSKQs. To reduce the overall cost and find concurrently results of multiple queries, we present a group processing framework based on the current state-of-the-art indexing and group pruning strategies to answer multiple RkGSKQs by sharing common CPU and I/O costs. Extensive experiments on three data sets demonstrate the effectiveness and efficiency of our proposed methods.

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.

    http://www.yelp.com/balancing_challenge/.

  2. 2.

    https://www.openstreetmap.org/.

  3. 3.

    http://www.dis.uniroma1.it/challenge9/.

  4. 4.

    http://snap.stanford.edu/data/index.html.

References

  1. Ahuja, R., Armenatzoglou, N., Papadias, D., Fakas, G.J.: Geo-social keyword search. In: Claramunt, C., et al. (eds.) SSTD 2015. LNCS, vol. 9239, pp. 431–450. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-22363-6_23

    Chapter  Google Scholar 

  2. Chen, L., Liu, C., Yang, X., Wang, B., Li, J., Zhou, R.: Efficient batch processing for multiple keyword queries on graph data. In: CIKM, pp. 1261–1270 (2016)

    Google Scholar 

  3. Choudhury, F.M., Culpepper, J.S., Bao, Z., Sellis, T.: Finding the optimal location and keywords in obstructed and unobstructed space. VLDB J. 27(4), 445–470 (2018). https://doi.org/10.1007/s00778-018-0504-y

    Article  Google Scholar 

  4. Choudhury, F., Culpepper, J., Sellis, T., Cao, X.: Maximizing bichromatic reverse spatial and textual \(k\) nearest neighbor queries. In: VLDB, pp. 1414–1417 (2016)

    Google Scholar 

  5. Choudhury, F.M., Culpepper, J.S., Bao, Z., Sellis, T.: Batch processing of top-\(k\) spatial-textual queries databases. ACM Trans. Spat. Algorithms Syst. 3(e), 1–13 (2018)

    Google Scholar 

  6. Gao, Y., Qin, X., Zheng, B., Chen, G.: Efficient reverse top-\(k\) Boolean spatial keyword queries on road networks. TKDE 27(5), 1205–1218 (2015)

    Google Scholar 

  7. Korn, F., Muthukrishnan, S.: Influence sets based on reverse nearest neighbor queries. In: SIGMOD, pp. 201–212 (2000)

    Google Scholar 

  8. Lee, K.C., Zheng, B., Lee, W.C.: Ranked reverse nearest neighbor search. TKDE 20(7), 894–910 (2008)

    Google Scholar 

  9. Lu, J., Lu, Y., Cong, G.: Reverse spatial and textual \(k\) nearest neighbor search. In: SIGMOD, pp. 349–360 (2011)

    Google Scholar 

  10. Rocha-Junior, J., Norvag, K.: Top-\(k\) spatial keyword queries on road networks. In: EDBT, pp. 168–179 (2012)

    Google Scholar 

  11. Wu, D., Yiu, M., Cong, G., Jensen, C.S.: Joint top-\(k\) spatial keyword query processing. TKDE 24(10), 1889–1903 (2012)

    Google Scholar 

  12. Yiu, M.L., Papadias, D., Mamoulis, N., Tao, Y.: Reverse nearest neighbors in large graphs. TKDE 18(4), 540–553 (2006)

    Google Scholar 

  13. Zhao, J., Gao, Y., Chen, G., Chen, R.: Why-not questions on top-\(k\) geo-social keyword queries in road networks. In: ICDE, pp. 965–976 (2018)

    Google Scholar 

  14. 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)

    Google Scholar 

  15. Zhong, R., Li, G., Tan, K.L., Zhou, L., Gong, Z.: G-tree: an efficient and scalable index for spatial search on road networks. TKDE 27(8), 2175–2189 (2015)

    Google Scholar 

Download references

Acknowledgments

This work was supported in part by the National Key R&D Program of China under Grant No. 2018YFB1004003, the NSFC under Grant No. 61972338, the NSFCZhejiang Joint Fund under Grant No. U1609217, and the ZJU-Hikvision Joint Project. Yunjun Gao is the corresponding author of the work.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yunjun Gao .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Jin, P., Gao, Y., Chen, L., Zhao, J. (2020). Efficient Group Processing for Multiple Reverse Top-k Geo-Social Keyword Queries. In: Nah, Y., Cui, B., Lee, SW., Yu, J.X., Moon, YS., Whang, S.E. (eds) Database Systems for Advanced Applications. DASFAA 2020. Lecture Notes in Computer Science(), vol 12112. Springer, Cham. https://doi.org/10.1007/978-3-030-59410-7_18

Download citation

Publish with us

Policies and ethics