{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T19:32:30Z","timestamp":1649014350950},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2010,12,30]],"date-time":"2010-12-30T00:00:00Z","timestamp":1293667200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Peer-to-Peer Netw. Appl."],"published-print":{"date-parts":[[2011,12]]},"DOI":"10.1007\/s12083-010-0097-8","type":"journal-article","created":{"date-parts":[[2010,12,29]],"date-time":"2010-12-29T06:21:55Z","timestamp":1293603715000},"page":"391-409","source":"Crossref","is-referenced-by-count":1,"title":["Dynamic storage and access load balancing for answering range queries in peer-to-peer networks"],"prefix":"10.1007","volume":"4","author":[{"given":"Zaher","family":"Al Aghbari","sequence":"first","affiliation":[]},{"given":"Ibrahim","family":"Kamel","sequence":"additional","affiliation":[]},{"given":"Ahmed","family":"Mustafa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,12,30]]},"reference":[{"key":"97_CR1","unstructured":"Andrzejak A, Xu Z (2002) Scalable, efficient range queries for Grid Information services. Proceedings of the Second IEEE International Conference on Peer-to-Peer Computing, Sweden"},{"key":"97_CR2","unstructured":"Butt A, Johnson T, Zheng Y, Hu Y (2004) Kosha: A Peer-to-Peer Enhancement for the Network File System. In Proc. of the ACM\/IEEE SC 2004: High Performance Computing, Networking and Storage Conference, Pittsburgh, PA"},{"key":"97_CR3","doi-asserted-by":"crossref","unstructured":"Crainiceanu A, Linga P, Gehrke J, Shanmugasundaram J (2004) Querying Peer-to-Peer Networks Using P-Trees. In Proc. of 7th Intl. Workshop on the Web and Databases, Cornell University, Paris, France","DOI":"10.1145\/1017074.1017082"},{"key":"97_CR4","unstructured":"Gupta A, Agrawal D, Abbadi AE (2003) Approximate range selection queries in peer-to-peer systems. In Proc. First Biennial Conference on Innovative Data Systems Research (CIDR)"},{"key":"97_CR5","unstructured":"Gupta A, Dinda P, Bustamante FE (2005) Distributed popularity indices. In: Proceedings of ACM SIGCOMM"},{"key":"97_CR6","doi-asserted-by":"crossref","unstructured":"Mondal A, Lifu Y, Kitsuregawa M (2004) P2PR-Tree: An R-Tree-Based Spatial Index for Peer-to-Peer Environments. In Extended Database Technology (EDBT) Workshops, pages 516\u2013525","DOI":"10.1007\/978-3-540-30192-9_51"},{"key":"97_CR7","doi-asserted-by":"crossref","unstructured":"Bharambe AR, Agrawal M, Seshan S (2004) Mercury: Supporting Scalable Multi-Attribute Range Queries. In Proc. of the ACM SIGCOMM Conference","DOI":"10.1145\/1015467.1015507"},{"key":"97_CR8","doi-asserted-by":"crossref","unstructured":"Rao A, Lakshminarayanan K, Surana S, Karp R, Stoica I (2003) Load Balancing in Structured P2P Systems. In Proceedings of the International workshop on Peer-To-Peer Systems","DOI":"10.1007\/978-3-540-45172-3_6"},{"key":"97_CR9","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1007\/3-540-45518-3_18","volume":"2218","author":"A Rowstron","year":"2001","unstructured":"Rowstron A, Druschel P (2001) Pastry: scalable, decentralized object location, and routing for large-scale peer-to-peer systems. Lect Notes Comput Sci 2218:329\u2013350","journal-title":"Lect Notes Comput Sci"},{"key":"97_CR10","doi-asserted-by":"crossref","unstructured":"Karger D, Ruhl M (2004) Simple Efficient Load Balancing Algorithms for Peer-to-Peer Systems. In Proc. of the 16th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)","DOI":"10.1145\/1007912.1007919"},{"key":"97_CR11","doi-asserted-by":"crossref","unstructured":"Tanin E, Harwood A, Samet H (2005) A distributed quadtree index for peer-to-peer settings. In Proceedings of the International Conference on Data Engineering\u2014ICDE. Tokyo, Japan, pp 254\u2013255","DOI":"10.1109\/ICDE.2005.7"},{"key":"97_CR12","unstructured":"FIPS 180-1. Secure Hash Standard. U.S. Department of Commerce\/NIST, National Technical Information Service, Springfield, VA, April 1995"},{"key":"97_CR13","unstructured":"Gnutella. http:\/\/gnutella.wego.com\/"},{"key":"97_CR14","doi-asserted-by":"crossref","unstructured":"Balakrishnan H, Kaashoek MF, Karger D, Morris R, Stoica I (2003) Looking up data in p2p systems. Communications of the ACM, Vol. 46, No. 2, USA, pp. 43\u201348","DOI":"10.1145\/606272.606299"},{"key":"97_CR15","doi-asserted-by":"crossref","unstructured":"Wang H, Zimmermann R, Ku WS (2005) ASPEN: an adaptive spatial peer-to-peer network, Proceedings of the 13th annual ACM international workshop on Geographic information systems, Bremen, Germany","DOI":"10.1145\/1097064.1097097"},{"key":"97_CR16","unstructured":"Jagadish HV, Ooi BC, Vu QH (2005) BATON: A balanced tree structure for peer-to-peer networks. In Proc. of Very Large Databases (VLDB)"},{"key":"97_CR17","doi-asserted-by":"crossref","unstructured":"Stoica I, Morris R, Karger D, Kaashoek MF, Balakrishnan H (2001) Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications. In: Proceedings of SIGCOMM","DOI":"10.1145\/383059.383071"},{"key":"97_CR18","unstructured":"Ardenghi J, Echaiz J (2007) Peer-to-Peer Systems: The Present and the Future. Vol. 7 - No. 3 - Journal of Computer Science & Technology (JCS&T), ISSN 1666-6038, pp. 198\u2013203. La Plata"},{"key":"97_CR19","unstructured":"Aspnes J, Shah G (2003) Skip graphs. In Proc. of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)"},{"key":"97_CR20","doi-asserted-by":"crossref","unstructured":"Aspnes J, Kirsch J, Krishnamurthy A (2004). Load Balancing and Locality in Range-Queriable Data Structures. In: Proceedings of the 23rd Annual ACM Symposium on Principles of Distributed Computing","DOI":"10.1145\/1011767.1011785"},{"key":"97_CR21","unstructured":"KaZaA. http:\/\/www.kazaa.com\/"},{"key":"97_CR22","unstructured":"Breslau L, Cao P, Fan L, Phillips G, Shenker S (1999) Web cashing and zipf-like distribution: Evidence and implications, In Proc. of IEEE Infocom, vol. XX, no. V, pp. 1\u20139"},{"key":"97_CR23","unstructured":"Abdallah M, Buyukkaya E (2006) Efficient Routing in Non-Uniform DHTs for Range Query Support In: Proc. of the International Conference on Parallel and Distributed Computing and Systems (PDCS), USA"},{"key":"97_CR24","unstructured":"Abdallah M, Buyukkaya E (2007) Fair Load Balancing Under Skewed Popularity Patterns in Heterogeneous DHT-Based P2P Systems, In Proc. of the International Conference on Parallel and Distributed Computing and Systems (PDCS), Cambridge, Ma, USA"},{"key":"97_CR25","unstructured":"Abdallah M, Le HC (2005) Scalable range query processing for large-scale distributed database applications. In: Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Systems (PDCS), USA"},{"issue":"1","key":"97_CR26","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s10723-004-1184-y","volume":"2","author":"M Cai","year":"2004","unstructured":"Cai M, Frank M, Chen J, Szekely P (2004) MAAN: a multi-attribute addressable network for grid information services. J Grid Comput 2(1):3\u201314","journal-title":"J Grid Comput"},{"key":"97_CR27","unstructured":"Harvey NJ, Jones M, Saroiu S, Theimer M, Wolman A (2003) Skipnet: a scalable overlay network with practical locality properties. In Proceedings of USITS, Seattle, WA"},{"key":"97_CR28","unstructured":"Napster. http:\/\/www.napster.com\/"},{"key":"97_CR29","unstructured":"Sahin OD, Gupta A, Agrawal D, Abbadi AE (2004) A peer-to-peer framework for caching range queries. In: Proc. of ICDE"},{"key":"97_CR30","unstructured":"Ganesan P, Yang B, Garcia-Molina H (2004) One torus to rule them all: Multidimensional queries in P2P systems. In: Proceedings of the ACM SIGMOD\u201904, WebDB Workshop. Paris, France, pp 19\u201324"},{"key":"97_CR31","doi-asserted-by":"crossref","unstructured":"Ganesan P, Bawa M, Garcia-Molina H (2004) Online Balancing of Range-Partitioned Data with Applications to Peer-to-Peer Systems. Proc. Very Large Data Bases Conf, pp 444\u2013455","DOI":"10.1016\/B978-012088469-8.50041-3"},{"key":"97_CR32","unstructured":"Blanco R, Ahmed N, Hadaller D, Sung LG, Li H (2006) & M.A. Soliman, A survey of Data Management in Peer-to-Peer Systems. Technical Report (CS-2006-18). University of Waterloo"},{"issue":"4","key":"97_CR33","doi-asserted-by":"crossref","first-page":"660","DOI":"10.1007\/s11390-008-9162-7","volume":"23","author":"RY Xiao","year":"2008","unstructured":"Xiao RY (2008) Survey on anonymity in unstructured peer-to-peer systems. J Comput Sci Technol 23(4):660\u2013671","journal-title":"J Comput Sci Technol"},{"key":"97_CR34","unstructured":"AL-Kassimi S (2005) Evaluation of a scalable peer-to-peer lookup protocol for internet applications, Master of Science Thesis, Swedish Institute of Computer Science, Stockholm, Sweden"},{"key":"97_CR35","doi-asserted-by":"crossref","unstructured":"Ramabhadran S, Ratnasamy S, Hellerstein J, Shenker S (2004) Brief announcement: prefix hash tree, In Proc. of Proc. 23rd Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC, pp. 368\u2013368","DOI":"10.1145\/1011767.1011823"},{"key":"97_CR36","unstructured":"Gribble SD, Halevy AY, Ives ZG, Rodrig M, Suciu D (2001) What Can Database Do for Peer-to-Peer? In Proc. of the ACM SIGMOD WebDB workshop"},{"key":"97_CR37","doi-asserted-by":"crossref","unstructured":"Ratnasamy S, Francis P, Handley M, Karp R, Shenker S (2001) A scalable content-addressable network. In Proceedings of the 2001 conference on applications, technologies, architectures, and protocols for computer communications, pages 161\u2013172. ACM Press","DOI":"10.1145\/383059.383072"},{"key":"97_CR38","doi-asserted-by":"crossref","unstructured":"Pitoura T, Ntarmos N, Triantafillou P (2006) Replication, Load Balancing and Efficient Range Query Processing in DHTs, 10th International Conference on Extending Database Technology (EDBT06)","DOI":"10.1007\/11687238_11"},{"key":"97_CR39","unstructured":"Zhao YB, Kubiatowicz J, Joseph A (2001) Tapestry: An infrastructure for fault-tolerant wide-area location and routing. Technical Report Tech. Rep. UCB\/CSD-01-1141, University of California at Berkeley"},{"key":"97_CR40","unstructured":"Datta A, Hauswirth M, John R, Schmidt R, Aberer K (2005) Range Queries in Trie-Structured Overlays. IEEE International Conference on Peer-to-Peer Computing"},{"key":"97_CR41","doi-asserted-by":"crossref","unstructured":"Liu L, Xu J, Russell D, Townend P, Webster D (2009) Efficient and scalable search on scale-free P2P networks. Springer Peer-to-Peer Networking and Applications Journal, 2(2)","DOI":"10.1007\/s12083-008-0023-5"},{"key":"97_CR42","doi-asserted-by":"crossref","unstructured":"Li M, Qi M (2009) Facilitating resource discovery in grid environment with peer-to-peer structured tuple spaces. Springer Peer-to-Peer Networking and Applications Journal 2(4)","DOI":"10.1007\/s12083-009-0036-8"},{"issue":"1","key":"97_CR43","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/j.future.2008.02.010","volume":"25","author":"R Zhang","year":"2009","unstructured":"Zhang R, Qian W, Zhou A, Zhou M (2009) An efficient peer-to-peer indexing tree structure for multidimensional data. Elsevier J Future Gener Comput Syst 25(1):77\u201388","journal-title":"Elsevier J Future Gener Comput Syst"}],"container-title":["Peer-to-Peer Networking and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12083-010-0097-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12083-010-0097-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12083-010-0097-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,7]],"date-time":"2019-06-07T10:38:17Z","timestamp":1559903897000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12083-010-0097-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,12,30]]},"references-count":43,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2011,12]]}},"alternative-id":["97"],"URL":"https:\/\/doi.org\/10.1007\/s12083-010-0097-8","relation":{},"ISSN":["1936-6442","1936-6450"],"issn-type":[{"value":"1936-6442","type":"print"},{"value":"1936-6450","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,12,30]]}}}