{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T12:38:17Z","timestamp":1742387897132},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540233053"},{"type":"electronic","value":"9783540301929"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30192-9_51","type":"book-chapter","created":{"date-parts":[[2010,3,2]],"date-time":"2010-03-02T13:02:43Z","timestamp":1267534963000},"page":"516-525","source":"Crossref","is-referenced-by-count":45,"title":["P2PR-Tree: An R-Tree-Based Spatial Index for Peer-to-Peer Environments"],"prefix":"10.1007","author":[{"given":"Anirban","family":"Mondal","sequence":"first","affiliation":[]},{"given":"Yi","family":"Lifu","sequence":"additional","affiliation":[]},{"given":"Masaru","family":"Kitsuregawa","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"51_CR1","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. ACM SIGMOD (1990)","DOI":"10.1145\/93597.98741"},{"key":"51_CR2","unstructured":"Brakatsoulas, S., Pfoser, D., Theodoridis, Y.: Revisiting R-tree construction principles, \n                      \n                        citeseer.nj.nec.com\/586207.html"},{"key":"51_CR3","doi-asserted-by":"crossref","unstructured":"Crespo, A., Molina, H.G.: Routing indices for Peer-to-Peer systems. In: Proc. ICDCS (2002)","DOI":"10.1109\/ICDCS.2002.1022239"},{"key":"51_CR4","unstructured":"Datasets, \n                      \n                        http:\/\/dias.cti.gr\/~ytheod\/research\/datasets\/spatial.html"},{"key":"51_CR5","doi-asserted-by":"crossref","unstructured":"Demirbas, M., Ferhatosmanoglu, H.: Peer-to-peer spatial queries in sensor networks. In: Proc. P2P (2003)","DOI":"10.1109\/PTP.2003.1231501"},{"key":"51_CR6","doi-asserted-by":"crossref","unstructured":"Guttman, A.: R-trees: A dynamic index structure for spatial searching. In: Proc. ACM SIGMOD (1984)","DOI":"10.1145\/602259.602266"},{"key":"51_CR7","unstructured":"Kazaa, \n                      \n                        http:\/\/www.kazaa.com\/"},{"key":"51_CR8","doi-asserted-by":"crossref","unstructured":"Koudas, N., Faloutsos, C., Kamel, I.: Declustering spatial databases on a multi-computer architecture. In: Proc. EDBT (1996)","DOI":"10.1007\/BFb0014180"},{"key":"51_CR9","doi-asserted-by":"crossref","unstructured":"Mondal, A., Kitsuregawa, M., Ooi, B.C., Tan, K.L.: R-tree-based data migration and self-tuning strategies in shared-nothing spatial databases. In: Proc. ACM GIS (2001)","DOI":"10.1145\/512161.512169"},{"key":"51_CR10","unstructured":"Napster, \n                      \n                        http:\/\/www.napster.com\/"},{"key":"51_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/3-540-45518-3_18","volume-title":"Middleware 2001","author":"A. Rowstron","year":"2001","unstructured":"Rowstron, A., Druschel, P.: Pastry: Scalable, decentralized object location and routing for large-scale peer-to-peer systems. In: Guerraoui, R. (ed.) Proc. IFIP\/ACM. LNCS, vol.\u00a02218, p. 329. Springer, Heidelberg (2001)"},{"key":"51_CR12","unstructured":"Schnitzer, B., Leutenegger, S.T.: Master-client R-trees: A new parallel R-tree architecture. Technical Report COMP-98-01, University of Denver (1998)"},{"key":"51_CR13","unstructured":"Sellis, T.K., Roussopoulos, N., Faloutsos, C.: The R\n                              \u2009+\u2009-tree: A dynamic index for multi-dimensional objects. In: Proc. VLDB (1987)"},{"key":"51_CR14","doi-asserted-by":"crossref","unstructured":"Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for internet applications. In: Proc. ACM SIGCOMM (2001)","DOI":"10.1145\/383059.383071"}],"container-title":["Lecture Notes in Computer Science","Current Trends in Database Technology - EDBT 2004 Workshops"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30192-9_51.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,18]],"date-time":"2020-11-18T23:46:51Z","timestamp":1605743211000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30192-9_51"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540233053","9783540301929"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30192-9_51","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}