{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T15:03:40Z","timestamp":1768489420605,"version":"3.49.0"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319684734","type":"print"},{"value":"9783319684741","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-68474-1_18","type":"book-chapter","created":{"date-parts":[[2017,9,27]],"date-time":"2017-09-27T11:15:48Z","timestamp":1506510948000},"page":"262-272","source":"Crossref","is-referenced-by-count":2,"title":["Succinct Quadtrees for Road Data"],"prefix":"10.1007","author":[{"given":"Kazuki","family":"Ishiyama","sequence":"first","affiliation":[]},{"given":"Koji","family":"Kobayashi","sequence":"additional","affiliation":[]},{"given":"Kunihiko","family":"Sadakane","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,9,28]]},"reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"Arroyuelo, D., C\u00e1novas, R., Navarro, G., Sadakane, K.: Succinct trees in practice. In: Proceedings 11th Workshop on Algorithm Engineering and Experiments (ALENEX), pp. 84\u201397. SIAM Press (2010)","DOI":"10.1137\/1.9781611972900.9"},{"issue":"32","key":"18_CR2","doi-asserted-by":"crossref","first-page":"4200","DOI":"10.1016\/j.tcs.2011.01.037","volume":"412","author":"D Arroyuelo","year":"2011","unstructured":"Arroyuelo, D., et al.: Untangled monotonic chains and adaptive range search. Theor. Comput. Sci. 412(32), 4200\u20134211 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"18_CR3","unstructured":"Arya, S., Mount, D.M.: Approximate nearest neighbor queries in fixed dimensions. In: Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1993, pp. 271\u2013280, Philadelphia, PA, USA, 1993. Society for Industrial and Applied Mathematics (1993)"},{"issue":"4","key":"18_CR4","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1007\/s00453-004-1146-6","volume":"43","author":"D Benoit","year":"2005","unstructured":"Benoit, D., Demaine, E.D., Munro, J.I., Raman, R., Raman, V., Rao, S.S.: Representing trees of higher degree. Algorithmica 43(4), 275\u2013292 (2005)","journal-title":"Algorithmica"},{"issue":"9","key":"18_CR5","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1145\/361002.361007","volume":"18","author":"JL Bentley","year":"1975","unstructured":"Bentley, J.L.: Multidimensional binary search trees used for associative searching. Commun. ACM 18(9), 509\u2013517 (1975)","journal-title":"Commun. ACM"},{"key":"18_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/978-3-319-11918-2_21","volume-title":"String Processing and Information Retrieval","author":"NR Brisaboa","year":"2014","unstructured":"Brisaboa, N.R., de Bernardo, G., Konow, R., Navarro, G.: K\n          2-Treaps: Range Top-k Queries in Compact Space. In: Moura, E., Crochemore, M. (eds.) SPIRE 2014. LNCS, vol. 8799, pp. 215\u2013226. Springer, Cham (2014). doi:\n10.1007\/978-3-319-11918-2_21"},{"issue":"1","key":"18_CR7","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1016\/j.is.2013.08.003","volume":"39","author":"N Brisaboa","year":"2014","unstructured":"Brisaboa, N., Ladra, S., Navarro, G.: Compact representation of web graphs with extended functionality. Inf. Syst. 39(1), 152\u2013174 (2014)","journal-title":"Inf. Syst."},{"issue":"5","key":"18_CR8","doi-asserted-by":"crossref","first-page":"635","DOI":"10.1016\/j.is.2013.01.005","volume":"35","author":"N Brisaboa","year":"2013","unstructured":"Brisaboa, N., Luaces, M., Navarro, G., Seco, D.: Space-efficient representations of rectangle datasets supporting orthogonal range querying. Inf. Syst. 35(5), 635\u2013655 (2013)","journal-title":"Inf. Syst."},{"key":"18_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/978-3-319-02432-5_14","volume-title":"String Processing and Information Retrieval","author":"G Bernardo","year":"2013","unstructured":"Bernardo, G., \u00c1lvarez-Garc\u00eda, S., Brisaboa, N.R., Navarro, G., Pedreira, O.: Compact Querieable Representations of Raster Data. In: Kurland, O., Lewenstein, M., Porat, E. (eds.) SPIRE 2013. LNCS, vol. 8214, pp. 96\u2013108. Springer, Cham (2013). doi:\n10.1007\/978-3-319-02432-5_14"},{"issue":"1","key":"18_CR10","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1109\/TIT.1987.1057251","volume":"33","author":"P Elias","year":"1987","unstructured":"Elias, P., Interval, R.R., Coding, S.: Two on-line adaptive variable-length schemes. IEEE Trans. Inf. Theor. 33(1), 3\u201310 (1987)","journal-title":"IEEE Trans. Inf. Theor."},{"issue":"1","key":"18_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.comgeo.2013.08.002","volume":"47","author":"A Farzan","year":"2014","unstructured":"Farzan, A., Gagie, T., Navarro, G.: Entropy-bounded representation of point grids. Comput. Geom. Theory Appl. 47(1), 1\u201314 (2014)","journal-title":"Comput. Geom. Theory Appl."},{"issue":"1","key":"18_CR12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF00288933","volume":"4","author":"RA Finkel","year":"1974","unstructured":"Finkel, R.A., Bentley, J.L.: Quad trees a data structure for retrieval on composite keys. Acta Informatica 4(1), 1\u20139 (1974)","journal-title":"Acta Informatica"},{"key":"18_CR13","doi-asserted-by":"crossref","unstructured":"Gagie, T., Gonz\u00e1lez-Nova, J.., Ladra, S., Navarro, G., Seco, D.: Faster compressed quadtrees. In: Proceedings 25th Data Compression Conference (DCC), pp. 93\u2013102 (2015)","DOI":"10.1109\/DCC.2015.57"},{"issue":"2","key":"18_CR14","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1137\/S0097539702402354","volume":"35","author":"R Grossi","year":"2005","unstructured":"Grossi, R., Vitter, J.S.: Compressed suffix arrays and suffix trees with applications to text indexing and string matching. SIAM J. Comput. 35(2), 378\u2013407 (2005)","journal-title":"SIAM J. Comput."},{"key":"18_CR15","doi-asserted-by":"crossref","unstructured":"Hoel, E.G., Samet, H.: A qualitative comparison study of data structures for large line segment databases. In: Proceedings of the 1992 ACM SIGMOD international conference on Management of data - SIGMOD 1992, vol. 21, pp. 205\u2013214, New York, USA, 1992. ACM Press (1992)","DOI":"10.1145\/130283.130316"},{"issue":"2","key":"18_CR16","doi-asserted-by":"crossref","first-page":"619","DOI":"10.1016\/j.jcss.2011.09.002","volume":"78","author":"J Jansson","year":"2012","unstructured":"Jansson, J., Sadakane, K., Sung, W.-K.: Ultra-succinct representation of ordered trees with applications. J. Comput. Syst. Sci. 78(2), 619\u2013631 (2012)","journal-title":"J. Comput. Syst. Sci."},{"key":"18_CR17","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1016\/j.tcs.2012.11.031","volume":"482","author":"G Navarro","year":"2013","unstructured":"Navarro, G., Nekrich, Y., Russo, L.: Space-efficient data-analysis queries on grids. Theoret. Comput. Sci. 482, 60\u201372 (2013)","journal-title":"Theoret. Comput. Sci."},{"key":"18_CR18","doi-asserted-by":"crossref","unstructured":"Okanohara, D., Sadakane, K.: Practical entropy-compressed rank\/ select dictionary. In: Proceedings of Workshop on Algorithm Engineering and Experiments (ALENEX) (2007)","DOI":"10.1137\/1.9781611972870.6"},{"issue":"1","key":"18_CR19","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1109\/2945.764870","volume":"5","author":"J Rossignac","year":"1999","unstructured":"Rossignac, J.: Edgebreaker: connectivity compression for triangle meshes. IEEE Trans. Visual Comput. Graphics 5(1), 47\u201361 (1999)","journal-title":"IEEE Trans. Visual Comput. Graphics"},{"issue":"7","key":"18_CR20","doi-asserted-by":"crossref","first-page":"1019","DOI":"10.1016\/j.is.2012.06.005","volume":"38","author":"ES Tellez","year":"2013","unstructured":"Tellez, E.S., Chavez, E., Navarro, G.: Succinct nearest neighbor search. Inf. Syst. 38(7), 1019\u20131030 (2013)","journal-title":"Inf. Syst."},{"key":"18_CR21","unstructured":"Venkat, P., Mount, D.M.: A succinct, dynamic data structure for proximity queries on point sets. In: Proceedings of the 26th Canadian Conference on Computational Geometry, CCCG 2014, Halifax, Nova Scotia, Canada, 2014 (2014)"}],"container-title":["Lecture Notes in Computer Science","Similarity Search and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-68474-1_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,9,27]],"date-time":"2017-09-27T11:21:05Z","timestamp":1506511265000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-68474-1_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319684734","9783319684741"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-68474-1_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]}}}