{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T17:08:45Z","timestamp":1710263325387},"reference-count":17,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"5","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. &amp; Syst."],"published-print":{"date-parts":[[2016]]},"DOI":"10.1587\/transinf.2015edp7422","type":"journal-article","created":{"date-parts":[[2016,4,30]],"date-time":"2016-04-30T22:11:27Z","timestamp":1462054287000},"page":"1326-1336","source":"Crossref","is-referenced-by-count":3,"title":["Efficient Evaluation of Maximizing Range Sum Queries in a Road Network"],"prefix":"10.1587","volume":"E99.D","author":[{"given":"Tien-Khoi","family":"PHAN","sequence":"first","affiliation":[{"name":"College of Information and Communication Engineering, Sungkyunkwan University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"HaRim","family":"JUNG","sequence":"additional","affiliation":[{"name":"College of Information and Communication Engineering, Sungkyunkwan University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hee Yong","family":"YOUN","sequence":"additional","affiliation":[{"name":"College of Information and Communication Engineering, Sungkyunkwan University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ung-Mo","family":"KIM","sequence":"additional","affiliation":[{"name":"College of Information and Communication Engineering, Sungkyunkwan University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","unstructured":"[1] D.-W. Choi, C.-W. Chung, and Y. Tao, \u201cA Scalable Algorithm for Maximizing Range Sum in Spatial Databases,\u201d Proc. VLDB, vol.5, no.11, pp.1088-1099, 2012."},{"key":"2","doi-asserted-by":"crossref","unstructured":"[2] H. Imai and T. Asano, \u201cFinding the connected components and a maximum clique of an intersection graph of rectangles in the plane,\u201d J. Algorithms, vol.4, no.4, pp.310-323, 1983.","DOI":"10.1016\/0196-6774(83)90012-3"},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] T.K. Phan, H.R. Jung, and U.M. Kim, \u201cAn Efficient Algorithm for Maximizing Range Sum Queries in a Road Network,\u201d The Scientific World Journal, Volume 2014.","DOI":"10.1155\/2014\/541602"},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] S.C. Nandy and B.B. Bhattacharya, \u201cA unified algorithm for finding maximum and minimum object enclosing rectangles and cuboids,\u201d Comput. Math. Appl., vol.29, no.8, pp.45-61, 1995.","DOI":"10.1016\/0898-1221(95)00029-X"},{"key":"5","doi-asserted-by":"crossref","unstructured":"[5] M.L. Yiu and N. Mamoulis, \u201cClustering Objects on Spatial Network,\u201d SIGMOD, pp.443-454, 2004.","DOI":"10.1145\/1007568.1007619"},{"key":"6","unstructured":"[6] I. Kamel and C. Faloutsos, \u201cHilbert R-tree: An improved R-tree using fractals,\u201d Proc. VLDB, pp.500-509, Sept. 1994."},{"key":"7","doi-asserted-by":"crossref","unstructured":"[7] D. Zhang, \u201cB Tree,\u201d in Handbook of Data Structures and Applications, ed. D.P. Mehta and S. Sahni, pp.15-1-15-21, Chapman and Hall\/CRC, 2004.","DOI":"10.1201\/9781420035179"},{"key":"8","doi-asserted-by":"crossref","unstructured":"[8] Y. Manolopoulos, A. Nanopoulos, A.N. Papadopoulos, and Y. Theodoridis, \u201cThe Hilbert R-tree,\u201d in R-Trees: Theory and Applications, pp.20-22, Springer-Verlag, London, 2006.","DOI":"10.1007\/978-1-84628-293-5"},{"key":"9","unstructured":"[9] J.V.d. Bercken, B. Blohsfeld, J.-P. Dittrich, J. Kr\u00e4mer, T. Sch\u00e4fer, M. Schneider, and B. Seeger, \u201cXXL-A library approach to supporting efficient implementations of advanced database queries,\u201d Proc. VLDB, pp.39-49, 2001."},{"key":"10","doi-asserted-by":"crossref","unstructured":"[10] T. Brinkhoff, \u201cA framework for generating network-based moving objects,\u201d GeoInformatica, vol.6, no.2, pp.153-180, 2002.","DOI":"10.1023\/A:1015231126594"},{"key":"11","unstructured":"[11] S. Cabello, J.M. D\u00edaz-B\u00e1\u00f1ez, S. Langerman, C. Seara, and I. Ventura, \u201cReverse facility location problems,\u201d CCCG, pp.68-71, 2005."},{"key":"12","unstructured":"[12] R.C.-W. Wong, M.T. \u00d6zsu, P.S. Yu, A.W.-C. Fu, and L. Liu, \u201cEfficient method for maximizing bichromatic reverse nearest neighbor,\u201d Proc. VLDB, vol.2, no.1, pp.1126-1137, 2009."},{"key":"13","unstructured":"[13] Y. Du, D. Zhang, and T. Xia, \u201cThe optimal-location query,\u201d Advances in Spatial and Temporal Databases, Lecture Notes in Computer Science, vol.3633, pp.163-180, Springer Berlin Heidelberg, 2005."},{"key":"14","unstructured":"[14] D. Zhang, Y. Du, T. Xia, and Y. Tao, \u201cProgressive computation of the min-dist optimal-location query,\u201d PVLDB 2006, pp.643-654."},{"key":"15","doi-asserted-by":"crossref","unstructured":"[15] X. Xiao, B. Yao, and F. Li, \u201cOptimal location queries in road network databases,\u201d 2011 IEEE 27th International Conference on Data Engineering, pp.804-815, 2011.","DOI":"10.1109\/ICDE.2011.5767845"},{"key":"16","doi-asserted-by":"crossref","unstructured":"[16] D.-W. Choi, C.-W. Chung, and Y. Tao, \u201cMaximizing Range Sum in External Memory,\u201d ACM Trans. Database Syst., vol.39, no.3, pp.1-44, 2014.","DOI":"10.1145\/2629477"},{"key":"17","doi-asserted-by":"crossref","unstructured":"[17] A. Gajentaan and M.H. Overmars, \u201cOn a class of <i>O<\/i>(<i>n<\/i><sup>2<\/sup>) problems in computational geometry,\u201d Computational Geometry, vol.5, no.3, pp.165-185, 1995.","DOI":"10.1016\/0925-7721(95)00022-2"}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E99.D\/5\/E99.D_2015EDP7422\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,19]],"date-time":"2022-06-19T12:36:36Z","timestamp":1655642196000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E99.D\/5\/E99.D_2015EDP7422\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"references-count":17,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2016]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2015edp7422","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"value":"0916-8532","type":"print"},{"value":"1745-1361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}