{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:04:28Z","timestamp":1725573868876},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540210474"},{"type":"electronic","value":"9783540245711"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24571-1_15","type":"book-chapter","created":{"date-parts":[[2011,1,7]],"date-time":"2011-01-07T10:32:42Z","timestamp":1294396362000},"page":"184-189","source":"Crossref","is-referenced-by-count":2,"title":["Path-Based Range Query Processing Using Sorted Path and Rectangle Intersection Approach"],"prefix":"10.1007","author":[{"given":"Hoong Kee","family":"Ng","sequence":"first","affiliation":[]},{"given":"Hon Wai","family":"Leong","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"15_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/3-540-47724-1_11","volume-title":"Advances in Spatial and Temporal Databases","author":"E.P.F. Chan","year":"2001","unstructured":"Chan, E.P.F.: Evaluation of Buffer Queries in Spatial Databases. In: Jensen, C.S., Schneider, M., Seeger, B., Tsotras, V.J. (eds.) SSTD 2001. LNCS, vol.\u00a02121, pp. 197\u2013216. Springer, Heidelberg (2001)"},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"Garcia, Y.J., Lopez, M.A., Leutnegger, S.T.: A Greedy Algorithm for Bulk Loading R-Trees. In: Proc. of 6th ACM Symp. on Geographic Information Systems, pp. 163\u2013164 (1998)","DOI":"10.1145\/288692.288723"},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"Mehlhorn, K., N\u00e4her, S.: LEDA, A Platform For Combinatorial and Geometric Computing. Communications of the ACM, 96\u2013102 (1995)","DOI":"10.1145\/204865.204889"},{"key":"15_CR4","unstructured":"Ng, H.K., Leong, H.W., Ho, N.L.: Efficient Algorithm For A New Path-Based Range Query In Spatial Databases, National University of Singapore (2003) (manuscript)"},{"key":"15_CR5","doi-asserted-by":"crossref","unstructured":"Papadopoulos, A., Manolopoulos, Y.: Parallel Processing of Nearest Neighbor Queries in Declustered Spatial Data. In: Proc. of the 1998 ACM SIGMOD Conf., pp. 225\u2013236 (1998)","DOI":"10.1145\/276304.276325"},{"key":"15_CR6","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry: An Introduction","author":"F.P. Preparata","year":"1985","unstructured":"Preparata, F.P., Shamos, M.I.: Computational Geometry: An Introduction, pp. 351\u2013355. Springer, Heidelberg (1985)"},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"Roussopoulos, N., Kelley, S., Vincent, F.: Nearest Neighbor Queries. In: Proc. of the 1995 ACM SIGMOD Conf., pp. 71\u201379 (1995)","DOI":"10.1145\/223784.223794"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24571-1_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,7]],"date-time":"2019-06-07T13:42:56Z","timestamp":1559914976000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24571-1_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540210474","9783540245711"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24571-1_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}