{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T05:09:34Z","timestamp":1742965774445,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642223501"},{"type":"electronic","value":"9783642223518"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-22351-8_39","type":"book-chapter","created":{"date-parts":[[2011,7,18]],"date-time":"2011-07-18T13:46:41Z","timestamp":1310996801000},"page":"565-567","source":"Crossref","is-referenced-by-count":0,"title":["Heidi Visualization of R-tree Structures over High Dimensional Data"],"prefix":"10.1007","author":[{"given":"Shraddha","family":"Agrawal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Soujanya","family":"Vadapalli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kamalakar","family":"Karlapalem","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"39_CR1","doi-asserted-by":"crossref","unstructured":"Beckmann, N., Kriegel, H., Schneider, R., Seeger, B.: The r*-tree: An efficient and robust access method for points and rectangles. In: SIGMOD 1990, pp. 322\u2013331. ACM Press, New York (1990)","DOI":"10.1145\/93605.98741"},{"key":"39_CR2","doi-asserted-by":"crossref","unstructured":"Gimnez, A., Rosenbaum, R., Hlawitschka, M., Hamann, B.: Using r-trees for interactive visualization of large multidimensional datasets. In: Proceedings of the 6th International Symposium on Visual Computing (November 2010)","DOI":"10.1007\/978-3-642-17274-8_54"},{"key":"39_CR3","first-page":"47","volume-title":"SIGMOD 1984","author":"A. Guttman","year":"1984","unstructured":"Guttman, A.: R-trees: A dynamic index structure for spatial searching. In: SIGMOD 1984, pp. 47\u201357. ACM Press, New York (1984)"},{"key":"39_CR4","doi-asserted-by":"crossref","unstructured":"Roussopoulos, N., Kelley, S., Vincent, F.: Nearest neighbor queries. In: SIGMOD, pp. 71\u201379 (1995)","DOI":"10.1145\/223784.223794"},{"key":"39_CR5","doi-asserted-by":"crossref","unstructured":"Vadapalli, S., Karlapalem, K.: Heidi matrix: Nearest neighbor driven high dimensional data visualization. In: VAKD, SIGKDD (2009)","DOI":"10.1145\/1562849.1562859"}],"container-title":["Lecture Notes in Computer Science","Scientific and Statistical Database Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22351-8_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,12]],"date-time":"2019-06-12T22:32:45Z","timestamp":1560378765000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22351-8_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642223501","9783642223518"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22351-8_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}