{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:58:56Z","timestamp":1725559136526},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540260325"},{"type":"electronic","value":"9783540321118"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11428831_125","type":"book-chapter","created":{"date-parts":[[2010,7,14]],"date-time":"2010-07-14T00:14:05Z","timestamp":1279066445000},"page":"1003-1010","source":"Crossref","is-referenced-by-count":3,"title":["Efficient Parallelization of Spatial Approximation Trees"],"prefix":"10.1007","author":[{"given":"Mauricio","family":"Mar\u00edn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nora","family":"Reyes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"125_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1007\/978-3-540-39984-1_28","volume-title":"String Processing and Information Retrieval","author":"D. Arroyuelo","year":"2003","unstructured":"Arroyuelo, D., Mu noz, F., Navarro, G., Reyes, N.: Memory-adaptative dynamic spatial approximation trees. In: Nascimento, M.A., de Moura, E.S., Oliveira, A.L. (eds.) SPIRE 2003. LNCS, vol.\u00a02857, pp. 360\u2013368. Springer, Heidelberg (2003)"},{"issue":"3","key":"125_CR2","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1145\/502807.502809","volume":"33","author":"C. Bohm","year":"2001","unstructured":"Bohm, C., Brchtold, S., Kein, D.: Searching in high-dimensional spaces: Index structures for improving the performance of multimedia databases. ACM Computing Surveys\u00a033(3), 322\u2013373 (2001)","journal-title":"ACM Computing Surveys"},{"issue":"2","key":"125_CR3","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1145\/280277.280279","volume":"30","author":"V. Gaede","year":"1998","unstructured":"Gaede, V., G\u00fcnther, O.: Multidimensional access methods. ACM Computing Surveys\u00a030(2), 170\u2013321 (1998)","journal-title":"ACM Computing Surveys"},{"key":"125_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/978-3-540-39984-1_24","volume-title":"String Processing and Information Retrieval","author":"M. Mar\u00edn","year":"2003","unstructured":"Mar\u00edn, M., Navarro, G.: Distributed query processing using suffix arrays. In: Nascimento, M.A., de Moura, E.S., Oliveira, A.L. (eds.) SPIRE 2003. LNCS, vol.\u00a02857, pp. 311\u2013325. Springer, Heidelberg (2003)"},{"issue":"1","key":"125_CR5","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/s007780200060","volume":"11","author":"G. Navarro","year":"2002","unstructured":"Navarro, G.: Searching in metric spaces by spatial approximation. The Very Large Databases Journal (VLDBJ)\u00a011(1), 28\u201346 (2002)","journal-title":"The Very Large Databases Journal (VLDBJ)"},{"key":"125_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/3-540-45735-6_23","volume-title":"String Processing and Information Retrieval","author":"G. Navarro","year":"2002","unstructured":"Navarro, G., Reyes, N.: Fully dynamic spatial approximation trees. In: Laender, A.H.F., Oliveira, A.L. (eds.) SPIRE 2002. LNCS, vol.\u00a02476, pp. 254\u2013270. Springer, Heidelberg (2002)"},{"key":"125_CR7","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1109\/SCCC.2003.1245441","volume-title":"Proc. of the XXIII International Conference of the Chilean Computer Science Society (SCCC 2003)","author":"G. Navarro","year":"2003","unstructured":"Navarro, G., Reyes, N.: Improved deletions in dynamic spatial approximation trees. In: Proc. of the XXIII International Conference of the Chilean Computer Science Society (SCCC 2003), pp. 13\u201322. IEEE CS Press, Los Alamitos (2003)"},{"key":"#cr-split#-125_CR8.1","unstructured":"Skillicorn, D.B., Hill, J.M.D., McColl, W.F.: Questions and answers about BSP. Technical Report PRG-TR-15-96, Computing Laboratory, Oxford University (1996);"},{"key":"#cr-split#-125_CR8.2","unstructured":"Also in Journal of Scientific Programming 6(3) (1997)"},{"key":"125_CR9","unstructured":"URL. BSP PUB Library at Paderborn University, \n                    \n                      http:\/\/www.uni-paderborn.de\/bsp"},{"key":"125_CR10","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1145\/79173.79181","volume":"33","author":"L.G. Valiant","year":"1990","unstructured":"Valiant, L.G.: A bridging model for parallel computation. Comm. ACM\u00a033, 103\u2013111 (1990)","journal-title":"Comm. ACM"}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2013 ICCS 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11428831_125","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,16]],"date-time":"2019-03-16T14:58:59Z","timestamp":1552748339000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11428831_125"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540260325","9783540321118"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/11428831_125","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}