{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T16:46:18Z","timestamp":1762015578723},"reference-count":40,"publisher":"Oxford University Press (OUP)","issue":"11","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The Computer Journal"],"published-print":{"date-parts":[[2015,11]]},"DOI":"10.1093\/comjnl\/bxv016","type":"journal-article","created":{"date-parts":[[2015,3,5]],"date-time":"2015-03-05T01:13:47Z","timestamp":1425518027000},"page":"2928-2943","source":"Crossref","is-referenced-by-count":3,"title":["Impact Set: Computing Influence Using Query Logs"],"prefix":"10.1093","volume":"58","author":[{"given":"Shiyu","family":"Yang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Muhammad Aamir","family":"Cheema","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xuemin","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2015,3,3]]},"reference":[{"key":"2015102808332014000_58.11.2928.1","doi-asserted-by":"crossref","unstructured":"Korn F. Muthukrishnan S. (2000) Influence Sets Based on Reverse Nearest Neighbor Queries. SIGMOD, Dallas, Texas, USA, May 16\u201318, pp. 201\u2013212. ACM Press, New York, NY, USA.","DOI":"10.1145\/342009.335415"},{"key":"2015102808332014000_58.11.2928.2","unstructured":"Yang C. Lin K.-I. (2001) An Index Structure for Efficient Reverse Nearest Neighbor Queries. ICDE, Heidelberg, DE, April 2\u20136, pp. 485\u2013492. IEEE Computer Society Press, Washington, DC, USA."},{"key":"2015102808332014000_58.11.2928.3","unstructured":"Lin K.-I. Nolen M. Yang C. (2003) Applying Bulk Insertion Techniques for Dynamic Reverse Nearest Neighbor Problems. IDEAS, Los Alamitos, CA, USA, July 16\u201318, pp. 290\u2013297. IEEE Computer Society Press, Washington, DC, USA."},{"key":"2015102808332014000_58.11.2928.4","unstructured":"Stanoi I. Agrawal D. Abbadi A.E. (2000) Reverse Nearest Neighbor Queries for Dynamic Databases. SIGMOD, Dallas, TX, USA, May 16\u201318, pp. 44\u201353. ACM Press, New York, NY, USA."},{"key":"2015102808332014000_58.11.2928.5","doi-asserted-by":"crossref","unstructured":"Achtert E. Kriegel H.-P. Kr\u00f6ger P. Renz M. Z\u00fcfle A. (2009) Reverse $k$ -Nearest Neighbor Search in Dynamic and General Metric Databases. EDBT, Saint Petersburg, Russia, March 23\u201326, pp. 886\u2013897. ACM Press, New York, NY, USA.","DOI":"10.1145\/1516360.1516462"},{"key":"2015102808332014000_58.11.2928.6","doi-asserted-by":"crossref","unstructured":"Sharifzadeh M. Shahabi C. (2010) Vor-tree: R-trees with Voronoi diagrams for efficient processing of spatial nearest neighbor queries. PVLDB, 3, 1231\u20131242.","DOI":"10.14778\/1920841.1920994"},{"key":"2015102808332014000_58.11.2928.7","doi-asserted-by":"crossref","unstructured":"Wu W. Yang F. Chan C.Y. Tan K.-L. (2008) Finch: evaluating reverse k-nearest-neighbor queries on location data. PVLDB, 1, 1056\u20131067.","DOI":"10.14778\/1453856.1453970"},{"key":"2015102808332014000_58.11.2928.8","unstructured":"Stanoi I. Riedewald M. Agrawal D. Abbadi A.E. (2001) Discovery of Influence Sets in Frequently Updated Databases. VLDB, Roma, Italy, September 11\u201314, pp. 99\u2013108. Morgan Kaufmann, San Francisco, CA, USA."},{"key":"2015102808332014000_58.11.2928.9","doi-asserted-by":"crossref","unstructured":"Kang J.M. Mokbel M.F. Shekhar S. Xia T. Zhang D. (2007) Continuous Evaluation of Monochromatic and Bichromatic Reverse Nearest Neighbors. ICDE, Istanbul, TR, April 15\u201320, pp. 806\u2013815. IEEE Computer Society Press, Washington, DC, USA.","DOI":"10.1109\/ICDE.2007.367926"},{"key":"2015102808332014000_58.11.2928.10","doi-asserted-by":"crossref","unstructured":"Cheema M.A. Lin X. Zhang W. Zhang Y. (2011) Influence Zone: Efficiently Processing Reverse $k$ -Nearest Neighbors Queries. ICDE, Hannover, DE, April 11\u201316, pp. 577\u2013588. IEEE Computer Society Press, Washington, DC, USA.","DOI":"10.1109\/ICDE.2011.5767904"},{"key":"2015102808332014000_58.11.2928.11","doi-asserted-by":"crossref","unstructured":"Yang S. Cheema M.A. Lin X. Wang W. (2015) Reverse $k$ -nearest neighbors query processing: experiments and analysis. PVLDB, 8, 605\u2013616.","DOI":"10.14778\/2735479.2735492"},{"key":"2015102808332014000_58.11.2928.12","doi-asserted-by":"crossref","unstructured":"Cheema M.A. Lin X. Zhang Y. Wang W. Zhang W. (2009) Lazy updates: An efficient technique to continuously monitoring reverse knn. PVLDB, 2, 1138\u20131149.","DOI":"10.14778\/1687627.1687755"},{"key":"2015102808332014000_58.11.2928.13","unstructured":"Mouratidis K. Yiu M.L. Papadias D. Mamoulis N. (2006) Continuous Nearest Neighbor Monitoring in Road Networks. VLDB, Seoul, Korea, September 12\u201315, pp. 43\u201354. ACM Press, New York, NY, USA."},{"key":"2015102808332014000_58.11.2928.14","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/bxt115"},{"key":"2015102808332014000_58.11.2928.15","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2009.108"},{"key":"2015102808332014000_58.11.2928.16","doi-asserted-by":"crossref","unstructured":"Bernecker T. Emrich T. Kriegel H.-P. Mamoulis N. Renz M. Z\u00fcfle A. (2011) A Novel Probabilistic Pruning Approach to Speed Up Similarity Queries in Uncertain Databases. ICDE, Hannover, DE, April 11\u201316, pp. 339\u2013350. IEEE Computer Society Press, Washington, DC, USA.","DOI":"10.1109\/ICDE.2011.5767908"},{"key":"2015102808332014000_58.11.2928.17","doi-asserted-by":"crossref","unstructured":"Bernecker T. Emrich T. Kriegel H.-P. Renz M. Z\u00fcfle S.Z.A. (2011) Efficient probabilistic reverse nearest neighbor query processing on uncertain data. PVLDB, 4, 669\u2013680.","DOI":"10.14778\/2021017.2021024"},{"key":"2015102808332014000_58.11.2928.18","doi-asserted-by":"crossref","unstructured":"Kriegel H.-P. Kr\u00f6ger P. Renz M. Z\u00fcfle A. Katzdobler A. (2009) Incremental Reverse Nearest Neighbor Ranking. ICDE, Shanghai, CN, March 29\u2013April 2, pp. 1560\u20131567. IEEE Computer Society Press, Washington, DC, USA.","DOI":"10.1109\/ICDE.2009.144"},{"key":"2015102808332014000_58.11.2928.19","doi-asserted-by":"crossref","unstructured":"Emrich T. Kriegel H.-P. Kr\u00f6ger P. Renz M. Z\u00fcfle A. (2009) Incremental Reverse Nearest Neighbor Ranking in Vector Spaces. SSTD, Aalborg, DE, July 8\u201310, pp. 265\u2013282. Springer, Berlin, Heidelberg.","DOI":"10.1007\/978-3-642-02982-0_18"},{"key":"2015102808332014000_58.11.2928.20","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-011-0235-9"},{"key":"2015102808332014000_58.11.2928.21","doi-asserted-by":"publisher","DOI":"10.1007\/s00530-009-0167-z"},{"key":"2015102808332014000_58.11.2928.22","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/bxq068"},{"key":"2015102808332014000_58.11.2928.23","doi-asserted-by":"crossref","unstructured":"Tao Y. Papadias D. Lian X. (2004) Reverse knn Search in Arbitrary Dimensionality. VLDB, Toronto, Canada, August 31\u2013September 3, pp. 744\u2013755. Morgan Kaufmann, San Francisco, CA, USA.","DOI":"10.1016\/B978-012088469-8.50066-8"},{"key":"2015102808332014000_58.11.2928.24","doi-asserted-by":"crossref","unstructured":"Yang S. Cheema M.A. Lin X. Zhang Y. (2014) SLICE: Reviving Regions-Based Pruning for Reverse $k$ -Nearest Neighbors Queries. ICDE, Chicago, IL, USA, March 31\u2013April 1, pp. 760\u2013771. IEEE Computer Society Press, Washington, DC, USA.","DOI":"10.1109\/ICDE.2014.6816698"},{"key":"2015102808332014000_58.11.2928.25","doi-asserted-by":"crossref","unstructured":"Preparata F.P. Shamos M.I. (1985) Computational Geometry An Introduction. Springer, Berlin.","DOI":"10.1007\/978-1-4612-1098-6"},{"key":"2015102808332014000_58.11.2928.26","doi-asserted-by":"crossref","unstructured":"Emrich T. Kriegel H. Kr\u00f6ger P. Renz M. Z\u00fcfle A. (2010) Boosting Spatial Pruning: On Optimal Pruning of mbrs. SIGMOD, Indianapolis, Indiana, USA, June 6\u201310, pp. 39\u201350. ACM Press, New York, USA.","DOI":"10.1145\/1807167.1807174"},{"key":"2015102808332014000_58.11.2928.27","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-008-0123-0"},{"key":"2015102808332014000_58.11.2928.28","doi-asserted-by":"crossref","unstructured":"Ghaemi P. Shahabi K. Wilson J.P. Banaei-Kashani F. (2012) Continuous Maximal Reverse Nearest Neighbor Query on Spatial Networks. SIGSPATIAL, Redondo Beach, CA, USA, November 6\u20139, pp. 61\u201370. ACM Press, New York, NY, USA.","DOI":"10.1145\/2424321.2424330"},{"key":"2015102808332014000_58.11.2928.29","doi-asserted-by":"crossref","unstructured":"Du Y. Zhang D. Xia T. (2005) The Optimal-Location Query. SSTD, Angra dos Reis, BR, August 22\u201324, pp. 163\u2013180. Springer, Berlin, Heidelberg.","DOI":"10.1007\/11535331_10"},{"key":"2015102808332014000_58.11.2928.30","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2009.81"},{"key":"2015102808332014000_58.11.2928.31","doi-asserted-by":"crossref","unstructured":"Qi J. Zhang R. Kulik L. Lin D. Xue Y. (2012) The Min-Dist Location Selection Query. ICDE, Washington, DC, USA, April 1\u20135, pp. 366\u2013377. IEEE Computer Society Press, Washington, DC, USA.","DOI":"10.1109\/ICDE.2012.45"},{"key":"2015102808332014000_58.11.2928.32","unstructured":"Zhang D. Du Y. Xia T. Tao Y. (2006) Progressive Computation of the Min-Dist Optimal-Location Query. VLDB, Seoul, Korea, September 12\u201315, pp. 643\u2013654. ACM Press, New York, NY, USA."},{"key":"2015102808332014000_58.11.2928.33","doi-asserted-by":"crossref","unstructured":"Xiao X. Yao B. Li F. (2011) Optimal Location Queries in Road Network Databases. ICDE, Hannover, DE, April 11\u201316, pp. 804\u2013815. IEEE Computer Society Press, Washington, DC, USA.","DOI":"10.1109\/ICDE.2011.5767845"},{"key":"2015102808332014000_58.11.2928.34","unstructured":"Cardinal J. Langerman S. (2006) Min-Max-Min Geometric Facility Location Problems. EWCG, Delphi, Greece, March 27\u201329, pp. 149\u2013152."},{"key":"2015102808332014000_58.11.2928.35","unstructured":"Cabello S. Langerman S. Seara C. Ventura I. (2005) Reverse Facility Location Problems. CCCG, Ontario, CA, August 10\u201312, pp. 68\u201371."},{"key":"2015102808332014000_58.11.2928.36","doi-asserted-by":"crossref","unstructured":"Wong R.C.-W. (2009) Efficient method for maximizing bichromatic reverse nearest neighbor. PVLDB, 2, 1126\u20131137.","DOI":"10.14778\/1687627.1687754"},{"key":"2015102808332014000_58.11.2928.37","doi-asserted-by":"crossref","unstructured":"Zhou Z. Wu W. Li X. Lee M.L. Hsu W. (2011) Maxfirst for maxbrknn. ICDE, Hannover, DE, April 11\u201316, pp. 828\u2013839. IEEE Computer Society Press, Washington, DC, USA.","DOI":"10.1109\/ICDE.2011.5767892"},{"key":"2015102808332014000_58.11.2928.38","unstructured":"Xia T. Zhang D. Kanoulas E. Du Y. (2005) On Computing Top-t Most Influential Spatial Sites. PVLDB, Trondheim, Norway, August 30\u2013September 2, pp. 946\u2013957. ACM Press, New York, NY, USA."},{"key":"2015102808332014000_58.11.2928.39","doi-asserted-by":"crossref","unstructured":"Huang J. Wen Z. Qi J. Zhang R. Chen J. He Z. (2011) Top-k Most Influential Locations Selection. CIKM, Glasgow, Scotland, UK, October 24\u201328, pp. 2377\u20132380. ACM Press, New York, NY, USA.","DOI":"10.1145\/2063576.2063971"},{"key":"2015102808332014000_58.11.2928.40","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-012-0265-y"}],"container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/comjnl\/article-pdf\/58\/11\/2928\/5153820\/bxv016.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,1]],"date-time":"2022-05-01T12:20:09Z","timestamp":1651407609000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comjnl\/article-lookup\/doi\/10.1093\/comjnl\/bxv016"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,3,3]]},"references-count":40,"journal-issue":{"issue":"11","published-online":{"date-parts":[[2015,10,28]]},"published-print":{"date-parts":[[2015,11]]}},"alternative-id":["10.1093\/comjnl\/bxv016"],"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxv016","relation":{},"ISSN":["0010-4620","1460-2067"],"issn-type":[{"type":"print","value":"0010-4620"},{"type":"electronic","value":"1460-2067"}],"subject":[],"published":{"date-parts":[[2015,3,3]]}}}