{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:17:22Z","timestamp":1725455842436},"publisher-location":"Berlin\/Heidelberg","reference-count":8,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354010576X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0017305","type":"book-chapter","created":{"date-parts":[[2005,11,22]],"date-time":"2005-11-22T02:22:34Z","timestamp":1132626154000},"page":"135-145","source":"Crossref","is-referenced-by-count":7,"title":["Dynamic k-dimensional multiway search under time-varying access frequencies"],"prefix":"10.1007","author":[{"given":"H.","family":"G\u00fcting","sequence":"first","affiliation":[]},{"given":"H. P.","family":"Kriegel","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"17_CR1","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1145\/322203.322205","volume":"27","author":"D. Altenkamp","year":"1980","unstructured":"Altenkamp, D. and Mehlhorn, K. (1980), Codes: Unequal probabilities, unequal letter costs, Journal of the ACM 27, 3 (July 1980), 412\u2013427.","journal-title":"Journal of the ACM"},{"doi-asserted-by":"crossref","unstructured":"Bent, S.W., Sleator, D.D. and Tarjan, R.E. (1980), Biased 2\u20133 trees, Proc. 21st Annual Symposium on Foundations of Computer Science, 248\u2013254.","key":"17_CR2","DOI":"10.1109\/SFCS.1980.15"},{"doi-asserted-by":"crossref","unstructured":"G\u00fcting, H. and Kriegel, H.P. (1980), Multidimensional B-tree: An efficient dynamic file structure for exact match queries, Computer Science Technical Report No. 105, Universit\u00e4t Dortmund, also in: GI \u2014 lo. Jahrestagung, Informatik Fachberichte Band 33, 375\u2013388, Springer-Verlag, Berlin-Heidelberg-New York.","key":"17_CR3","DOI":"10.1007\/978-3-642-67838-7_35"},{"key":"17_CR4","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/BF00264289","volume":"1","author":"D.E. Knuth","year":"1971","unstructured":"Knuth, D.E. (1971), Optimum binary search trees, Acta Informatica 1 (1971), 14\u201325.","journal-title":"Acta Informatica"},{"key":"17_CR5","volume-title":"The art of computer programming, Vol. III: Sorting and searching","author":"D.E. Knuth","year":"1973","unstructured":"Knuth, D.E. (1973), The art of computer programming, Vol. III: Sorting and searching, Addison-Wesley, Reading, MA."},{"key":"17_CR6","volume-title":"Arbitrary weight changes in dynamic trees, Bericht 78\/04, Fachbereich lo \u2014 Informatik","author":"K. Mehlhorn","year":"1978","unstructured":"Mehlhorn, K. (1978), Arbitrary weight changes in dynamic trees, Bericht 78\/04, Fachbereich lo \u2014 Informatik, Universit\u00e4t des Saarlandes, Saarbr\u00fccken."},{"issue":"2","key":"17_CR7","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1137\/0208014","volume":"8","author":"K. Mehlhorn","year":"1979","unstructured":"Mehlhorn, K. (1979), Dynamic binary search, SIAM J. COMPUTING 8,2 (May 1979), 175\u2013198.","journal-title":"SIAM J. COMPUTING"},{"key":"17_CR8","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/BF00288540","volume":"14","author":"V.K. Vaishnavi","year":"1980","unstructured":"Vaishnavi, V.K., Kriegel, H.P. and Wood, D. (1980), Optimum multiway search trees, Acta Informatica 14 (1980), 119\u2013133.","journal-title":"Acta Informatica"}],"container-title":["Lecture Notes in Computer Science","Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0017305.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T16:38:10Z","timestamp":1607531890000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0017305"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354010576X"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/bfb0017305","relation":{},"subject":[]}}