{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,2]],"date-time":"2023-09-02T16:27:26Z","timestamp":1693672046760},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2012,8,9]],"date-time":"2012-08-09T00:00:00Z","timestamp":1344470400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Geoinformatica"],"published-print":{"date-parts":[[2013,7]]},"DOI":"10.1007\/s10707-012-0163-x","type":"journal-article","created":{"date-parts":[[2012,8,8]],"date-time":"2012-08-08T10:16:25Z","timestamp":1344420985000},"page":"489-519","source":"Crossref","is-referenced-by-count":7,"title":["Index-based query processing on distributed multidimensional data"],"prefix":"10.1007","volume":"17","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","published-online":{"date-parts":[[2012,8,9]]},"reference":[{"issue":"3","key":"163_CR1","doi-asserted-by":"crossref","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 (2003) P-grid: a self-organizing structured p2p system. SIGMOD Record 32(3):29\u201333","journal-title":"SIGMOD Record"},{"issue":"9","key":"163_CR2","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1145\/361002.361007","volume":"18","author":"JL Bentley","year":"1975","unstructured":"Bentley JL (1975) Multidimensional binary search trees used for associative searching. Commun ACM 18(9):509\u2013517","journal-title":"Commun ACM"},{"key":"163_CR3","doi-asserted-by":"crossref","unstructured":"Bentley JL (1990) K-d trees for semidynamic point sets. In: Symposium on computational geometry, pp 187\u2013197","DOI":"10.1145\/98524.98564"},{"key":"163_CR4","doi-asserted-by":"crossref","unstructured":"Bharambe AR, Agrawal M, Seshan S (2004) Mercury: supporting scalable multi-attribute range queries. In: SIGCOMM, pp 353\u2013366","DOI":"10.1145\/1030194.1015507"},{"key":"163_CR5","unstructured":"Blanas S, Samoladas V (2007) Contention-based performance evaluation of multidimensional range search in p2p networks. In: InfoScale\u201907, pp 1\u20138"},{"issue":"1","key":"163_CR6","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 MR, Chen J, Szekely PA (2004) Maan: a multi-attribute addressable network for grid information services. J Grid Comp 2(1):3\u201314","journal-title":"J Grid Comp"},{"key":"163_CR7","doi-asserted-by":"crossref","unstructured":"Datta A, Hauswirth M, John R, Schmidt R, Aberer K (2005) Range queries in trie-structured overlays. In: P2P Computing, pp 57\u201366","DOI":"10.1109\/P2P.2005.31"},{"key":"163_CR8","doi-asserted-by":"crossref","unstructured":"Duch A, Estivill-Castro V, Mart\u00ednez C (1998) Randomized k-dimensional binary search trees. In: ISAAC, pp 199\u2013208","DOI":"10.1007\/3-540-49381-6_22"},{"issue":"1","key":"163_CR9","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1016\/j.ipm.2007.03.002","volume":"44","author":"F Falchi","year":"2008","unstructured":"Falchi F, Gennaro C, Zezula P (2008) Nearest neighbor search in metric spaces through content-addressable networks. Inf Process Manag 44(1):411\u2013429","journal-title":"Inf Process Manag"},{"key":"163_CR10","doi-asserted-by":"crossref","unstructured":"Ganesan P, Yang B, Garcia-Molina H (2004) One torus to rule them all: multidimensional queries in p2p systems. In: WebDB, pp 19\u201324","DOI":"10.1145\/1017074.1017081"},{"key":"163_CR11","unstructured":"Jagadish HV, Ooi BC, Vu QH (2005) Baton: a balanced tree structure for peer-to-peer networks. In: VLDB, pp. 661\u2013672"},{"key":"163_CR12","doi-asserted-by":"crossref","unstructured":"Jagadish HV, Ooi BC, Vu QH, Zhang R, Zhou A (2006) Vbi-tree: a peer-to-peer framework for supporting multi-dimensional indexing schemes. In: ICDE, p\u00a034","DOI":"10.1109\/ICDE.2006.169"},{"key":"163_CR13","unstructured":"Jain R, Chiu D, Hawe W (1984) A quantitative measure of fairness and discrimination for resource allocation in shared computer systems. In: DEC Research Report TR-301"},{"key":"163_CR14","doi-asserted-by":"crossref","unstructured":"Karger D, Lehman E, Leighton T, Panigrahy R, Levine M, Lewin D (1997) 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","DOI":"10.1145\/258533.258660"},{"key":"163_CR15","doi-asserted-by":"crossref","unstructured":"Maymounkov P, Mazi\u00e8res D (2002) Kademlia: a peer-to-peer information system based on the xor metric. In: IPTPS, pp 53\u201365","DOI":"10.1007\/3-540-45748-8_5"},{"issue":"3","key":"163_CR16","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/s002240000118","volume":"32","author":"CG Plaxton","year":"1999","unstructured":"Plaxton CG, Rajaraman R, Richa AW (1999) Accessing nearby copies of replicated objects in a distributed environment. Theory Comput Syst 32(3):241\u2013280","journal-title":"Theory Comput Syst"},{"key":"163_CR17","doi-asserted-by":"crossref","unstructured":"Ratnasamy S, Francis P, Handley M, Karp R, Schenker S (2001) A scalable content-addressable network. In: SIGCOMM \u201901, pp 161\u2013172","DOI":"10.1145\/383059.383072"},{"issue":"3","key":"163_CR18","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1145\/765568.765571","volume":"50","author":"BA Reed","year":"2003","unstructured":"Reed BA (2003) The height of a random binary search tree. J ACM 50(3):306\u2013332","journal-title":"J ACM"},{"key":"163_CR19","unstructured":"Rowstron AIT, Druschel P (2001) Pastry: scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In: Middleware, pp 329\u2013350"},{"key":"163_CR20","unstructured":"Shu Y, Ooi BC, Tan KL, Zhou A (2005) Supporting multi-dimensional range queries in peer-to-peer systems. In: Peer-to-Peer computing, pp 173\u2013180"},{"issue":"1","key":"163_CR21","doi-asserted-by":"crossref","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 DR, Kaashoek MF, Dabek F, Balakrishnan H (2003) Chord: a scalable p2p lookup protocol for internet applications. IEEE\/ACM Trans Netw 11(1):17\u201332","journal-title":"IEEE\/ACM Trans Netw"},{"key":"163_CR22","doi-asserted-by":"crossref","unstructured":"Tsatsanifos G, Sacharidis D, Sellis T (2011) Midas: multi-attribute indexing for distributed architecture systems. In: Proceedings of the international symposium on spatial and temporal databases (SSTD)","DOI":"10.1007\/978-3-642-22922-0_11"},{"key":"163_CR23","doi-asserted-by":"crossref","unstructured":"Wang J, Wu S, Gao H, Li J, Ooi BC (2010) Indexing multi-dimensional data in a cloud system. In: SIGMOD, pp 591\u2013602","DOI":"10.1145\/1807167.1807232"},{"issue":"1","key":"163_CR24","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1109\/JSAC.2003.818784","volume":"22","author":"B Zhao","year":"2004","unstructured":"Zhao B, Kubiatowicz J, Joseph AD (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":["GeoInformatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10707-012-0163-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10707-012-0163-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10707-012-0163-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,2]],"date-time":"2019-07-02T12:52:11Z","timestamp":1562071931000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10707-012-0163-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,8,9]]},"references-count":24,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2013,7]]}},"alternative-id":["163"],"URL":"https:\/\/doi.org\/10.1007\/s10707-012-0163-x","relation":{},"ISSN":["1384-6175","1573-7624"],"issn-type":[{"value":"1384-6175","type":"print"},{"value":"1573-7624","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,8,9]]}}}