{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,13]],"date-time":"2024-08-13T16:16:41Z","timestamp":1723565801892},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2006,2,9]],"date-time":"2006-02-09T00:00:00Z","timestamp":1139443200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Geoinformatica"],"published-print":{"date-parts":[[2006,3]]},"DOI":"10.1007\/s10707-005-4887-8","type":"journal-article","created":{"date-parts":[[2006,2,7]],"date-time":"2006-02-07T11:07:15Z","timestamp":1139310435000},"page":"91-116","source":"Crossref","is-referenced-by-count":7,"title":["Building and Querying a P2P Virtual World"],"prefix":"10.1007","volume":"10","author":[{"given":"Egemen","family":"Tanin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aaron","family":"Harwood","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hanan","family":"Samet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Deepa","family":"Nayar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sarana","family":"Nutanong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,2,9]]},"reference":[{"key":"4887_CR1","unstructured":"K. Aberer and M. Punceva. \u201cEfficient search in structured peer-to-peer systems: Binary vs. k-ary unbalanced tree structures,\u201d in Proceedings of the International Workshop on Databases, Information Systems, and Peer-to-Peer Computing (held in conjunction with VLDB), Berlin, Germany, September 2003."},{"key":"4887_CR2","doi-asserted-by":"crossref","unstructured":"A. Aboulnaga and J.F. Naughton. \u201cAccurate estimation of the cost of spatial selections,\u201d in Proceedings of the IEEE International Conference on Data Engineering, pp. 123\u2013134, San Diego, CA, February 2000.","DOI":"10.1109\/ICDE.2000.839399"},{"key":"4887_CR3","unstructured":"J. Aspnes and G. Shah. \u201cSkip graphs,\u201d in Proceedings of SODA, pp. 384\u2013293, Baltimore, MD, January 2003."},{"key":"4887_CR4","doi-asserted-by":"crossref","unstructured":"F. Banaei-Kashani and C. Shahabi. \u201cSWAM: A family of access methods for similarity-search in peer-to-peer data networks,\u201d in Proceedings of the Conference on Information and Knowledge Management-CIKM, pp. 304\u2013313, Washington, DC, November 2004.","DOI":"10.1145\/1031171.1031236"},{"key":"4887_CR5","doi-asserted-by":"crossref","unstructured":"M. Batko, C. Gennaro, P. Savino and P. Zezula. \u201cScalable similarity search in metric spaces,\u201d in Proceedings of the DELOS Workshop on Digital Library Architectures: Peer-to-Peer, Grid, and Service-Orientation, pp. 213\u2013224, Padova, Italy, June 2004.","DOI":"10.1007\/11549819_3"},{"key":"4887_CR6","doi-asserted-by":"crossref","unstructured":"M. Batko, C. Gennaro and P. Zezula. \u201cA scalable nearest neighbor search in P2P systems,\u201d in Proceedings of the International Workshop on Databases, Information Systems, and Peer-to-Peer Computing (held in conjunction with VLDB), pp. 64\u201377, Toronto, Canada, August 2004.","DOI":"10.1007\/978-3-540-31838-5_6"},{"issue":"9","key":"4887_CR7","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1145\/361002.361007","volume":"18","author":"J.L. Bentley","year":"1975","unstructured":"J.L. Bentley. \u201cMultidimensional binary search trees used for associative searching,\u201d Communications of the ACM, Vol. 18(9):509\u2013517, September 1975.","journal-title":"Communications of the ACM"},{"key":"4887_CR8","unstructured":"S. Bhattacharjee, P. Keleher and B. Silaghi. \u201cThe design of TerraDir,\u201d Technical Report CS-TR-4299, Department of Computer Science, University of Maryland at College Park, October 2001."},{"key":"4887_CR9","doi-asserted-by":"crossref","unstructured":"M. Demirbas and H. Ferhatosmanoglu. \u201cPeer-to-peer spatial queries in sensor networks,\u201d in Proceedings of the IEEE International Conference on Peer-to-Peer Computing, pp. 32\u201339, Linkoping, Sweden, September 2003.","DOI":"10.1109\/PTP.2003.1231501"},{"key":"4887_CR10","doi-asserted-by":"crossref","unstructured":"P. Druschel and A. Rowstron. \u201cPAST: A large-scale, persistent peer-to-peer storage utility,\u201d in Proceedings of the IEEE HotOS VIII Workshop, pp. 65\u201370, Schloss Elmau, Germany, May 2001.","DOI":"10.1109\/HOTOS.2001.990064"},{"key":"4887_CR11","doi-asserted-by":"crossref","unstructured":"P. Ganesan, M. Bawa and H. Garcia-Molina. \u201cOnline balancing of range-partitioned data with applications to peer-to-peer systems,\u201d in Proceedings of the International Conference on Very Large Databases-VLDB, pp. 444\u2013455, Toronto, Canada, August 2004.","DOI":"10.1016\/B978-012088469-8\/50041-3"},{"key":"4887_CR12","doi-asserted-by":"crossref","unstructured":"P. Ganesan, B. Yang and H. Garcia-Molina. \u201cOne torus to rule them all: Multidimensional queries in P2P systems,\u201d in Proceedings of the ACM SIGMOD'04, WebDB Workshop, pp. 19\u201324, Paris, France, June 2004.","DOI":"10.1145\/1017074.1017081"},{"key":"4887_CR13","doi-asserted-by":"crossref","unstructured":"A. Guttman. \u201cR-trees: A dynamic index structure for spatial searching,\u201d in Proceedings of the ACM SIGMOD'84, pp. 47\u201357, Boston, MA, June 1984.","DOI":"10.1145\/602259.602266"},{"key":"4887_CR14","unstructured":"A. Harwood, S. Karunasekera, S. Nutanong, E. Tanin and M. Truong. \u201cComplex applications over peer-to-peer networks,\u201d in Poster Proceedings of the ACM Middleware'04, p. 327, Toronto, Canada, October 2004."},{"issue":"4","key":"4887_CR15","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1145\/958942.958948","volume":"28","author":"G.R. Hjaltason","year":"2003","unstructured":"G.R. Hjaltason and H. Samet. \u201cIndex-driven similarity search in metric spaces,\u201d ACM Transactions on Database Systems, Vol. 28(4):517\u2013580, December 2003.","journal-title":"ACM Transactions on Database Systems"},{"key":"4887_CR16","doi-asserted-by":"crossref","unstructured":"D. Karger, E. Lehman, T. Leighton, M. Levine, D. Lewin and R. Panigraphy. \u201cConsistent hashing and random trees: Distributed caching protocols for relieving hot spots on the World Wide Web,\u201d in Proceedings of the ACM Symposium on Theory of Computing, pp. 654\u2013663, El Paso, TX, May 1997.","DOI":"10.1145\/258533.258660"},{"key":"4887_CR17","doi-asserted-by":"crossref","unstructured":"G. Kedem. \u201cThe quad-cif tree: A data structure for hierarchical on-line algorithms,\u201d Technical Report TR-91, Department of Computer Science, University of Rochester, September 1981.","DOI":"10.1109\/DAC.1982.1585523"},{"issue":"4","key":"4887_CR18","doi-asserted-by":"crossref","first-page":"923","DOI":"10.1109\/TKDE.2002.1019223","volume":"14","author":"W. Litwin","year":"2002","unstructured":"W. Litwin and T. Risch. \u201cLH*g: A high-availability scalable distributed data structure by record grouping,\u201d IEEE Transactions on Knowledge and Data Engineering, Vol. 14(4):923\u2013927, July 2002.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"4887_CR19","doi-asserted-by":"crossref","unstructured":"A. Mondal, Yilifu and M. Kitsuregawa. \u201cP2PR-tree: An R-tree-based spatial index for peer-to-peer environments,\u201d in Proceedings of the International Workshop on Peer-to-Peer Computing and Databases (held in conjunction with EDBT), pp. 516\u2013525, Heraklion-Crete, Greece, March 2004.","DOI":"10.1007\/978-3-540-30192-9_51"},{"issue":"3","key":"4887_CR20","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/s002240000118","volume":"32","author":"C.G. Plaxton","year":"1999","unstructured":"C.G. Plaxton, R. Rajaraman and A.W. Richa. \u201cAccessing nearby copies of replicated objects in a distributed environment,\u201d Theory of Computing Systems, Vol. 32(3):241\u2013280, May 1999.","journal-title":"Theory of Computing Systems"},{"key":"4887_CR21","doi-asserted-by":"crossref","unstructured":"S. Ratnasamy, P. Francis, M. Handley, R. Karp and S. Shenker. \u201cA scalable content-addressable network,\u201d in Proceedings of the ACM SIGCOMM'01, pp. 161\u2013172, San Diego, CA, August 2001.","DOI":"10.1145\/383059.383072"},{"key":"4887_CR22","doi-asserted-by":"crossref","unstructured":"N. Roussopoulos, S. Kelley and F. Vincent. \u201cNearest neighbor queries,\u201d in Proceedings of the ACM SIGMOD'95, pp. 71\u201379, San Jose, CA, May 1995.","DOI":"10.1145\/223784.223794"},{"key":"4887_CR23","doi-asserted-by":"crossref","unstructured":"A. Rowstron and P. Druschel. \u201cPastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems,\u201d in Proceedings of the ACM Middleware'01, pp. 329\u2013350, Heidelberg, Germany, November 2001.","DOI":"10.1007\/3-540-45518-3_18"},{"key":"4887_CR24","volume-title":"Applications of Spatial Data Structures: Computer Graphics, Image Processing, and GIS","author":"H. Samet","year":"1990","unstructured":"H. Samet. Applications of Spatial Data Structures: Computer Graphics, Image Processing, and GIS. Addison-Wesley: Reading, MA, 1990."},{"key":"4887_CR25","volume-title":"The Design and Analysis of Spatial Data Structures","author":"H. Samet","year":"1990","unstructured":"H. Samet. The Design and Analysis of Spatial Data Structures. Addison-Wesley: Reading, MA, 1990."},{"key":"4887_CR26","doi-asserted-by":"crossref","unstructured":"H. Samet. \u201cDepth-first k-nearest neighbor finding using the maxnearestdist estimator,\u201d in Proceedings of the International Conference on Image Analysis and Processing, pp. 486\u2013491, Mantova, Italy, September 2003.","DOI":"10.1109\/ICIAP.2003.1234097"},{"key":"4887_CR27","unstructured":"K. Sevcik and N. Koudas. \u201cFilter trees for managing spatial data over a range of size granularities,\u201d in Proceedings of the International Conference on Very Large Databases-VLDB, pp. 16\u201327, Mumbai, India, September 1996."},{"key":"4887_CR28","doi-asserted-by":"crossref","unstructured":"I. Stoica, R. Morris, D. Karger, M.F. Kaashoek and H. Balakrishnan. \u201cChord: A scalable peer-to-peer lookup service for Internet applications,\u201d in Proceedings of the ACM SIGCOMM'01, pp. 149\u2013160, San Diego, CA, August 2001.","DOI":"10.1145\/383059.383071"},{"key":"4887_CR29","doi-asserted-by":"crossref","unstructured":"E. Tanin, A. Harwood and H. Samet. \u201cA distributed quadtree index for peer-to-peer settings,\u201d in Proceedings of the IEEE International Conference on Data Engineering, pp. 254\u2013255, Tokyo, Japan, April 2005.","DOI":"10.1109\/ICDE.2005.7"},{"key":"4887_CR30","doi-asserted-by":"crossref","unstructured":"E. Tanin, A. Harwood, H. Samet, S. Nutanong and M. Truong. \u201cA serverless 3D world,\u201d in Proceedings of the ACM Symposium on Advances in Geographic Information Systems, pp. 157\u2013165, Arlington, VA, November 2004.","DOI":"10.1145\/1032222.1032246"},{"key":"4887_CR31","unstructured":"B.Y. Zhao, J.D. Kubiatowicz and A.D. Joseph. \u201cTapestry: An infrastructure for fault-resilient wide-area location and routing,\u201d Technical Report UCB-CSD-01-1141, Department of Computer Science, University of California, Berkeley, April 2001."}],"container-title":["GeoInformatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10707-005-4887-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10707-005-4887-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10707-005-4887-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T18:16:56Z","timestamp":1559240216000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10707-005-4887-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,2,9]]},"references-count":31,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2006,3]]}},"alternative-id":["4887"],"URL":"https:\/\/doi.org\/10.1007\/s10707-005-4887-8","relation":{},"ISSN":["1384-6175","1573-7624"],"issn-type":[{"value":"1384-6175","type":"print"},{"value":"1573-7624","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,2,9]]}}}