{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T22:35:56Z","timestamp":1649111756085},"reference-count":18,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. &amp; Syst."],"published-print":{"date-parts":[[2018]]},"DOI":"10.1587\/transinf.2017dap0007","type":"journal-article","created":{"date-parts":[[2018,3,31]],"date-time":"2018-03-31T18:29:40Z","timestamp":1522520980000},"page":"1012-1020","source":"Crossref","is-referenced-by-count":1,"title":["Efficient Methods for Aggregate Reverse Rank Queries"],"prefix":"10.1587","volume":"E101.D","author":[{"given":"Yuyang","family":"DONG","sequence":"first","affiliation":[{"name":"Department of Computer Science, Graduate School of Systems and Information Engineering, University of Tsukuba"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hanxiong","family":"CHEN","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Graduate School of Systems and Information Engineering, University of Tsukuba"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kazutaka","family":"FURUSE","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Graduate School of Systems and Information Engineering, University of Tsukuba"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hiroyuki","family":"KITAGAWA","sequence":"additional","affiliation":[{"name":"Center for Computational Sciences, University of Tsukuba"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"publisher","unstructured":"[1] Z. Zhang, C. Jin, and Q. Kang, \u201cReverse k-ranks query,\u201d Proc. VLDB Endow., vol.7, no.10, pp.785-796, 2014. 10.14778\/2732951.2732952","DOI":"10.14778\/2732951.2732952"},{"key":"2","doi-asserted-by":"crossref","unstructured":"[2] Y. Dong, H. Chen, K. Furuse, and H. Kitagawa, \u201cAggregate reverse rank queries,\u201d Database and Expert Systems Applications, Lecture Notes in Computer Science, vol.9828, pp.87-101, Springer International Publishing, Cham, 2016. 10.1007\/978-3-319-44406-2_8","DOI":"10.1007\/978-3-319-44406-2_8"},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] A. Vlachou, C. Doulkeridis, and e. Yannis Kotidis, \u201cBranch-and-bound algorithm for reverse top-k queries.,\u201d SIGMOD Conference, pp.481-492, 2013. 10.1145\/2463676.2465278","DOI":"10.1145\/2463676.2465278"},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] A. Vlachou, C. Doulkeridis, Y. Kotidis, and K. Norvag, \u201cReverse top-k queries,\u201d ICDE 2010, pp.365-376, 2010. 10.1109\/icde.2010.5447890","DOI":"10.1109\/ICDE.2010.5447890"},{"key":"5","unstructured":"[5] D. Pelleg and A.W. Moore, \u201cX-means: Extending k-means with efficient estimation of the number of clusters,\u201d Proceedings of the Seventeenth International Conference on Machine Learning (ICML 2000), Stanford University, Stanford, CA, USA, June 29-July 2, 2000, pp.727-734, 2000."},{"key":"6","doi-asserted-by":"crossref","unstructured":"[6] P. Ram and A.G. Gray, \u201cMaximum inner-product search using cone trees,\u201d The 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD &apos;12, Beijing, China, Aug. 12-16, 2012, pp.931-939, 2012. 10.1145\/2339530.2339677","DOI":"10.1145\/2339530.2339677"},{"key":"7","doi-asserted-by":"publisher","unstructured":"[7] I.F. Ilyas, G. Beskales, and M.A. Soliman, \u201cA survey of top-<i>k<\/i> query processing techniques in relational database systems,\u201d ACM Comput. Surv., vol.40, no.4, pp.1-58, 2008. 10.1145\/1391729.1391730","DOI":"10.1145\/1391729.1391730"},{"key":"8","unstructured":"[8] Y. Dong, H. Chen, J.X. Yu, K. Furuse, and H. Kitagawa, \u201cGrid-index algorithm for reverse rank queries,\u201d Proceedings of the 20th International Conference on Extending Database Technology, EDBT 2017, Venice, Italy, March 21-24, 2017, pp.306-317, 2017."},{"key":"9","doi-asserted-by":"publisher","unstructured":"[9] F. Korn and S. Muthukrishnan, \u201cInfluence sets based on reverse nearest neighbor queries,\u201d Proc. 2000 ACM SIGMOD, vol.29, no.2, pp.201-212, 2000. 10.1145\/335191.335415","DOI":"10.1145\/335191.335415"},{"key":"10","doi-asserted-by":"crossref","unstructured":"[10] B. Yao, F. Li, and P. Kumar, \u201cReverse furthest neighbors in spatial databases,\u201d Proc. 25th ICDE, pp.664-675, 2009. 10.1109\/icde.2009.62","DOI":"10.1109\/ICDE.2009.62"},{"key":"11","doi-asserted-by":"publisher","unstructured":"[11] S. Yang, M.A. Cheema, X. Lin, and W. Wang, \u201cReverse k nearest neighbors query processing: Experiments and analysis,\u201d Proc. VLDB Endow., vol.8, no.5, pp.605-616, 2015. 10.14778\/2735479.2735492","DOI":"10.14778\/2735479.2735492"},{"key":"12","unstructured":"[12] I. Stanoi, D. Agrawal, and A. El Abbadi, \u201cReverse nearest neighbor queries for dynamic databases,\u201d ACM SIGMOD Workshop, pp.44-53, 2000."},{"key":"13","doi-asserted-by":"crossref","unstructured":"[13] Y. Tao, D. Papadias, and X. Lian, \u201cReverse knn search in arbitrary dimensionality,\u201d Proc. 13th International Conference on VLDB, pp.744-755, 2004. 10.1016\/b978-012088469-8\/50066-8","DOI":"10.1016\/B978-012088469-8.50066-8"},{"key":"14","doi-asserted-by":"publisher","unstructured":"[14] Y. Tao, D. Papadias, X. Lian, and X. Xiao, \u201cMultidimensional reverse <i>k<\/i> NN search,\u201d The VLDB Journal, vol.16, no.3, pp.293-316, 2007. 10.1007\/s00778-005-0168-2","DOI":"10.1007\/s00778-005-0168-2"},{"key":"15","doi-asserted-by":"crossref","unstructured":"[15] M.A. Cheema, X. Lin, W. Zhang, and Y. Zhang, \u201cInfluence zone:Efficiently processing reverse k nearest neighbors queries,\u201d Proc. 27th ICDE 2011, pp.577-588, 2011. 10.1109\/icde.2011.5767904","DOI":"10.1109\/ICDE.2011.5767904"},{"key":"16","doi-asserted-by":"crossref","unstructured":"[16] S. Yang, M.A. Cheema, X. Lin, and Y. Zhang, \u201cSLICE: reviving regions-based pruning for reverse k nearest neighbors queries,\u201d IEEE 30th International Conference on Data Engineering, ICDE, pp.760-771, 2014. 10.1109\/icde.2014.6816698","DOI":"10.1109\/ICDE.2014.6816698"},{"key":"17","doi-asserted-by":"crossref","unstructured":"[17] X. Lian and L. Chen, \u201cMonochromatic and bichromatic reverse skyline search over uncertain databases,\u201d Proc. ACM SIGMOD, pp.213-226, 2008. 10.1145\/1376616.1376641","DOI":"10.1145\/1376616.1376641"},{"key":"18","unstructured":"[18] E. Dellis and B. Seeger, \u201cEfficient computation of reverse skyline queries,\u201d Proc. 33rd International Conference on VLDB, pp.291-302, 2007."}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E101.D\/4\/E101.D_2017DAP0007\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,13]],"date-time":"2019-10-13T17:33:16Z","timestamp":1570987996000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E101.D\/4\/E101.D_2017DAP0007\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"references-count":18,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2018]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2017dap0007","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"value":"0916-8532","type":"print"},{"value":"1745-1361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]}}}