{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T13:30:06Z","timestamp":1773235806913,"version":"3.50.1"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2006,4,4]],"date-time":"2006-04-04T00:00:00Z","timestamp":1144108800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The VLDB Journal"],"published-print":{"date-parts":[[2007,1,29]]},"DOI":"10.1007\/s00778-005-0001-y","type":"journal-article","created":{"date-parts":[[2006,4,3]],"date-time":"2006-04-03T16:55:55Z","timestamp":1144083355000},"page":"165-178","source":"Crossref","is-referenced-by-count":112,"title":["Using a distributed quadtree index in peer-to-peer networks"],"prefix":"10.1007","volume":"16","author":[{"given":"Egemen","family":"Tanin","sequence":"first","affiliation":[]},{"given":"Aaron","family":"Harwood","sequence":"additional","affiliation":[]},{"given":"Hanan","family":"Samet","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,4,4]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Aboulnaga, A., Naughton, J.F.: Accurate estimation of the cost of spatial selections. In: Proceedings of the 16th IEEE International Conference on Data Engineering, pp. 123\u2013134. San Diego, CA (2000)","DOI":"10.1109\/ICDE.2000.839399"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Andrzejak, A., Xu, Z.: Scalable, efficient range queries for Grid information services. In: Proceedings of the IEEE International Conference on Peer-to-Peer Computing, pp. 33\u201340. Linkoping, Sweden (2002)","DOI":"10.1109\/PTP.2002.1046310"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Aref, W.G., Samet, H.: Extending a DBMS with spatial operations. In: Proceedings of Advances in Spatial Databases, SSD'91, pp. 299\u2013318. Zurich, Switzerland (1991)","DOI":"10.1007\/3-540-54414-3_44"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Aspnes, J., Kirsch, J., Krishnamurthy, A.: Load balancing and locality in range-queriable data structures. In: Proceedings of the Symposium on Principles of Distributed Computing, pp. 115\u2013124. St. Johns, Canada (2004)","DOI":"10.1145\/1011767.1011785"},{"key":"1_CR5","unstructured":"Aspnes, J., Shah, G.: Skip graphs. In: Proceedings of SODA, pp. 384\u2013293. Baltimore, MD (2003)"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Banaei-Kashani, F., Shahabi, C.: SWAM: A family of access methods for similarity-search in peer-to-peer data networks. In: Proceedings of the Conference on Information and Knowledge Management-CIKM, pp. 304\u2013313. Washington, DC (2004)","DOI":"10.1145\/1031171.1031236"},{"issue":"9","key":"1_CR7","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1145\/361002.361007","volume":"18","author":"J.L. Bentley","year":"1975","unstructured":"Bentley, J.L.: Multidimensional binary search trees used for associative searching. Commun. ACM 18(9), 509\u2013517 (1975)","journal-title":"Commun. ACM"},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"Bharambe, A.R., Agrawal, M., Seshan, S.: Mercury: Supporting scalable multi-attribute range queries. In: Proceedings of the ACM SIGCOMM'04, pp. 353\u2013366. Portland, OR (2004)","DOI":"10.1145\/1015467.1015507"},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"Cai, M., Frank, M., Chen, J., Szekely, P.: MAAN: A multi-attribute addressable network for Grid information services. In: Proceedings of the International Workshop on Grid Computing, pp. 184\u2013191. Phoenix, AZ (2003)","DOI":"10.1109\/GRID.2003.1261714"},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"Cheng, W.C., Chou, C.F., Golubchik, L., Khuller, S., Wan, Y.C.: Large-scale data collection: a coordinated approach. In: Proceedings of the IEEE InfoCom'03, pp. 218\u2013228. San Francisco, CA (2003)","DOI":"10.1109\/INFCOM.2003.1208674"},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"Crainiceanu, A., Linga, P., Gehrke, J., Shanmugasundaram, J.: Querying peer-to-peer networks using P-Trees. In: Proceedings of the ACM SIGMOD'04, WebDB Workshop, pp. 25\u201330. Paris, France (2004)","DOI":"10.1145\/1017074.1017082"},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Daskos, A., Ghandeharizadeh, S., An, X.: PePeR: A distributed range addressing space for P2P systems. In: Proceedings of the International Workshop on Databases, Information Systems, and Peer-to-Peer Computing (held in conjunction with VLDB), pp. 200\u2013218. Berlin, Germany (2003)","DOI":"10.1007\/978-3-540-24629-9_15"},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"Demirbas, M., Ferhatosmanoglu, H.: Peer-to-peer spatial queries in sensor networks. In: Proceedings of the IEEE International Conference on Peer-to-Peer Computing, pp. 32\u201339. Linkoping, Sweden (2003)","DOI":"10.1109\/PTP.2003.1231501"},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"Ganesan, P., Bawa, M., Garcia-Molina, H.: Online balancing of range-partitioned data with applications to peer-to-peer systems. In: Proceedings of the International Conference on Very Large Databases-VLDB, pp. 444\u2013455. Toronto, Canada (2004)","DOI":"10.1016\/B978-012088469-8\/50041-3"},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"Ganesan, P., Yang, B., Garcia-Molina, H.: One torus to rule them all: Multidimensional queries in P2P systems. In: Proceedings of the ACM SIGMOD'04, WebDB Workshop, pp. 19\u201324. Paris, France (2004)","DOI":"10.1145\/1017074.1017081"},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"Gao, J., Guibas, L.J., Hershberger, J., Zhang, L.: Fractionally cascaded information in a sensor network. In: Proceedings of the IPSN'04, pp. 311\u2013319. Berkeley, CA (2004)","DOI":"10.1145\/984622.984668"},{"key":"1_CR17","unstructured":"Gupta, A., Agrawal, D., El Abbadi, A.: Approximate range selection queries in peer-to-peer systems. In: Proceedings of the First Biennial Conference on Innovative Data Systems Research. Asilomar, CA (2003)"},{"key":"1_CR18","unstructured":"Harwood, A., Karunasekera, S., Nutanong, S., Tanin, E., Truong, M.: Complex applications over peer-to-peer networks. In: Poster Proceedings of the ACM Middleware'04, p. 327. Toronto, Canada (2004)"},{"key":"1_CR19","doi-asserted-by":"crossref","unstructured":"Kedem, G.: The quad-CIF tree: a data structure for hierarchical on-line algorithms. In: Proceedings of the 19th Design Automation Conference, pp. 352\u2013357. Las Vegas, NV (1982)","DOI":"10.1145\/800263.809229"},{"key":"1_CR20","doi-asserted-by":"crossref","unstructured":"Kothari, A., Agrawal, D., Gupta, A., Suri, S.: Range addressable network: A P2P cache architecture for data ranges. In: Proceedings of the IEEE International Conference on Peer-to-Peer Computing, pp. 14\u201322. Linkoping, Sweden (2003)","DOI":"10.1109\/PTP.2003.1231499"},{"key":"1_CR21","doi-asserted-by":"crossref","unstructured":"Li, J., Jannotti, J., Couto, D.S.J.D., Karger, D.R., Morris, R.: A scalable location service for geographical ad hoc routing. In: Proceedings of the ACM MOBICOM'00, pp. 120\u2013130. Boston, MA (2000)","DOI":"10.1145\/345910.345931"},{"key":"1_CR22","doi-asserted-by":"crossref","unstructured":"Li, X., Kim, Y.J., Govidan, R., Hong, W.: Multi-dimensional range queries in sensor networks. In: Proceedings of the ACM SenSys'03, pp. 63\u201375. Los Angeles, CA (2003)","DOI":"10.1145\/958491.958500"},{"issue":"4","key":"1_CR23","doi-asserted-by":"crossref","first-page":"923","DOI":"10.1109\/TKDE.2002.1019223","volume":"14","author":"W. Litwin","year":"2002","unstructured":"Litwin, W., Risch, T.: LH*g: A high-availability scalable distributed data structure by record grouping. IEEE Trans. Knowl. Data Eng. 14(4), 923\u2013927 (2002)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"1_CR24","doi-asserted-by":"crossref","unstructured":"Misra, A., Castro, P., Lee, J.: CLASH: A protocol for Internet-scale utility-oriented distributed computing. In: Proceedings of the International Conference on Distributed Computing Systems, pp. 273\u2013281. Tokyo, Japan (2004)","DOI":"10.1109\/ICDCS.2004.1281592"},{"key":"1_CR25","doi-asserted-by":"crossref","unstructured":"Mondal, A., Yilifu, Kitsuregawa, M.: P2PR-tree: An R-tree-based spatial index for peer-to-peer environments. In: Proceedings of the International Workshop on Peer-to-Peer Computing and Databases (held in conjunction with EDBT), pp. 516\u2013525. Heraklion-Crete, Greece (2004)","DOI":"10.1007\/978-3-540-30192-9_51"},{"key":"1_CR26","doi-asserted-by":"crossref","unstructured":"Ramabhadran, S., Ratnasamy, S., Hellerstein, J.M., Shenker, S.: Prefix hash tree. In: Proceedings of ACM PODC, p. 368. St. Johns, Canada (2004)","DOI":"10.1145\/1011767.1011823"},{"key":"1_CR27","doi-asserted-by":"crossref","unstructured":"Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable content-addressable network. In: Proceedings of the ACM SIGCOMM'01, pp. 161\u2013172. San Diego, CA (2001)","DOI":"10.1145\/383059.383072"},{"key":"1_CR28","doi-asserted-by":"crossref","unstructured":"Rowstron, A., Druschel, P.: Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In: Proceedings of the ACM Middleware'01, pp. 329\u2013350. Heidelberg, Germany (2001)","DOI":"10.1007\/3-540-45518-3_18"},{"key":"1_CR29","doi-asserted-by":"crossref","unstructured":"Sahin, O.D., Gupta, A., Agrawal, D., El Abbadi, A.: A peer-to-peer framework for caching range queries. In: Proceedings of the 20th IEEE International Conference on Data Engineering, pp. 165\u2013176. Boston, MA (2004)","DOI":"10.1109\/ICDE.2004.1319993"},{"key":"1_CR30","unstructured":"Samet, H.: Applications of Spatial Data Structures: Computer Graphics, Image Processing, and GIS. Addison-Wesley, Reading, MA (1990)"},{"key":"1_CR31","doi-asserted-by":"crossref","unstructured":"Samet, H.: The Design and Analysis of Spatial Data Structures. Addison-Wesley, Reading, MA (1990)","DOI":"10.1007\/3-540-52208-5_28"},{"key":"1_CR32","unstructured":"Samet, H.: Foundations of Multidimensional Data Structures. Morgan Kaufmann, San Francisco (2005)"},{"key":"1_CR33","unstructured":"Sevcik, K., Koudas, N.: Filter trees for managing spatial data over a range of size granularities. In: Proceedings of the International Conference on Very Large Databases-VLDB, pp. 16\u201327. Mumbai, India (1996)"},{"key":"1_CR34","doi-asserted-by":"crossref","unstructured":"Silaghi, B., Bhattacharjee, B., Keleher, P.: Query routing in the TerraDir distributed directory. In: Proceedings of the SPIE ITCOM'02. Boston, MA (2002)","DOI":"10.1117\/12.475281"},{"key":"1_CR35","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: Proceedings of the ACM SIGCOMM'01, pp. 149\u2013160. San Diego, CA (2001)","DOI":"10.1145\/383059.383071"},{"key":"1_CR36","doi-asserted-by":"crossref","unstructured":"Tanin, E., Harwood, A., Samet, H., Nutanong, S., Truong, M.: A serverless 3D world. In: Proceedings of the Symposium on Advances in Geographic Information Systems, pp. 157\u2013165. Arlington, VA (2004)","DOI":"10.1145\/1032222.1032246"},{"key":"1_CR37","first-page":"444","volume-title":"Game Programming Gems","author":"T. Ulrich","year":"2000","unstructured":"Ulrich, T.: Loose octrees. In: M. DeLoura (ed.) Game Programming Gems, pp. 444\u2013453. Charles River Media, Rockland, MA (2000)"},{"issue":"1","key":"1_CR38","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1109\/JSAC.2003.818784","volume":"22","author":"B.Y. Zhao","year":"2004","unstructured":"Zhao, B.Y., Huang, L., Stribling, J., Rhea, S.C., Joseph, A.D., Kubiatowicz, J.: Tapestry: A resilient global-scale overlay for service deployment. IEEE J. Selected Areas Commun. 22(1), 41\u201353","journal-title":"IEEE J. Selected Areas Commun."}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-005-0001-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00778-005-0001-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-005-0001-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,8]],"date-time":"2025-01-08T06:29:54Z","timestamp":1736317794000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00778-005-0001-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,4,4]]},"references-count":38,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2007,1,29]]}},"alternative-id":["1"],"URL":"https:\/\/doi.org\/10.1007\/s00778-005-0001-y","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"value":"1066-8888","type":"print"},{"value":"0949-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,4,4]]}}}