MIDAS: Multi-attribute indexing for distributed architecture systems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6849 LNCS, Issue , 2011, Pages 168-185

  Tsatsanifos, George ^a   Sacharidis, Dimitris ^b   Sellis, Timos ^a,b  

^a NATIONAL TECHNICAL UNIVERSITY OF ATHENS   (Greece)

^b INSTITUTE FOR THE MANAGEMENT OF INFORMATION SYSTEMS   (Greece)

Author keywords

kd trees; Peer to peer systems

Indexed keywords

DECENTRALIZED NETWORKS; DISTRIBUTED ARCHITECTURE; DYNAMIC ENVIRONMENTS; EFFICIENT ALGORITHM; EXPERIMENTAL EVALUATION; HIGHER-DIMENSIONAL; K-D TREE; MULTI-ATTRIBUTES; OVERLAY SIZE; PARTIAL KNOWLEDGE; PEER TO PEER; PEER-TO-PEER SYSTEMS; PROMINENT FEATURES; RANGE QUERY;

ALGORITHMS; FAULT TOLERANCE; INDEXING (OF INFORMATION); PLANT EXTRACTS;

DISTRIBUTED DATABASE SYSTEMS;

EID: 80052759942     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-22922-0_11     Document Type: Conference Paper

References (20)

1. Aberer, K., Cudré-Mauroux, P., Datta, A., Despotovic, Z., Hauswirth, M., Punceva, M., Schmidt, R.: P-grid: a self-organizing structured p2p system. SIGMOD Record 32(3), 29-33 (2003)
2. Bentley, J.L.: Multidimensional binary search trees used for associative searching. Commun. ACM 18(9), 509-517 (1975)
3. Bentley, J.L.: K-d trees for semidynamic point sets. In: Symposium on Computational Geometry, pp. 187-197 (1990)
4. Bharambe, A.R., Agrawal, M., Seshan, S.: Mercury: supporting scalable multi-attribute range queries. In: SIGCOMM, pp. 353-366 (2004)
5. Blanas, S., Samoladas, V.: Contention-based performance evaluation of multidimensional range search in p2p networks. In: InfoScale 2007, pp. 1-8 (2007)
6. Cai, M., Frank, M.R., Chen, J., Szekely, P.A.: Maan: A multi-attribute addressable network for grid information services. J. Grid Comp. 2(1), 3-14 (2004)
7. Datta, A., Hauswirth, M., John, R., Schmidt, R., Aberer, K.: Range queries in trie-structured overlays. In: P2P Computing, pp. 57-66 (2005)
8. Duch, A., Estivill-Castro, V., Martínez, C.: Randomized k-dimensional binary search trees. In: Chwa, K.-Y., Ibarra, O.H. (eds.) ISAAC 1998. LNCS, vol. 1533, pp. 199-208. Springer, Heidelberg (1998)
9. Ganesan, P., Yang, B., Garcia-Molina, H.: One torus to rule them all: Multidimensional queries in p2p systems. In: WebDB, pp. 19-24 (2004)
10. Jagadish, H.V., Ooi, B.C., Vu, Q.H.: Baton: A balanced tree structure for peer-to-peer networks. In: VLDB, pp. 661-672 (2005)
11. 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)
12. 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-663 (1997)
13. Maymounkov, P., Mazières, 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. 2429, pp. 53-65. Springer, Heidelberg (2002)
14. Plaxton, C.G., Rajaraman, R., Richa, A.W.: Accessing nearby copies of replicated objects in a distributed environment. Theory Comput. Syst. 32(3), 241-280 (1999)
15. Ratnasamy, S., Francis, P., Handley, M., Karp, R., Schenker, S.: A scalable contentaddressable network. In: SIGCOMM 2001, pp. 161-172 (2001)
16. Reed, B.A.: The height of a random binary search tree. Journal of the ACM 50(3), 306-332 (2003)
17. 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. 2218, pp. 329-350. Springer, Heidelberg (2001) (Pubitemid 33362020)
18. 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-180 (2005)
19. 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. 11(1), 17-32 (2003)
20. Zhao, B., Kubiatowicz, J., Joseph, A.D.: Tapestry: a resilient global-scale overlay for service deployment. IEEE Journal on Selected Areas in Comm. 22(1), 41-53 (2004)