{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,11]],"date-time":"2026-11-11T07:06:17Z","timestamp":1794380777763,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540223825","type":"print"},{"value":"9783540278115","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27811-5_16","type":"book-chapter","created":{"date-parts":[[2010,9,6]],"date-time":"2010-09-06T23:28:09Z","timestamp":1283815689000},"page":"165-177","source":"Crossref","is-referenced-by-count":1,"title":["Incremental Observer Relative Data Extraction"],"prefix":"10.1007","author":[{"given":"Linas","family":"Bukauskas","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michael H.","family":"B\u00f6hlen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"16_CR1","doi-asserted-by":"crossref","unstructured":"Guttman, A.: R-trees: A dynamic index structure for spatial searching. In: Proc. of Annual Meeting SIGMOD 1984, pp. 47\u201357 (1984)","DOI":"10.1145\/602259.602266"},{"key":"16_CR2","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: Proc. of Int. Conference on Management of Data, pp. 322\u2013331 (1990)","DOI":"10.1145\/93597.98741"},{"key":"16_CR3","unstructured":"Berchtold, S., Keim, D.A., Kriegel, H.P.: The x-tree: An index structure for highdimensional data. In: Proc. of Int. Conference on Very Large Data Bases, pp. 28\u201339 (1996)"},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"White, D.A., Jain, R.: Similarity indexing with the ss-tree. In: Proc. of Int. Conference on Data Engineering, pp. 516\u2013523 (1996)","DOI":"10.1109\/ICDE.1996.492202"},{"key":"16_CR5","doi-asserted-by":"crossref","unstructured":"Katayama, N., Satoh, S.: The sr-tree: An index structure for high-dimensional nearest neighbor queries. In: Proc. of Int. Conference on Management of Data, pp. 369\u2013380 (1997)","DOI":"10.1145\/253260.253347"},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"Tzouramanis, T., Vassilakopoulos, M., Manolopoulos, Y.: Overlapping linear quadtrees: A spatio-temporal access method. In: Proc. of Int. Symposium on Advances in Geographic Information Systems, pp. 1\u20137 (1998)","DOI":"10.1145\/288692.288695"},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"Robinson, J.T.: The k-d-b-tree: A search structure for large multidimensional dynamic indexes. In: Proc. of Int. Conference on Management of Data, pp. 10\u201318 (1981)","DOI":"10.1145\/582318.582321"},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"Henrich, A.: The lsdh-tree: An access structure for feature vectors. In: Proc. of Int. Conference on Data Engineering, pp. 362\u2013369 (1998)","DOI":"10.1109\/ICDE.1998.655799"},{"key":"16_CR9","doi-asserted-by":"crossref","unstructured":"Song, Z., Roussopoulos, N.: K-nearest neighbor search for moving query point. In: Proc. of Int. Symposium on Advances in Spatial and Temporal Databases, pp. 79\u201396 (2001)","DOI":"10.1007\/3-540-47724-1_5"},{"key":"16_CR10","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1002\/1099-1778(200007)11:3<129::AID-VIS227>3.0.CO;2-T","volume":"11","author":"M. Kofler","year":"2000","unstructured":"Kofler, M., Gervautz, M., Gruber, M.: R-trees for organizing and visualizing 3d gis databases. Journal of Visualization and Computer Animation\u00a011, 129\u2013143 (2000)","journal-title":"Journal of Visualization and Computer Animation"},{"key":"16_CR11","unstructured":"Koefler, M.: R-Trees for Visualizing and Organizing Large 3D GIS Databases. PhD thesis, Technichen Universit at Graz (1998)"},{"key":"16_CR12","unstructured":"Shou, L., Chionh, J., Huang, Z., Tan, K.L., Ruan, Y.: Walking through a very large virtual environment in real-time. In: Proceedings of Int. Conference on Very Large Data Bases, pp. 401\u2013410 (2001)"},{"key":"16_CR13","unstructured":"Hellerstein, J.M., Naughton, J.F., Pfeffer, A.: Generalized search trees for database systems. In: Proc. of Int. Conference on Very Large Data Bases, pp. 562\u2013573 (1995)"}],"container-title":["Lecture Notes in Computer Science","Key Technologies for Data Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27811-5_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T11:07:07Z","timestamp":1740481627000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27811-5_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540223825","9783540278115"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27811-5_16","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/b98625","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}