{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T20:21:15Z","timestamp":1740169275260,"version":"3.37.3"},"reference-count":30,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2022]]},"DOI":"10.1109\/access.2022.3188396","type":"journal-article","created":{"date-parts":[[2022,7,4]],"date-time":"2022-07-04T19:58:34Z","timestamp":1656964714000},"page":"78576-78587","source":"Crossref","is-referenced-by-count":0,"title":["MGR: Efficiently Processing Maximal Group Reverse k Nearest Neighbors Queries"],"prefix":"10.1109","volume":"10","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8719-2847","authenticated-orcid":false,"given":"Xin","family":"Meng","sequence":"first","affiliation":[{"name":"School of Software Engineering, East China Normal University, Shanghai, China"}]},{"given":"Guojie","family":"Ma","sequence":"additional","affiliation":[{"name":"School of Software Engineering, East China Normal University, Shanghai, China"}]},{"given":"Shiyu","family":"Yang","sequence":"additional","affiliation":[{"name":"Cyberspace Institute of Advanced Technology, Guangzhou University, Guangzhou, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3049-9917","authenticated-orcid":false,"given":"Liping","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Software Engineering, East China Normal University, Shanghai, China"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/335191.335415"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2009.108"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2011.5767908"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-37487-6_34"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ICISCE.2016.50"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2017.05.095"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/MDM.2008.31"},{"issue":"3","key":"ref8","first-page":"523","article-title":"A pruning based continuous RkNN query algorithm for large k","volume":"21","author":"Wang","year":"2012","journal-title":"Chin. J. Electron."},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.2991\/iccasm.2012.391"},{"issue":"6","key":"ref10","first-page":"540","article-title":"A safe exit approach for continuous monitoring of reverse k-nearest neighbors in road networks","volume":"12","author":"Attique","year":"2015","journal-title":"Int. Arab J. Inf. Technol."},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2006.1599391"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s00530-009-0167-z"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-14977-6_10"},{"key":"ref14","article-title":"Graph based nearest neighbor search: Promises and failures","volume-title":"arXiv:1904.02077","author":"Lin","year":"2019"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/bxv016"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.14778\/2735479.2735492"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2001.914862"},{"key":"ref18","first-page":"290","article-title":"Applying bulk insertion techniques for dynamic reverse nearest neighbor problems","volume-title":"Proc. 7th Int. Database Eng. Appl. Symp.","author":"Lin"},{"article-title":"Reverse KNN search in arbitrary dimensionality","volume-title":"Proc. Very Large Data Bases Conf. (VLDB)","author":"Tao","key":"ref19"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453970"},{"key":"ref21","article-title":"Reverse nearest neighbor queries for dynamic databases","volume-title":"Proc. ACM SIGMOD Workshop Res. Issues Data Mining Knowl. Discovery","volume":"20","author":"Stanoi"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2014.6816698"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-016-0445-2"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.3724\/SP.J.1016.2010.02229"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-92013-9_21"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/2063576.2063971"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/WISA.2017.40"},{"volume-title":"Poi Data Sets","year":"2022","key":"ref28"},{"volume-title":"Tiger\/Line Shapefiles","year":"2022","key":"ref29"},{"volume-title":"Real Datasets for Spatial Databases: Road Networks Points Interest","year":"2022","key":"ref30"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/9668973\/09815062.pdf?arnumber=9815062","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T03:54:22Z","timestamp":1706759662000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9815062\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"references-count":30,"URL":"https:\/\/doi.org\/10.1109\/access.2022.3188396","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2022]]}}}