A structured overlay for multi-dimensional range queries

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

Volumn 4641 LNCS, Issue , 2007, Pages 503-513

  Schütt, Thorsten ^a   Schintke, Florian ^a   Reinefeld, Alexander ^a  

^a ZUSE INSTITUTE BERLIN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; DATA REDUCTION; DATA STRUCTURES; NETWORK ROUTING;

DATA DISTRIBUTION; DATA SPACE; LOGARITHMIC ROUTING; MULTIDIMENSIONAL TORUS;

QUERY PROCESSING;

EID: 38149095746     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74466-5_54     Document Type: Conference Paper

References (19)

1. Aberer, K., Onana Alima, L., Ghodsi, A., Girdzijauskas, S., Haridi, S., Hauswirth, M.: The essence of P2P: A reference architecture for overlay networks. In: P2P 2005 (2005)
2. Andrzejak, A., Xu, Z.: Scalable, efficient range queries for Grid information services. In: P2P 2002 (2002)
3. Aspnes, J., Shah, G.: Skip graphs. In: SODA (January 2003)
4. Banaei-Kashani, F., Shahabi, C.: SWAM: A family of access methods for similaritysearch in peer-to-peer data networks. In: CIKM (November 2004)
5. Bentley, J.: Multidimensional binary search trees used for associative searching. Communications of the ACM 18(9) (1975)
6. Bharambe, A., Agrawal, M., Seshan, S.: Mercury: Supporting scalable multiattribute range queries. In: ACM SIGCOMM 2004 (August 2004)
7. Chawathe, Y., Ramabhadran, S., Ratnasamy, S., LaMarca, A., Shenker, S., Hellerstein, J.: A Case Study in building layered DHT applications. In: SIGCOMM'05 (August 2005)
8. Gaede, V., Günther, O.: Multidimensional access methods. ACM Computing Surveys, 30(2) (1998)
9. Ganesan, P., Yang, B., Garcia-Molina, H.: One torus to rule them all: Multi-dimensional queries in P2P systems. In: WebDB2004 (2004)
10. Karger, D., Lehman, E., Leighton, T., Panigrah, R., Levine, M., Lewin, D.: Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the World Wide Web. In: ACM Sympos. Theory of Comp. (May 1997)
11. Karger, D., Ruhl, M.: Simple efficient load balancing algorithms for peer-to-peer systems. In: Voelker, G.M., Shenker, S. (eds.) IPTPS 2004. LNCS, vol. 3279, Springer, Heidelberg (2005)
12. Oppenheimer, D., Albrecht, J., Patterson, D., Vahdat, A.: Design and implementation tradeoffs for wide-area resource discovery. In: 14th IEEE Symposium on High Performance Distributed Computing (HPDC-14) (July 2005)
13. Pugh, W.: Skip lists: A probabilistic alternative to balanced trees. Communications of the ACM (June 1990)
14. Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable contentaddressable network. In: ACM SIGCOMM 2001 (August 2001)
15. Rhea, S., Geels, D., Roscoe, T., Kubiatowicz, J.: Handling churn in a DHT. In: Proceedings of the USENIX Annual Technical Conference (June 2004)
16. Schmidt, C., Parashar, M.: Enabling flexible queries with guarantees in P2P systems. IEEE Internet Computing, 19-26 (May/June 2004)
17. Schütt, T., Schintke, F., Reinefeld, A.: Structured overlay without consistent hashing: Empirical results. In: GP2PC'06 (May 2006)
18. Stoica, I., Morris, R., Kaashoek, M.F., Karger, D., Balakrishnan, H.: Chord: A scalable peer-tc-peer lookup service for Internet application. In: ACM SIGCOMM 2001 (August 2001)
19. Zipf, G.: Relative frequency as a determinant of phonetic change. Harvard Studies in Classical Philiology (1929)