{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T20:42:02Z","timestamp":1649018522176},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2016,2,15]],"date-time":"2016-02-15T00:00:00Z","timestamp":1455494400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Peer-to-Peer Netw. Appl."],"published-print":{"date-parts":[[2017,7]]},"DOI":"10.1007\/s12083-016-0436-5","type":"journal-article","created":{"date-parts":[[2016,2,15]],"date-time":"2016-02-15T02:50:01Z","timestamp":1455504601000},"page":"874-886","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A fault tolerant peer-to-peer spatial data structure"],"prefix":"10.1007","volume":"10","author":[{"given":"Pouya","family":"Bisadi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zahra","family":"Mirikharaji","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bradford G.","family":"Nickerson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,2,15]]},"reference":[{"key":"436_CR1","doi-asserted-by":"publisher","unstructured":"Andrzejak A, Xu Z (2002) Scalable, efficient range queries for grid information services. In: Proceedings. Second international conference on Peer-to-peer computing, 2002.(p2p 2002). IEEE, pp 33\u201340","DOI":"10.1109\/PTP.2002.1046310"},{"issue":"4","key":"436_CR2","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1145\/1290672.1290674","volume":"3","author":"J Aspnes","year":"2007","unstructured":"Aspnes J, Shah G (2007) Skip graphs. ACM Trans Algorithm (TALG) 3(4):37","journal-title":"ACM Trans Algorithm (TALG)"},{"issue":"4","key":"436_CR3","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1145\/1030194.1015507","volume":"34","author":"AR Bharambe","year":"2004","unstructured":"Bharambe AR, Agrawal M, Seshan S (2004) Mercury: supporting scalable multi-attribute range queries. ACM SIGCOMM Comput Commun Rev 34(4):353\u2013366","journal-title":"ACM SIGCOMM Comput Commun Rev"},{"key":"436_CR4","unstructured":"Birkhoff G (1967) Lattice theory, vol. 25 American Mathematical Society"},{"key":"436_CR5","unstructured":"Bisadi P, Nickerson BG (2011) Orthogonal range search using a distributed computing model. In: Proceedings of 23rd canadian conference on computational geometry (CCCG 2011), pp 337\u2013342"},{"key":"436_CR6","doi-asserted-by":"publisher","unstructured":"Crainiceanu A, Linga P, Gehrke J, Shanmugasundaram J (2004) P-tree: a p2p index for resource discovery applications. In: Proceedings of the 13th international world wide web conference on alternate track papers & posters. ACM, pp 390\u2013391","DOI":"10.1145\/1013367.1013490"},{"key":"436_CR7","doi-asserted-by":"publisher","unstructured":"Goodrich MT, Nelson MJ, Sun JZ (2006) The rainbow skip graph: a fault-tolerant constant-degree distributed data structure. In: Proceedings of the seventeenth annual ACM-SIAM symposium on discrete algorithm. ACM, pp 384\u2013393","DOI":"10.1145\/1109557.1109601"},{"key":"436_CR8","unstructured":"Goodrich MT, Nelson MJ, Sun JZ (2009) The rainbow skip graph: A fault-tolerant constant-degree p2p relay structure. arXiv preprint arXiv:\n                        0905.2214"},{"key":"436_CR9","unstructured":"Gupta A, Agrawal D, El Abbadi A (2003) Approximate range selection queries in peer-to-peer systems. In: CIDR, vol 3, pp 141\u2013151"},{"key":"436_CR10","unstructured":"Harvey NJ, Jones MB, Saroiu S, Theimer M, Wolman A (2003) Skipnet: a scalable overlay network with practical locality properties, WA, USA"},{"issue":"1","key":"436_CR11","first-page":"78","volume":"21","author":"D Li","year":"2009","unstructured":"Li D, Cao J, Lu X, Chan K (2009) Efficient range query processing in peer-to-peer systems. Knowledge and Data Engineering. IEEE Trans 21(1):78\u201391","journal-title":"IEEE Trans"},{"key":"436_CR12","unstructured":"Li D, Lu X, Wu J (2005) Fissione: a scalable constant degree and low congestion dht scheme based on kautz graphs. In: INFOCOM 2005. 24Th annual joint conference of the IEEE computer and communications societies. Proceedings IEEE, vol 3. IEEE, pp 1677\u20131688"},{"key":"436_CR13","doi-asserted-by":"publisher","unstructured":"Ratnasamy S, Francis P, Handley M, Karp R, Shenker S (2001) A scalable content-addressable network, vol. 31 ACM","DOI":"10.1145\/383059.383072"},{"key":"436_CR14","doi-asserted-by":"publisher","unstructured":"Ratnasamy S, Stoica I, Shenker S (2002) Routing algorithms for dhts: Some open questions. In: Peer-to-peer systems. Springer, pp 45\u201352","DOI":"10.1007\/3-540-45748-8_4"},{"key":"436_CR15","doi-asserted-by":"publisher","unstructured":"Rowstron A, Druschel P (2001) Pastry: scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In: Middleware 2001. Springer, pp 329\u2013350","DOI":"10.1007\/3-540-45518-3_18"},{"key":"436_CR16","unstructured":"Samet H (2006) Foundations of multidimensional and metric data structures Morgan Kaufmann"},{"issue":"3","key":"436_CR17","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1109\/MIC.2004.1297269","volume":"8","author":"C Schmidt","year":"2004","unstructured":"Schmidt C, Parashar M (2004) Enabling flexible queries with guarantees in p2p systems. IEEE Internet Comput 8(3):19\u201326","journal-title":"IEEE Internet Comput"},{"key":"436_CR18","unstructured":"Shu Y, Ooi BC, Tan KL, Zhou A (2005) Supporting multi-dimensional range queries in peer-to-peer systems. In: Fifth IEEE international conference on Peer-to-peer computing, 2005. p2p 2005. IEEE, pp 173\u2013180"},{"issue":"1","key":"436_CR19","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1016\/S0012-365X(99)00273-3","volume":"217","author":"R Simion","year":"2000","unstructured":"Simion R (2000) Noncrossing partitions. Discr Math 217(1): 367\u2013409","journal-title":"Discr Math"},{"issue":"4","key":"436_CR20","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1145\/964723.383071","volume":"31","author":"I Stoica","year":"2001","unstructured":"Stoica I, Morris R, Karger D, Kaashoek MF, Balakrishnan H (2001) Chord: a scalable peer-to-peer lookup service for internet applications. ACM SIGCOMM Comput Commun Rev 31(4):149\u2013160","journal-title":"ACM SIGCOMM Comput Commun Rev"},{"key":"436_CR21","doi-asserted-by":"publisher","unstructured":"Tsatsanifos G, Sacharidis D, Sellis T (2011) Midas: multi-attribute indexing for distributed architecture systems. In: Advances in spatial and temporal databases. Springer, pp 168\u2013185","DOI":"10.1007\/978-3-642-22922-0_11"},{"key":"436_CR22","unstructured":"Zatloukal KC, Harvey NJ (2004) Family trees: an ordered dictionary with optimal congestion, locality, degree, and search time. In: Proceedings of the fifteenth annual ACM-SIAM symposium on discrete algorithms. Society for industrial and applied mathematics, pp 308\u2013317"},{"issue":"11","key":"436_CR23","doi-asserted-by":"publisher","first-page":"2221","DOI":"10.1007\/s11432-011-4377-6","volume":"54","author":"Y Zhang","year":"2011","unstructured":"Zhang Y, Lu X, Li D (2011) Survey of dht topology construction techniques in virtual computing environments. Sc China Inf Sci 54(11):2221\u20132235","journal-title":"Sc China Inf Sci"},{"issue":"1","key":"436_CR24","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1109\/JSAC.2003.818784","volume":"22","author":"BY Zhao","year":"2004","unstructured":"Zhao BY, Huang L, Stribling J, Rhea SC, Joseph AD, Kubiatowicz JD (2004) Tapestry: A resilient global-scale overlay for service deployment. IEEE J Sel Areas Commun 22(1):41\u201353","journal-title":"IEEE J Sel Areas Commun"}],"container-title":["Peer-to-Peer Networking and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12083-016-0436-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12083-016-0436-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12083-016-0436-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12083-016-0436-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T03:44:56Z","timestamp":1559447096000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12083-016-0436-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,2,15]]},"references-count":24,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017,7]]}},"alternative-id":["436"],"URL":"https:\/\/doi.org\/10.1007\/s12083-016-0436-5","relation":{},"ISSN":["1936-6442","1936-6450"],"issn-type":[{"value":"1936-6442","type":"print"},{"value":"1936-6450","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,2,15]]}}}