{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T03:57:29Z","timestamp":1742961449676,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":27,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819972531"},{"type":"electronic","value":"9789819972548"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-981-99-7254-8_57","type":"book-chapter","created":{"date-parts":[[2023,10,21]],"date-time":"2023-10-21T05:01:47Z","timestamp":1697864507000},"page":"733-747","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Processing Reverse Nearest Neighbor Queries Based on Unbalanced Multiway Region Tree Index"],"prefix":"10.1007","author":[{"given":"Liang","family":"Zhu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shilan","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xin","family":"Song","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qin","family":"Ma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weiyi","family":"Meng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,10,21]]},"reference":[{"key":"57_CR1","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/s11280-021-00969-1","volume":"25","author":"N Allheeib","year":"2022","unstructured":"Allheeib, N., Adhinugraha, K., Taniar, D., Islam, M.S.: Computing reverse nearest neighbourhood on road maps. World Wide Web 25, 99\u2013130 (2022)","journal-title":"World Wide Web"},{"key":"57_CR2","unstructured":"Blackard, J.A., Dean, D.J., Anderson, C.W.:\u00a0UCI\u00a0repository\u00a0of\u00a0machine\u00a0learning\u00a0data-bases (1998). http:\/\/archive.ics.uci.edu\/ml\/datasets\/Covertype. Accessed 10 Aug 2022"},{"key":"57_CR3","doi-asserted-by":"crossref","unstructured":"Borodin, A.,\u00a0Ostrovsky, R., Rabani, Y.: Lower\u00a0bounds\u00a0for\u00a0high\u00a0dimensional\u00a0nearest\u00a0neighbor\u00a0search\u00a0and\u00a0related\u00a0problems. In: Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing (STOC 1999), pp. 312\u2013321 (1999)","DOI":"10.1145\/301250.301330"},{"key":"57_CR4","doi-asserted-by":"crossref","unstructured":"Bruno, N., Chaudhuri, S., Gravano, L.: STHoles: a multidimensional workload-aware histogram. In: Proceedings of the 2001 ACM SIGMOD International Conference on Management of Data (SIGMOD 2001), pp. 211\u2013222 (2001)","DOI":"10.1145\/375663.375686"},{"issue":"7","key":"57_CR5","doi-asserted-by":"publisher","first-page":"769","DOI":"10.14778\/3067421.3067426","volume":"10","author":"G Casanova","year":"2017","unstructured":"Casanova, G., et al.: Dimensional testing for reverse k-nearest neighbor search. Proc. VLDB Endowment 10(7), 769\u2013780 (2017)","journal-title":"Proc. VLDB Endowment"},{"key":"57_CR6","doi-asserted-by":"crossref","unstructured":"Chahal, H., Toner, H., Rahkovsky, I.: Small data\u2019s big AI potential. Center for Security and Emerging Technology (2021). https:\/\/cset.georgetown.edu\/publication\/small-datas-big-ai-potential\/. Accessed 26 July 2022","DOI":"10.51593\/20200075"},{"issue":"5","key":"57_CR7","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1007\/s00778-012-0265-y","volume":"21","author":"MA Cheema","year":"2012","unstructured":"Cheema, M.A., Zhang, W., Lin, X., Zhang, Y.: Efficiently processing snapshot and continuous reverse k nearest neighbors queries. VLDB J. 21(5), 703\u2013728 (2012)","journal-title":"VLDB J."},{"key":"57_CR8","doi-asserted-by":"crossref","unstructured":"Das, R., Biswas, S.K., Devi, D., Sarma, B.: An oversampling technique by integrating reverse nearest neighbor in SMOTE: Reverse-SMOTE. In: 2020 International Conference on Smart Electronics and Communication (ICOSEC), pp. 1239\u20131244 (2020)","DOI":"10.1109\/ICOSEC49089.2020.9215387"},{"issue":"4","key":"57_CR9","doi-asserted-by":"publisher","first-page":"614","DOI":"10.1016\/S0022-0000(03)00026-6","volume":"66","author":"R Fagin","year":"2003","unstructured":"Fagin, R., Lotem, A., Naor, M.: Optimal aggregation algorithms for middleware. J. Comput. Syst. Sci. 66(4), 614\u2013656 (2003)","journal-title":"J. Comput. Syst. Sci."},{"key":"57_CR10","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2020.104033","volume":"97","author":"Y-R Guo","year":"2021","unstructured":"Guo, Y.-R., Bai, Y.-Q., Li, C.-N., Shao, Y.-H., Ye, Y.-F., Jiang, C.-Z.: Reverse nearest neighbors bhattacharyya bound linear discriminant analysis for multimodal classification. Eng. Appl. Artif. Intell. 97, 104033 (2021)","journal-title":"Eng. Appl. Artif. Intell."},{"issue":"1","key":"57_CR11","doi-asserted-by":"publisher","first-page":"321","DOI":"10.4086\/toc.2012.v008a014","volume":"8","author":"S Har-Peled","year":"2012","unstructured":"Har-Peled, S., Indyk, P., Motwani, R.: Approximate nearest neighbor: towards removing the curse of dimensionality. Theory Comput. 8(1), 321\u2013350 (2012)","journal-title":"Theory Comput."},{"key":"57_CR12","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2021.115763","volume":"186","author":"L Hu","year":"2021","unstructured":"Hu, L., Liu, H., Zhang, J., Liu, A.: KR-DBSCAN: a density-based clustering algorithm based on reverse nearest neighbor and influence space. Expert Syst. Appl. 186, 115763 (2021)","journal-title":"Expert Syst. Appl."},{"issue":"4","key":"57_CR13","doi-asserted-by":"publisher","first-page":"1567","DOI":"10.1007\/s11280-022-01096-1","volume":"26","author":"P Jin","year":"2023","unstructured":"Jin, P., et al.: Maximizing the influence of bichromatic reverse k nearest neighbors in geo-social networks. World Wide Web 26(4), 1567\u20131598 (2023)","journal-title":"World Wide Web"},{"key":"57_CR14","doi-asserted-by":"crossref","unstructured":"Khedr, A.M., Raj, P.V.P.: DRNNA: decomposable reverse nearest neighbor algorithm for vertically distributed databases. In: 2021 18th International Multi-Conference on Systems, Signals & Devices (SSD), pp. 681\u2013686 (2021)","DOI":"10.1109\/SSD52085.2021.9429512"},{"issue":"2","key":"57_CR15","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1145\/335191.335415","volume":"29","author":"F Korn","year":"2000","unstructured":"Korn, F., Muthukrishnan, S.: Influence sets based on reverse nearest neighbor queries. ACM SIGMOD Rec. 29(2), 201\u2013212 (2000)","journal-title":"ACM SIGMOD Rec."},{"key":"57_CR16","unstructured":"Li, Y., Liu, G., Bai, M., Gao, J., Ye, L., Ming, Z.: CSD: Discriminance with conic section for improving reverse k nearest neighbors queries. arXiv:2005.08483 (2020)"},{"key":"57_CR17","unstructured":"Panetta, K.: Gartner top 10 data and analytics trends for 2021 (2021). https:\/\/www.gartner.com\/smarterwithgartner\/gartner-top-10-data-and-analytics-trends-for-2021. Accessed 15 July 2022"},{"issue":"1\u20132","key":"57_CR18","doi-asserted-by":"publisher","first-page":"1231","DOI":"10.14778\/1920841.1920994","volume":"3","author":"M Sharifzadeh","year":"2010","unstructured":"Sharifzadeh, M., Shahabi, C.: VoR-tree: R-trees with voronoi diagrams for efficient processing of spatial nearest neighbor queries. Proc. VLDB Endowment 3(1\u20132), 1231\u20131242 (2010)","journal-title":"Proc. VLDB Endowment"},{"key":"57_CR19","doi-asserted-by":"crossref","unstructured":"Singh, A., Ferhatosmano\u011flu, H., Tosun, A.\u015e.: High dimensional reverse nearest neighbor queries. In: Proceedings of the Twelfth International Conference on Information and Knowledge Management (CIKM 2003), pp. 91\u201398 (2003)","DOI":"10.1145\/956863.956882"},{"key":"57_CR20","doi-asserted-by":"crossref","unstructured":"Singh, V., Singh, A.K.: SIMP: accurate and efficient near neighbor search in high dimensional spaces. In: Proceedings of the 15th International Conference on Extending Database Technology (EDBT 2012), pp. 492\u2013503 (2012)","DOI":"10.1145\/2247596.2247654"},{"key":"57_CR21","unstructured":"Stanoi, I., Agrawal, D., Abbadi, A.E.: Reverse nearest neighbor queries for dynamic databases. In: ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, pp. 44\u201353 (2000)"},{"issue":"3","key":"57_CR22","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/s00778-005-0168-2","volume":"16","author":"Y Tao","year":"2007","unstructured":"Tao, Y., Papadias, D., Lian, X., Xiao, X.: Multi-dimensional reverse kNN search. VLDB J. 16(3), 293\u2013316 (2007)","journal-title":"VLDB J."},{"key":"57_CR23","unstructured":"U.S. Census Bureau. https:\/\/www2.census.gov\/geo\/tiger\/TGRGDB21\/. Accessed 24 July 2022"},{"key":"57_CR24","doi-asserted-by":"crossref","unstructured":"Wang, S., Zhang, Y., Lin, X., Cheema, M.A.: Maximize spatial influence of facility bundle considering reverse k nearest neighbors. In: Database Systems for Advanced Applications, DASFAA 2018, pp. 684\u2013700 (2018)","DOI":"10.1007\/978-3-319-91452-7_44"},{"issue":"1","key":"57_CR25","doi-asserted-by":"publisher","first-page":"1056","DOI":"10.14778\/1453856.1453970","volume":"1","author":"W Wu","year":"2008","unstructured":"Wu, W., Yang, F., Chan, C.-Y., Tan, K.-L.: FINCH: Evaluating reverse k-nearest-neighbor queries on location data. Proc. VLDB Endowment 1(1), 1056\u20131067 (2008)","journal-title":"Proc. VLDB Endowment"},{"issue":"2","key":"57_CR26","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/s00778-016-0445-2","volume":"26","author":"S Yang","year":"2017","unstructured":"Yang, S., Cheema, M.A., Lin, X., Zhang, Y., Zhang, W.: Reverse k nearest neighbors queries and spatial reverse top-k queries. VLDB J. 26(2), 151\u2013176 (2017)","journal-title":"VLDB J."},{"issue":"5","key":"57_CR27","doi-asserted-by":"publisher","first-page":"643","DOI":"10.14778\/3377369.3377374","volume":"13","author":"B Zheng","year":"2020","unstructured":"Zheng, B., Zhao, X., Weng, L., Hung, N.Q.V., Liu, H., Jensen, C.S.: PM-LSH: A fast and accurate LSH framework for high-dimensional approximate NN search. Proc. VLDB Endowment 13(5), 643\u2013655 (2020)","journal-title":"Proc. VLDB Endowment"}],"container-title":["Lecture Notes in Computer Science","Web Information Systems Engineering \u2013 WISE 2023"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-99-7254-8_57","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,21]],"date-time":"2023-10-21T05:11:31Z","timestamp":1697865091000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-99-7254-8_57"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9789819972531","9789819972548"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-981-99-7254-8_57","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"21 October 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WISE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Web Information Systems Engineering","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Melbourne, VIC","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 October 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 October 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wise2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.wise-conferences.org\/2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"137","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"33","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"40","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"24% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}