{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T01:37:01Z","timestamp":1725673021925},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642290343"},{"type":"electronic","value":"9783642290350"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29035-0_8","type":"book-chapter","created":{"date-parts":[[2012,4,5]],"date-time":"2012-04-05T08:34:01Z","timestamp":1333614841000},"page":"111-125","source":"Crossref","is-referenced-by-count":0,"title":["Colored Range Searching on Internal Memory"],"prefix":"10.1007","author":[{"given":"Haritha","family":"Bellam","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Saladi","family":"Rahul","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Krishnan","family":"Rajan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8_CR1","unstructured":"http:\/\/www.mcobject.com\/in_memory_database"},{"key":"8_CR2","unstructured":"http:\/\/www.ics.uci.edu\/mlearn\/MLRepository.html"},{"key":"8_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/3-540-45749-6_6","volume-title":"Algorithms - ESA 2002","author":"P.K. Agarwal","year":"2002","unstructured":"Agarwal, P.K., Govindarajan, S., Muthukrishnan, S.: Range Searching in Categorical Data: Colored Range Searching on Grid. In: M\u00f6hring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol.\u00a02461, pp. 17\u201328. Springer, Heidelberg (2002)"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Beckmann, N., Kriegel, H.-P., Schneider, R., Seeger, B.: The R*-Tree: An Efficient and Robust Access Method for Points and Rectangles. In: ACM SIGMOD Conference, pp. 322\u2013331 (1990)","DOI":"10.1145\/93605.98741"},{"key":"8_CR5","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1145\/361002.361007","volume":"18","author":"J.L. Bentley","year":"1975","unstructured":"Bentley, J.L.: Multidimensional binary search trees used for associative searching. Communications of the ACM\u00a018, 509\u2013517 (1975)","journal-title":"Communications of the ACM"},{"key":"8_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04245-8","volume-title":"Computational geometry: algorithms and applications","author":"M. Berg de","year":"2000","unstructured":"de Berg, M., van Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational geometry: algorithms and applications. Springer, Heidelberg (2000)"},{"key":"8_CR7","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1006\/jagm.1995.1038","volume":"19","author":"P. Gupta","year":"1995","unstructured":"Gupta, P., Janardan, R., Smid, M.: Further results on generalized intersection searching problems: counting, reporting, and dynamization. Journal of Algorithms\u00a019, 282\u2013317 (1995)","journal-title":"Journal of Algorithms"},{"key":"8_CR8","volume-title":"Handbook of Data Structures and Applications","author":"P. Gupta","year":"2005","unstructured":"Gupta, P., Janardan, R., Smid, M.: Computational geometry: Generalized intersection searching. In: Mehta, D., Sahni, S. (eds.) Handbook of Data Structures and Applications, ch. 64, pp. 64-1\u201364-17. Chapman & Hall\/CRC, Boca Raton, FL (2005)"},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"Guttman, A.: R-Trees: A Dynamic Index Structure for Spatial Searching. In: SIGMOD Conference, pp. 47\u201357 (1984)","DOI":"10.1145\/602259.602266"},{"key":"8_CR10","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1142\/S021819599300004X","volume":"3","author":"R. Janardan","year":"1993","unstructured":"Janardan, R., Lopez, M.: Generalized intersection searching problems. International Journal on Computational Geometry & Applications\u00a03, 39\u201369 (1993)","journal-title":"International Journal on Computational Geometry & Applications"},{"key":"8_CR11","unstructured":"Rahul, S., Gupta, P., Rajan, K.: Data Structures for Range Aggregation by Categories. In: 21st Canadian Conference on Computational Geometry (CCCG 2009), pp. 133\u2013136 (2009)"},{"key":"8_CR12","unstructured":"Rahul, S., Bellam, H., Gupta, P., Rajan, K.: Range aggregate structures for colored geometric objects. In: 22nd Canadian Conference on Computational Geometry (CCCG 2010), pp. 249\u2013252 (2010)"},{"key":"8_CR13","unstructured":"Sellis, T.K., Roussopoulos, N., Faloutsos, C.: The R+-Tree: A Dynamic Index for Multi-Dimensional Objects. In: 13th International Conference on Very Large Data Bases (VLDB 1987), pp. 507\u2013518 (1987)"},{"issue":"3","key":"8_CR14","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1016\/j.ipl.2005.04.008","volume":"95","author":"Q. Shi","year":"2005","unstructured":"Shi, Q., J\u00e1J\u00e1, J.: Optimal and near-optimal algorithms for generalized intersection reporting on pointer machines. Information Processing Letters\u00a095(3), 382\u2013388 (2005)","journal-title":"Information Processing Letters"},{"key":"8_CR15","doi-asserted-by":"crossref","unstructured":"Kumar, Y., Janardan, R., Gupta, P.: Efficient algorithms for reverse proximity query problems. In: GIS 2008, p.\u00a039 (2008)","DOI":"10.1145\/1463434.1463483"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29035-0_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T03:03:42Z","timestamp":1606187022000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-29035-0_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642290343","9783642290350"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29035-0_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}