Skip to main content
SpringerLink
Log in

uR-tree: a spatial index structure for handling multiple point selection queries

  • 1199: Computational Intelligence Revolution in Multimedia Data Analytics and Business Management
  • Published:
Multimedia Tools and Applications Aims and scope Submit manuscript

Abstract

People often query various Points of Interest (POIs) to plan their city tour itineraries using location-based services that provide reviews and ratings of various attributes of a POI. Most traditional location-based recommendation systems focus on various attributes like rating, cost, and social similarities of either POIs, users, or both but do not focus on efficient retrieval of POIs. This paper proposes a spatial index structure uR-tree (utility-based R-tree) for efficiently processing a location-based query implied in a location-aware recommender system to select multiple POIs which a user can visit in a tour. The uR-tree is constructed considering a change in static attributes like availability of parking, basic amenities, etc., and dynamic attributes like ticket price, congestion, etc., of each POI with the aim to maximize a user’s experience. At first, the utility of each POI is calculated at different points of time based on its static and dynamic attributes. A uR-tree is constructed for the systematic indexing of the utility of each POI, and an algorithm is applied for the retrieval of top-k maximum utility POI in different time-intervals. Then, we propose two Utility-based trip scheduling algorithms for distance-based travel recommendations. The experiments were conducted on real-world location-based social network data sets and show that the proposed scheme has a lower response time, Disk I/Os, and a higher query success rate as compared to state-of-the-art, R-tree index structure.

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

Access this article

Log in via an institution

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

Similar content being viewed by others

References

  1. Bast H, Majumdar D, Schenkel R, Theobalt C, Weikum G (2006) Io-top-k: index-access optimized top-k query processing. The VLDB Journal

  2. Benetis R, Jensen CS, Karciauskas G, Saltenis S (2002) Nearest neighbor and reverse nearest neighbor queries for moving objects. In: Proceedings international database engineering and applications symposium, pp 44–53. IEEE

  3. Cao X, Cong G, Jensen CS, Ooi BC (2011) Collective spatial keyword querying. In: Proceedings of the 2011 ACM SIGMOD international conference on management of data, pp 373–384. ACM

  4. Chakraborty C, Chakraborty PS, Pathak SS, Chakrabarti S (2010) Internetworking interface function for charging and billing in ip telephony services. In: Computer and network technology, pp 55–59. World Scientific

  5. Chakraborty C, Pathak SS, Chakrabarti S (2009) An o (n) telephony gateway selection methodology for ip-pstn packet routing. In: 2009 Annual IEEE India conference, pp 1–4. IEEE

  6. Chakraborty C, Pathak SS, Roy R, Chakrabarti S (2011) An optimal probabilistic traffic engineering scheme for heterogeneous networks. Fuzzy Syst 3(2):77–82

    Google Scholar 

  7. Cheng P, Lian X, Chen L, Liu S (2019) Maximizing the utility in location-based mobile advertising. In: 2019 IEEE 35th international conference on data engineering (ICDE), pp 1626–1629. IEEE

  8. Cho H -J, Kwon SJ, Chung T -S (2015) Alps: an efficient algorithm for top-k spatial preference search in road networks. Knowl Inf Syst 42(3):599–631

    Article  Google Scholar 

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

    Article  Google Scholar 

  10. Davidson SB, Khanna S, Milo T, Roy S (2013) Using the crowd for top-k and group-by queries. In: Proceedings of the 16th international conference on database theory, pp 225–236. ACM

  11. De Felipe I, Hristidis V, Rishe N (2008) Keyword search on spatial databases. In: 2008 IEEE 24th International conference on data engineering, pp 656–665. IEEE

  12. Gan W, Lin JC-W, Zhang J, Yin H, Fournier-Viger P, Chao H-C, Yu PS (2019) Utility mining across multi-dimensional sequences. arXiv:1902.09582

  13. Gao D, Tong Y, She J, Song T, Chen L, Xu K (2016) Top-k team recommendation in spatial crowdsourcing. In: International conference on web-age information management, pp 191–204. Springer

  14. Gao H, Huang W, Duan Y (2021) The cloud-edge-based dynamic reconfiguration to service workflow for mobile ecommerce environments: a qos prediction perspective. ACM Trans Internet Technol (TOIT) 21(1):1–23

    Article  Google Scholar 

  15. Gao H, Liu C, Li Y, Yang X (2020) V2vr: reliable hybrid-network-oriented v2v data transmission and routing considering rsus and connectivity probability. IEEE Trans Intell Transp Syst 22(6):3533–3546

    Article  Google Scholar 

  16. Gao H, Qin X, Barroso RJD, W Hussain Y X u, Yin Y (2020) Collaborative learning-based industrial iot api recommendation for software-defined devices: the implicit knowledge discovery perspective. IEEE Transactions on Emerging Topics in Computational Intelligence

  17. Gavrila DM (1994) R-tree index optimization. University of Maryland. Center for Automation Research, Computer Vision & ...

  18. Gunturi VMV, Shekhar S (2017) Big spatio-temporal network data analytics for smart cities: research needs. In: Seeing cities through big data, pp 127–140. Springer

  19. Guttman A (1984) R-trees: a dynamic index structure for spatial searching, vol 14. ACM

  20. Hu H, Zheng Y, Bao Z, Li G, Feng J, Cheng R (2016) Crowdsourced poi labelling: location-aware result inference and task assignment. In: 2016 IEEE 32nd International conference on data engineering (ICDE), pp 61–72. IEEE

  21. Kolpakov RM, Posypkin MA (2010) Upper and lower bounds for the complexity of the branch and bound method for the knapsack problem

  22. Kwon H-Y, Whang K-Y, Song I-Y, Wang H (2013) Rasim: a rank-aware separate index method for answering top-k spatial keyword queries. World Wide Web 16(2):111–139

    Article  Google Scholar 

  23. Li F, Yao B, Kumar P (2010) Group enclosing queries. IEEE Trans Knowl Data Eng 23(10):1526–1540

    Article  Google Scholar 

  24. Li M, Chen L, Cong G, Gu Y, Yu G (2016) Efficient processing of location-aware group preference queries. In: Proceedings of the 25th ACM international on conference on information and knowledge management, pp 559–568. ACM

  25. Li Z, Lee KCK, Zheng B, Lee W -C, Lee D, Wang X (2010) Ir-tree: an efficient index for geographic document search. IEEE Trans Knowl Data Eng 23(4):585–599

    Article  Google Scholar 

  26. Likhyani A, Gupta V, Bedathur S et al (2020) Modeling implicit communities using spatio-temporal point processes from geo-tagged event traces. arXiv:2006.07580

  27. Liu W, Wang Z -J, Yao B, Nie M, Wang J, Mao R, Yin J (2018) Geographical relevance model for long tail point-of-interest recommendation. In: International conference on database systems for advanced applications, pp 67–82. Springer

  28. McConnell CR, Brue SL, Flynn SM (2009) Economics: principles, problems, and policies. McGraw-Hill/Irwin, Boston

    Google Scholar 

  29. Mitra S, Saraf P, Sharma R, Bhattacharya A, Ranu S (2019) Netclus: a scalable framework to mine top-k locations for placement of trajectory-aware services. In: Proceedings of the ACM India joint international conference on data science and management of data, pp 27–35

  30. Nguyen-Dinh L-V, Aref WG, Mokbel M (2010) Spatio-temporal access methods: part 2 (2003-2010)

  31. Pande S, Ranu S, Bhattacharya A (2017) Skygraph: retrieving regions of interest using skyline subgraph queries. Proc VLDB Endow 10(11):1382–1393

    Article  Google Scholar 

  32. Papadias D, Shen Q, Tao Y, Mouratidis K (2004) Group nearest neighbor queries. In: Proceedings. 20th International conference on data engineering, pp 301–312. IEEE

  33. Rocha-Junior JB, Gkorgkas O, Jonassen S, Nørvåg K (2011) Efficient processing of top-k spatial keyword queries. In: International symposium on spatial and temporal databases, pp 205–222. Springer

  34. Rocha-Junior JB, Vlachou A, Doulkeridis C, Nørvåg K (2010) Efficient processing of top-k spatial preference queries. Proc VLDB Endowm 4 (2):93–104

    Article  Google Scholar 

  35. Roy SB, Lykourentzou I, Thirumuruganathan S, Amer-Yahia S, Das G (2015) Task assignment optimization in knowledge-intensive crowdsourcing. VLDB J 24(4):467–491

    Article  Google Scholar 

  36. Saxena AS, Dawar S, Goyal V, Bera D (2019) Mining top-k trajectory-patterns from anonymized data. arXiv:1912.01861

  37. She J, Tong Y, Chen L (2015) Utility-aware social event-participant planning. In: Proceedings of the 2015 ACM SIGMOD international conference on management of data, pp 1629–1643. ACM

  38. Wang W, Chen J, Wang J, Chen J, Gong Z (2019) Geography-aware inductive matrix completion for personalized point of interest recommendation in smart cities. IEEE Internet of Things Journal

  39. Yang J, Zhang Y, Hu H, Xing C (2019) A hierarchical index structure for region-aware spatial keyword search with edit distance constraint. In: International conference on database systems for advanced applications, pp 591–608. Springer

  40. Yang X, Zhou S, Cao M (2020) An approach to alleviate the sparsity problem of hybrid collaborative filtering based recommendations: the product-attribute perspective from user reviews. Mob Netw Applic 25(2):376–390

    Article  Google Scholar 

  41. Yelp Inc (2019) Yelp dataset challenge. Last Accessed: 01 Dec 2019

  42. Yiu ML, Dai X, Mamoulis N, Vaitis M (2007) Top-k spatial preference queries. In: 2007 IEEE 23rd International conference on data engineering, pp 1076–1085. IEEE

  43. Yu D, Wu Y, Liu C, Sun X (2019) Collective poi querying based on multiple keywords and user preference. In: International conference on database systems for advanced applications, pp 609–625. Springer

  44. Zhang C, Zhang Y, Zhang W, Lin X (2016) Inverted linear quadtree: efficient top k spatial keyword search. IEEE Trans Knowl Data Eng 28 (7):1706–1721

    Article  Google Scholar 

  45. Zhang D, Tan K-L, Tung AKH (2013) Scalable top-k spatial keyword search. In: Proceedings of the 16th international conference on extending database technology, pp 359–370. ACM

  46. Zhang Z, Jin P, Tian Y, Wan S, Yue L (2019) Efficient processing of spatial group preference queries. In: International conference on database systems for advanced applications, pp 642–659. Springer

Download references

Author information

Authors and Affiliations

  1. Shiv Nadar University, Delhi NCR, Greater Noida, India

    Saurabh Mishra & Sonia Khetarpaul

Authors
  1. Saurabh Mishra
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sonia Khetarpaul
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Sonia Khetarpaul.

Ethics declarations

The authors whose names are listed in this paper certify that they have no potential conflict of interest below mentioned:

– The authors did not receive support from any organization for the submitted work.

– The authors have NO affiliations with or involvement in any organization or entity other than the mentioned in the manuscript.

– The authors have no financial or proprietary interests in any material discussed in this article.

– The authors have no relevant non-financial interests to disclose.

We confirm that the manuscript has been read and approved by all named authors and that there are no other persons who satisfied the criteria for authorship but are not listed. We further confirm that the order of authors listed in the manuscript has been approved by all of us. We confirm that we have given due consideration to the protection of intellectual property associated with this work and that there are no impediments to publication, including the timing of publication, with respect to intellectual property. In so doing we confirm that we have followed the regulations of our institutions concerning intellectual property. We further confirm that any aspect of the work covered in this manuscript that has involved either experimental animals or human patients has been conducted with the ethical approval of all relevant bodies and that such approvals are acknowledged within the manuscript. We understand that the Corresponding Author is the sole contact for the Editorial process (including Editorial Manager and direct communications with the office). He/she is responsible for communicating with the other authors about progress, submissions of revisions and final approval of proofs.

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

Mishra, S., Khetarpaul, S. uR-tree: a spatial index structure for handling multiple point selection queries. Multimed Tools Appl 82, 8093–8111 (2023). https://doi.org/10.1007/s11042-022-13357-2

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11042-022-13357-2

Keywords

Search

Navigation