{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T14:00:21Z","timestamp":1725544821512},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540333371"},{"type":"electronic","value":"9783540333388"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11733836_68","type":"book-chapter","created":{"date-parts":[[2006,3,10]],"date-time":"2006-03-10T08:14:31Z","timestamp":1141978471000},"page":"910-919","source":"Crossref","is-referenced-by-count":1,"title":["Nearest Neighbor Queries for R-Trees: Why Not Bottom-Up?"],"prefix":"10.1007","author":[{"given":"MoonBae","family":"Song","sequence":"first","affiliation":[]},{"given":"KwangJin","family":"Park","sequence":"additional","affiliation":[]},{"given":"SeokJin","family":"Im","sequence":"additional","affiliation":[]},{"given":"Ki-Sik","family":"Kong","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"68_CR1","doi-asserted-by":"crossref","unstructured":"Bentley, J.: Multidimensional binary search trees used for associative searching. Communication of ACM\u00a018(9) (1975)","DOI":"10.1145\/361002.361007"},{"key":"68_CR2","doi-asserted-by":"crossref","unstructured":"Guttman, A.: R-trees: A Dynamic Index Structure for Spatial Searching. In: Proc. of SIGMOD (1984)","DOI":"10.1145\/602259.602266"},{"key":"68_CR3","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 SIGMOD (1990)","DOI":"10.1145\/93597.98741"},{"key":"68_CR4","doi-asserted-by":"crossref","unstructured":"Roussopoulos, N., Kelley, S., Vincent, F.: Nearest neighbor queries. In: Proc. of SIGMOD (1995)","DOI":"10.1145\/223784.223794"},{"key":"68_CR5","doi-asserted-by":"crossref","unstructured":"Theodoridis, Y., Sellis, T.: A Model for the Prediction of R-tree Performance. In: Proc. of PODS (1996)","DOI":"10.1145\/237661.237705"},{"key":"68_CR6","series-title":"Lecture Notes in Computer Science","volume-title":"Database Theory - ICDT \u201997","author":"A. Papadopoulos","year":"1996","unstructured":"Papadopoulos, A., Manolopoulos, Y.: Performance of Nearest Neighbor Queries in R-Trees. In: Afrati, F.N., Kolaitis, P.G. (eds.) ICDT 1997. LNCS, vol.\u00a01186, Springer, Heidelberg (1996)"},{"key":"68_CR7","doi-asserted-by":"crossref","unstructured":"Hjaltason, G.R., Samet, H.: Distance browsing in spatial databases. ACM Trans. Database Systems\u00a024(2) (1999)","DOI":"10.1145\/320248.320255"},{"key":"68_CR8","doi-asserted-by":"crossref","unstructured":"B\u00f6hm, C., Berchtold, S., Keim, D.A.: Searching in High-Dimensional Spaces: Index Structures for Improving the Performance of Multimedia Databases. ACM Computing Surveys\u00a033(3) (2001)","DOI":"10.1145\/502807.502809"},{"key":"68_CR9","unstructured":"Yufei Tao\u2019s A Dataset collection. http:\/\/www.cs.cityu.edu.hk\/~taoyf\/ds.html"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11733836_68","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,17]],"date-time":"2019-04-17T04:07:30Z","timestamp":1555474050000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11733836_68"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540333371","9783540333388"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/11733836_68","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}