{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T02:16:38Z","timestamp":1742955398005,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030197582"},{"type":"electronic","value":"9783030197599"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-19759-9_4","type":"book-chapter","created":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T03:47:10Z","timestamp":1556336830000},"page":"46-58","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Peer-to-Peer Based Cloud Storage Supporting Orthogonal Range Queries of Arbitrary Dimension"],"prefix":"10.1007","author":[{"given":"Markus","family":"Benter","sequence":"first","affiliation":[]},{"given":"Till","family":"Knollmann","sequence":"additional","affiliation":[]},{"given":"Friedhelm Meyer","family":"auf der Heide","sequence":"additional","affiliation":[]},{"given":"Alexander","family":"Setzer","sequence":"additional","affiliation":[]},{"given":"Jannik","family":"Sundermeier","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,4,28]]},"reference":[{"issue":"4","key":"4_CR1","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/s002240010003","volume":"33","author":"J Alber","year":"2000","unstructured":"Alber, J., Niedermeier, R.: On multidimensional curves with hilbert property. Theory Comput. Syst. 33(4), 295\u2013312 (2000). \n                    https:\/\/doi.org\/10.1007\/s002240010003","journal-title":"Theory Comput. Syst."},{"issue":"4","key":"4_CR2","doi-asserted-by":"publisher","first-page":"18:1","DOI":"10.1145\/1391949.1391952","volume":"8","author":"J Albrecht","year":"2008","unstructured":"Albrecht, J., Oppenheimer, D., Vahdat, A., Patterson, D.A.: Design and implementation trade-offs for wide-area resource discovery. ACM Trans. Internet Technol. 8(4), 18:1\u201318:44 (2008). \n                    https:\/\/doi.org\/10.1145\/1391949.1391952","journal-title":"ACM Trans. Internet Technol."},{"key":"4_CR3","doi-asserted-by":"publisher","unstructured":"Andrzejak, A., Xu, Z.: Scalable, efficient range queries for grid information services. In: P2P 2002 Proceedings of the Second International Conference on Peer-to-Peer Computing, pp. 33\u201340 (2002). \n                    https:\/\/doi.org\/10.1109\/PTP.2002.1046310","DOI":"10.1109\/PTP.2002.1046310"},{"issue":"1","key":"4_CR4","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10723-004-1184-y","volume":"2","author":"M Cai","year":"2003","unstructured":"Cai, M., Frank, M., Chen, J., Szekely, P.: MAAN: a multi-attribute addressable network for grid information services. J. Grid Comput. 2(1), 3\u201314 (2003). \n                    https:\/\/doi.org\/10.1007\/s10723-004-1184-y","journal-title":"J. Grid Comput."},{"key":"4_CR5","doi-asserted-by":"publisher","unstructured":"Carlini, E., Lulli, A., Ricci, L.: DRAGON: multidimensional range queries on distributed aggregation trees. Future Gener. Comput. Syst. 55, 101\u2013115 (2016). \n                    https:\/\/doi.org\/10.1016\/j.future.2015.07.020\n                    \n                  , \n                    http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0167739X15002526","DOI":"10.1016\/j.future.2015.07.020"},{"key":"4_CR6","unstructured":"Datta, A., Hauswirth, M., John, R., Schmidt, R., Aberer, K.: Range queries in trie-structured overlays. In: P2P 2005 Proceedings of the Fifth IEEE International Conference on Peer-to-Peer Computing, pp. 57\u201366. IEEE (2005)"},{"key":"4_CR7","doi-asserted-by":"publisher","unstructured":"Ganesan, P., Yang, B., Garcia-Molina, H.: One torus to rule them all: multi-dimensional queries in P2P systems. In: WebDB 2004 Proceedings of the 7th International Workshop on the Web and Databases: Colocated with ACM SIGMOD\/PODS 2004 WebDB 2004, pp. 19\u201324. ACM, New York (2004). \n                    https:\/\/doi.org\/10.1145\/1017074.1017081","DOI":"10.1145\/1017074.1017081"},{"key":"4_CR8","doi-asserted-by":"publisher","unstructured":"Hilbert, D.: \u00dcber die stetige Abbildung einer Linie auf ein Fl\u00e4chenst\u00fcck, pp. 1\u20132. Springer, Heidelberg (1935). \n                    https:\/\/doi.org\/10.1007\/978-3-662-38452-7-1","DOI":"10.1007\/978-3-662-38452-7-1"},{"key":"4_CR9","unstructured":"Jagadish, H.V., Ooi, B.C., Vu, Q.H.: Baton: a balanced tree structure for peer-to-peer networks. In: Proceedings of the 31st International Conference on Very Large Data Bases VLDB Endowment, pp. 661\u2013672 (2005)"},{"key":"4_CR10","doi-asserted-by":"publisher","unstructured":"Lee, K., Choi, T., Boykin, P.O., Figueiredo, R.J.: MatchTree: flexible, scalable, and fault-tolerant wide-area resource discovery with distributed matchmaking and aggregation. Future Gener. Comput. Syst. 29(6), 1596\u20131610 (2013). \n                    https:\/\/doi.org\/10.1016\/j.future.2012.08.009\n                    \n                  , \n                    http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0167739X12001653\n                    \n                  . including Special sections: High Performance Computing in the Cloud & Resource Discovery Mechanisms for P2P Systems","DOI":"10.1016\/j.future.2012.08.009"},{"issue":"1","key":"4_CR11","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1109\/TKDE.2008.99","volume":"21","author":"D Li","year":"2009","unstructured":"Li, D., Cao, J., Lu, X., Chen, K.C.C.: Efficient range query processing in peer-to-peer systems. IEEE Trans. Knowl. Data Eng. 21(1), 78\u201391 (2009). \n                    https:\/\/doi.org\/10.1109\/TKDE.2008.99","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"4_CR12","doi-asserted-by":"publisher","first-page":"845","DOI":"10.1038\/35022643","volume":"406","author":"JM Kleinberg","year":"2000","unstructured":"Kleinberg, J.M.: Navigation in a small world. Nature 406, 845 (2000)","journal-title":"Nature"},{"issue":"3","key":"4_CR13","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1145\/1273340.1273350","volume":"3","author":"M Naor","year":"2007","unstructured":"Naor, M., Wieder, U.: Novel architectures for P2P applications: the continuous-discrete approach. ACM Trans. Algorithms 3(3), 34 (2007). \n                    https:\/\/doi.org\/10.1145\/1273340.1273350","journal-title":"ACM Trans. Algorithms"},{"issue":"7","key":"4_CR14","doi-asserted-by":"publisher","first-page":"1313","DOI":"10.1109\/TKDE.2010.266","volume":"24","author":"T Pitoura","year":"2012","unstructured":"Pitoura, T., Ntarmos, N., Triantafillou, P.: Saturn: range queries, load balancing and fault tolerance in DHT data systems. IEEE Trans. Knowl. Data Eng. 24(7), 1313\u20131327 (2012). \n                    https:\/\/doi.org\/10.1109\/TKDE.2010.266","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"4_CR15","unstructured":"Ramabhadran, S., Ratnasamy, S., Hellerstein, J.M., Shenker, S.: Prefix hash tree: an indexing data structure over distributed hash tables. In: Proceedings of the 23rd ACM Symposium on Principles of Distributed Computing, January 2004"},{"key":"4_CR16","doi-asserted-by":"publisher","first-page":"962","DOI":"10.1016\/j.jpdc.2008.02.003","volume":"68","author":"C Schmidt","year":"2008","unstructured":"Schmidt, C., Parashar, M.: Squid: enabling search in DHT-based systems. J. Parallel Distrib. Comput. 68, 962\u2013975 (2008)","journal-title":"J. Parallel Distrib. Comput."},{"issue":"4","key":"4_CR17","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1109\/TC.2011.30","volume":"61","author":"H Shen","year":"2012","unstructured":"Shen, H., Xu, C.Z.: Leveraging a compound graph-based DHT for multi-attribute range queries with performance analysis. IEEE Trans. Comput. 61(4), 433\u2013447 (2012). \n                    https:\/\/doi.org\/10.1109\/TC.2011.30","journal-title":"IEEE Trans. Comput."},{"key":"4_CR18","doi-asserted-by":"publisher","unstructured":"Shu, Y., Ooi, B.C., Tan, K.L., Zhou, A.: Supporting multi-dimensional range queries in peer-to-peer systems. In: P2P 2005 Proceedings of the Fifth IEEE International Conference on Peer-to-Peer Computing, pp. 173\u2013180, August 2005. \n                    https:\/\/doi.org\/10.1109\/P2P.2005.35","DOI":"10.1109\/P2P.2005.35"},{"issue":"1","key":"4_CR19","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1109\/TNET.2002.808407","volume":"11","author":"I Stoica","year":"2003","unstructured":"Stoica, I., et al.: Chord: a scalable peer-to-peer lookup protocol for internet applications. IEEE\/ACM Trans. Network. 11(1), 17\u201332 (2003)","journal-title":"IEEE\/ACM Trans. Network."},{"key":"4_CR20","unstructured":"Zhang, C., Krishnamurthy, A., Wang, R.Y.: Skipindex: Towards a scalable peer-to-peer index service for high dimensional data. Technical report, Princeton University, May 2004"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects of Cloud Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-19759-9_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T10:50:24Z","timestamp":1558349424000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-19759-9_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030197582","9783030197599"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-19759-9_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"28 April 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ALGOCLOUD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Algorithmic Aspects of Cloud Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Helsinki","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Finland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 August 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 August 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"algocloud2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/algo2018.hiit.fi\/algocloud\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}