{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T08:18:47Z","timestamp":1771661927162,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540515425","type":"print"},{"value":"9783540482376","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/3-540-51542-9_4","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T21:07:28Z","timestamp":1330204048000},"page":"24-38","source":"Crossref","is-referenced-by-count":11,"title":["Analysis of kdt-trees: Kd-trees improved by local reorganisations"],"prefix":"10.1007","author":[{"given":"Walter","family":"Cunto","sequence":"first","affiliation":[]},{"given":"Gustavo","family":"Lau","sequence":"additional","affiliation":[]},{"given":"Philippe","family":"Flajolet","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,26]]},"reference":[{"key":"4_CR1","first-page":"263","volume":"146","author":"G. M. Adel'son-Vel'skii","year":"1962","unstructured":"Adel'son-Vel'skii, G. M., Landis, E. M.: An Algorithm For The Organization Of Information; Doklady Akademiia Naur USSR 146:263\u2013266 (1962).","journal-title":"Doklady Akademiia Naur USSR"},{"issue":"2","key":"4_CR2","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1145\/320071.320074","volume":"4","author":"A. V. Aho","year":"1979","unstructured":"Aho, A. V., Ullman, J. D.: Optimal Partial-Match Retrieval When Fields Are Independently Specified; ACM TODS 4(2):168\u2013179 (1979).","journal-title":"ACM TODS"},{"issue":"3","key":"4_CR3","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1145\/357323.357327","volume":"2","author":"D. P. Anderson","year":"1983","unstructured":"Anderson, D. P.: Techniques For Reducing Pen Plotting Time; ACM Trans. on Graphics 2(3):197\u2013212 (1983).","journal-title":"ACM Trans. on Graphics"},{"issue":"5","key":"4_CR4","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1145\/359581.359593","volume":"20","author":"J. L. Baer","year":"1977","unstructured":"Baer, J.L. and Schawb, B.: A Comparison Of Tree-Balancing Algorithms; Comm. ACM 20(5):322\u2013330 (1977).","journal-title":"Comm. ACM"},{"key":"4_CR5","unstructured":"Bell, C. J.: An Investigation Into The Principles Of The Classification And Analysis Of Data On An Automatic Digital Computer; Doctoral Dissertation, Leeds University, 1965."},{"issue":"9","key":"4_CR6","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; Comm. ACM 18(9):509\u2013517 (1975).","journal-title":"Comm. ACM"},{"key":"4_CR7","unstructured":"Boole, G.: Calculus Of Finite Differences; Chelsea 1860, New York, 5th Edition 1970."},{"key":"4_CR8","volume-title":"An Asymptotic Methods in Analysis","author":"N. G. Bruijn de","year":"1970","unstructured":"de Bruijn, N.G.: An Asymptotic Methods in Analysis; North-Holland Publishing Co., Amsterdam, 1970. Edition 1970."},{"key":"4_CR9","first-page":"280","volume":"15","author":"W. A. Burkhard","year":"1977","unstructured":"Burkhard, W. A.: Associative Retrieval Trie Hash-Coding; JCSS 15:280\u2013299 (1977).","journal-title":"JCSS"},{"issue":"2","key":"4_CR10","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1145\/320071.320079","volume":"4","author":"W. A. Burkhard","year":"1979","unstructured":"Burkhard, W. A.: Partial-Match Hash Coding: Benefits of Redundancy; ACM TODS 4(2):228\u2013239 (1979).","journal-title":"ACM TODS"},{"key":"4_CR11","volume-title":"Theory Of Ordinary Differential Equations","author":"E. A. Coddington","year":"1955","unstructured":"Coddington, E. A., Levinson, N.: Theory Of Ordinary Differential Equations; MacGraw-Hill, New York, 1955."},{"key":"4_CR12","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1007\/BF00263296","volume":"24","author":"W. Cunto","year":"1987","unstructured":"Cunto, W., Gasc\u00f3n, J. L.: Improving Time And Space Efficiency In Generalized Binary Search Trees; Acta Informatica 24:583\u2013594 (1987).","journal-title":"Acta Informatica"},{"key":"4_CR13","unstructured":"Dieudonn\u00e9, J.: Fundamentos De An\u00e1lisis Moderno; Ed. Revert\u00e9, Barcelona, 1966."},{"key":"4_CR14","unstructured":"Elsgoltz, L.: Ecuaciones Differenciales y C\u00e1lculo Variacional; Editorial MIR, Mosc\u00fa, 1977."},{"key":"4_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF00288933","volume":"4","author":"R. A. Finkel","year":"1974","unstructured":"Finkel, R. A., Bentley, J. L.: Quad trees: A Data Structure For Retrieval On Composite Keys; Acta Informatica 4:1\u20139 (1974).","journal-title":"Acta Informatica"},{"issue":"2","key":"4_CR16","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1145\/5383.5453","volume":"33","author":"P. Flajolet","year":"1986","unstructured":"Flajolet, P., Puech, C.: Partial Match Retrieval Of Multidimensional Data; J. ACM 33(2):371\u2013407 (1986).","journal-title":"J. ACM"},{"issue":"2","key":"4_CR17","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1093\/comjnl\/26.2.106","volume":"26","author":"G. H. Gonnet","year":"1983","unstructured":"Gonnet, G.H., Olivie, H.J., Wood. D.: Height-Ratio-Balances Trees; Computer J. 26(2):106\u2013108 (May 1983).","journal-title":"Computer J."},{"key":"4_CR18","volume-title":"The Art Of Computer Programming, Vol. 1\/Fundamental Algorithms","author":"D. E. Knuth","year":"1973","unstructured":"Knuth, D. E.: The Art Of Computer Programming, Vol. 1\/Fundamental Algorithms; 2nd Edition, Addison Wesley, Reading Massachusetts, 1973.","edition":"2nd Edition"},{"key":"4_CR19","volume-title":"The Art Of Computer Programming, Vol. 3\/Searching and Sorting","author":"D. E. Knuth","year":"1973","unstructured":"Knuth, D. E.: The Art Of Computer Programming, Vol. 3\/Searching and Sorting; 2nd Edition, Addison Wesley, Reading Massachusetts, 1973.","edition":"2nd Edition"},{"key":"4_CR20","unstructured":"Lau, G. S.: Arboles Multidimensionales de B\u00fasqueda Binaria con Reorganizaci\u00f3n Local; Tesis de Maestr\u00eda, Dept. de Ciencias de la Computaci\u00f3n, Universidad Sim\u00f3n Bol\u00edvar, 1988."},{"issue":"3","key":"4_CR21","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/0734-189X(84)90215-9","volume":"26","author":"T. Matsuyama","year":"1984","unstructured":"Matsuyama, T., Hao, L. V., Nagao, M.: A File Organization For Geographic Information Systems Based On Spatial Proximity; Computer Vision Graphics and Image Processing 26(3):303\u2013318 (1984).","journal-title":"Computer Vision Graphics and Image Processing"},{"issue":"4","key":"4_CR22","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1016\/0020-0190(82)90027-8","volume":"14","author":"J. A. Orenstein","year":"1982","unstructured":"Orenstein, J. A.: Multidimensional Tries Used For Associative Searching; Information Processing Letters 14(4):150\u2013157 (1982).","journal-title":"Information Processing Letters"},{"key":"4_CR23","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1016\/0196-6774(85)90003-3","volume":"6","author":"P. V. Poblete","year":"1985","unstructured":"Poblete, P. V., Munro, J. I.: The Analysis Of A Fringe Heuristic For Binary Search Trees; J. of Algorithms 6:336\u2013350 (1985).","journal-title":"J. of Algorithms"},{"issue":"1","key":"4_CR24","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1137\/0205003","volume":"5","author":"R. L. Rivest","year":"1976","unstructured":"Rivest, R. L.: Partial-Match Retrieval Algorithms; SIAM J. Computing 5(1):19\u201350 (1976).","journal-title":"SIAM J. Computing"},{"issue":"2","key":"4_CR25","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1145\/356924.356930","volume":"16","author":"H. Samet","year":"1984","unstructured":"Samet, H.: The Quadtree And Related Hierarchical Data Structures; Computing Surveys 16(2):187\u2013260 (1984).","journal-title":"Computing Surveys"},{"key":"4_CR26","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/0306-4379(82)90024-2","volume":"7","author":"P. Schenermann","year":"1982","unstructured":"Schenermann, P., Ouksel M.:Multidimensional B-trees For Associative Searching In Database Systems; Inform. Syst., 7:123\u2013137 (1982).","journal-title":"Inform. Syst."},{"key":"4_CR27","unstructured":"Sedgewick, R.: Quicksort; Ph.D. thesis, Computer Science Dept.; Stanford University, Report STAN-CS-75-492, 1975."},{"key":"4_CR28","volume-title":"A Comprehensive Introduction To Differential Geometry; Vol. 1","author":"M. Spivak","year":"1970","unstructured":"Spivak, M.: A Comprehensive Introduction To Differential Geometry; Vol. 1, Publish or Perish, Boston, 1970."},{"issue":"4","key":"4_CR29","doi-asserted-by":"crossref","first-page":"334","DOI":"10.1109\/TC.1984.1676438","volume":"C-33","author":"V. K. Vaishavi","year":"1984","unstructured":"Vaishavi, V.K.:Multidimensional HeightBalanced Trees; IEEE Trans. on Comp., C-33(4):334\u2013343 (1984).","journal-title":"IEEE Trans. on Comp."},{"issue":"4","key":"4_CR30","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1093\/comjnl\/19.4.322","volume":"19","author":"A. Walker","year":"1976","unstructured":"Walker, A., Wood, D.: Locally Balanced Binary Trees, Computer J. 19(4):322\u2013325 (1976).","journal-title":"Computer J."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-51542-9_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:04:39Z","timestamp":1619571879000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-51542-9_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540515425","9783540482376"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/3-540-51542-9_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1989]]}}}