{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T05:45:09Z","timestamp":1725601509841},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642229213"},{"type":"electronic","value":"9783642229220"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-22922-0_11","type":"book-chapter","created":{"date-parts":[[2011,8,20]],"date-time":"2011-08-20T05:39:14Z","timestamp":1313818754000},"page":"168-185","source":"Crossref","is-referenced-by-count":5,"title":["MIDAS: Multi-attribute Indexing for Distributed Architecture Systems"],"prefix":"10.1007","author":[{"given":"George","family":"Tsatsanifos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dimitris","family":"Sacharidis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Timos","family":"Sellis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"11_CR1","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1145\/945721.945729","volume":"32","author":"K. Aberer","year":"2003","unstructured":"Aberer, K., Cudr\u00e9-Mauroux, P., Datta, A., Despotovic, Z., Hauswirth, M., Punceva, M., Schmidt, R.: P-grid: a self-organizing structured p2p system. SIGMOD Record\u00a032(3), 29\u201333 (2003)","journal-title":"SIGMOD Record"},{"issue":"9","key":"11_CR2","doi-asserted-by":"publisher","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\u00a018(9), 509\u2013517 (1975)","journal-title":"Commun. ACM"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Bentley, J.L.: K-d trees for semidynamic point sets. In: Symposium on Computational Geometry, pp. 187\u2013197 (1990)","DOI":"10.1145\/98524.98564"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Bharambe, A.R., Agrawal, M., Seshan, S.: Mercury: supporting scalable multi-attribute range queries. In: SIGCOMM, pp. 353\u2013366 (2004)","DOI":"10.1145\/1015467.1015507"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Blanas, S., Samoladas, V.: Contention-based performance evaluation of multidimensional range search in p2p networks. In: InfoScale 2007, pp. 1\u20138 (2007)","DOI":"10.4108\/infoscale.2007.918"},{"issue":"1","key":"11_CR6","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10723-004-1184-y","volume":"2","author":"M. Cai","year":"2004","unstructured":"Cai, M., Frank, M.R., Chen, J., Szekely, P.A.: Maan: A multi-attribute addressable network for grid information services. J. Grid Comp.\u00a02(1), 3\u201314 (2004)","journal-title":"J. Grid Comp."},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"Datta, A., Hauswirth, M., John, R., Schmidt, R., Aberer, K.: Range queries in trie-structured overlays. In: P2P Computing, pp. 57\u201366 (2005)","DOI":"10.1109\/P2P.2005.31"},{"key":"11_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/3-540-49381-6_22","volume-title":"Algorithms and Computation","author":"A. Duch","year":"1998","unstructured":"Duch, A., Estivill-Castro, V., Mart\u00ednez, C.: Randomized k-dimensional binary search trees. In: Chwa, K.-Y., Ibarra, O.H. (eds.) ISAAC 1998. LNCS, vol.\u00a01533, pp. 199\u2013208. Springer, Heidelberg (1998)"},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"Ganesan, P., Yang, B., Garcia-Molina, H.: One torus to rule them all: Multidimensional queries in p2p systems. In: WebDB, pp. 19\u201324 (2004)","DOI":"10.1145\/1017074.1017081"},{"key":"11_CR10","unstructured":"Jagadish, H.V., Ooi, B.C., Vu, Q.H.: Baton: A balanced tree structure for peer-to-peer networks. In: VLDB, pp. 661\u2013672 (2005)"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"Jagadish, H.V., Ooi, B.C., Vu, Q.H., Zhang, R., Zhou, A.: Vbi-tree: A peer-to-peer framework for supporting multi-dimensional indexing schemes. In: ICDE, p. 34 (2006)","DOI":"10.1109\/ICDE.2006.169"},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"Karger, D., Lehman, E., Leighton, T., Panigrahy, R., Levine, M., Lewin, D.: Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the world wide web. In: ACM Symp. on Theory of Comp., pp. 654\u2013663 (1997)","DOI":"10.1145\/258533.258660"},{"key":"11_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/3-540-45748-8_5","volume-title":"Peer-to-Peer Systems","author":"P. Maymounkov","year":"2002","unstructured":"Maymounkov, P., Mazi\u00e8res, D.: Kademlia: A peer-to-peer information system based on the xor metric. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol.\u00a02429, pp. 53\u201365. Springer, Heidelberg (2002)"},{"issue":"3","key":"11_CR14","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/s002240000118","volume":"32","author":"C.G. Plaxton","year":"1999","unstructured":"Plaxton, C.G., Rajaraman, R., Richa, A.W.: Accessing nearby copies of replicated objects in a distributed environment. Theory Comput. Syst.\u00a032(3), 241\u2013280 (1999)","journal-title":"Theory Comput. Syst."},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"Ratnasamy, S., Francis, P., Handley, M., Karp, R., Schenker, S.: A scalable contentaddressable network. In: SIGCOMM 2001, pp. 161\u2013172 (2001)","DOI":"10.1145\/964723.383072"},{"issue":"3","key":"11_CR16","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1145\/765568.765571","volume":"50","author":"B.A. Reed","year":"2003","unstructured":"Reed, B.A.: The height of a random binary search tree. Journal of the ACM\u00a050(3), 306\u2013332 (2003)","journal-title":"Journal of the ACM"},{"key":"11_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/3-540-45518-3_18","volume-title":"Middleware 2001","author":"A. Rowstron","year":"2001","unstructured":"Rowstron, A., Druschel, P.: Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In: Liu, H. (ed.) Middleware 2001. LNCS, vol.\u00a02218, pp. 329\u2013350. Springer, Heidelberg (2001)"},{"key":"11_CR18","unstructured":"Shu, Y., Ooi, B.C., Tan, K.-L., Zhou, A.: Supporting multi-dimensional range queries in peer-to-peer systems. In: Peer-to-Peer Computing, pp. 173\u2013180 (2005)"},{"issue":"1","key":"11_CR19","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1109\/TNET.2002.808407","volume":"11","author":"I. Stoica","year":"2003","unstructured":"Stoica, I., Morris, R., Liben-Nowell, D., Karger, D.R., Kaashoek, M.F., Dabek, F., Balakrishnan, H.: Chord: a scalable p2p lookup protocol for internet applications. IEEE\/ACM Trans. Netw.\u00a011(1), 17\u201332 (2003)","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"1","key":"11_CR20","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1109\/JSAC.2003.818784","volume":"22","author":"B. Zhao","year":"2004","unstructured":"Zhao, B., Kubiatowicz, J., Joseph, A.D.: Tapestry: a resilient global-scale overlay for service deployment. IEEE Journal on Selected Areas in Comm.\u00a022(1), 41\u201353 (2004)","journal-title":"IEEE Journal on Selected Areas in Comm."}],"container-title":["Lecture Notes in Computer Science","Advances in Spatial and Temporal Databases"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22922-0_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,14]],"date-time":"2019-06-14T02:06:21Z","timestamp":1560477981000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22922-0_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642229213","9783642229220"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22922-0_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}