Q-Tree: A multi-attribute based range query solution for tele-immersive framework

Proceedings - International Conference on Distributed Computing Systems

Volumn , Issue , 2009, Pages 299-307

  Arefin, Md Ahsan ^a   Uddin, Md Yusuf Sarwar ^a   Gupta, Indranil ^a   Nahrstedt, Klara ^a  

^a University of Illinois at Urbana Champaign   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPLICATION REQUIREMENTS; BOTTOM UP APPROACH; CLUSTERED STRUCTURE; COMPLEX QUERIES; DATA ITEMS; DISTRIBUTED QUERY; DISTRIBUTED SEARCH; DISTRIBUTED SYSTEMS; HIGH LEVEL DESCRIPTION; IMMERSIVE; KEY FEATURE; LARGE DATASETS; LOAD-BALANCING; MONITORING AND MANAGEMENT; MULTI-ATTRIBUTES; PLANETLAB; QUERY ENGINES; RANGE QUERY; RELATIVE STRENGTH; SERVICE LATENCY; STATIC AND DYNAMIC; TOPOLOGY AWARE; TRAFFIC OVERHEAD;

COMPUTER SCIENCE; TECHNICAL PRESENTATIONS;

GRAPH THEORY; COMPUTER SCIENCE;

EID: 70350241665     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDCS.2009.41     Document Type: Conference Paper

References (20)

1. J. Aspnes and G. Shah, "Skip graphs," in Proc. of SODA, 2003.
2. A. Crainiceanu, P. Linga, J. Gehrke, and J. Shanmugasundaram, "Querying peer-to-peer networks using p-trees," in Proc. of WebDB, 2004, pp. 25-30.
3. A. Gupta, D. Agrawal, , and A. Abbadi, "Approximate range selection queries in peer-to-peer systems," in Proc. of CIDR, 2003.
4. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker, "A scalable content addressable network," in Proc. of ACM SIGCOMM, 2001, pp. 161-172.
5. I. Stocia, R. Morris, D. Karger, M. F. Kaashoek, and H. Balakrishnan, "Chord: A scalable peer-to-peer lookup service for internet applications," in Proc. of ACM SIGCOMM, San Deigo, CA, August 2001, pp. 149-160.
6. I. Gupta, K. Birman, P. Linga, A. Demers, and R. Renesse, "Kelips: Building an efficient and stable P2P DHT through increased memory and background overhead," in Proc. of IPTPS, 2003, pp. 81-86.
7. A. Rowstron and P. Druschel, "Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems," in Proc. of the IFIP/ACM ICDSP, 2001, pp. 329-350.
8. M. Harren, J. Hellerstein, R. Huebsch, B. Loo, S. Shenker, and I. Stoica, "Complex queries in dht-based peer-to-peer networks," in Proc. of the first International Workshop on Peer-to-Peer Systems, 2002, pp. 242-259.
9. A. Crainiceanu, P. Linga, A. Machanavajjhala, J. Gehrke, and J. Shanmugasundaram, "P-ring: An efficient and robust p2p range index structure," in Proc. of SIGMOD, 2007.
10. R. Renesse and K. Binnan, "Astrolabe: A robust and scalable technology for distributed system monitoring, management, and data mining," vol. 21, no. 2, pp. 164-206, May 2003.
11. P. Yalagandula and M. Dahlin, "A scalable distributed information management system," in Proc. of ACM SIGCOMM, 2004, pp. 379-390.
12. CoMon, "http://comon.cs.princeton.edu/."
13. J. Albrecht, C. Tuttle, A. Snoeren, and A. Vahdat, "Planetlab application management using plush," vol. 40, no. 1, pp. 33-40, 2006.
14. J. Liang, S. Ko, I. Gupta, and K. Nahrstedt, "Mon: On-demand overlays for distributed system management," in Proc. of Usenix WORLDS, 2005.
15. S. Ko, S. Yalagandula, I. Gupta, V. Talwar, D. Milojicic, and S. Iyer, "Moara: Flexible and scalable group-based querying system," in Proc. of ACM/IFIP/USENIX Middleware, 2008.
16. MONET, "http://cairo.cs.uiuc.edu/projects/teleimmersion/."
17. Z. Yang, Y. Cui, B. Yu, J. Liang, K. Nahrsterdt, S. H. Jung, and R. Bajscy, "Teeve: The next generation architecture for tele-immersive environments," in Proc. of ISM, Irvine, CA, USA, 2005, pp. 112-119.
18. M. Arefin, M. Uddin, I. Gupta, and K. Nahrstedt, "Q-tree: A multi-attribute rnage based query solution for tele-immersive framework," in Technical Report, UIUCDCS-R-2009-3042, UIUC, 2009.
19. A. Corradi, L. Leonardi, and F. Zambonelli, "Diffusive load-balancing policies for dynamic applications," IEEE Concurrency, vol. 7, no. 1, 1999.
20. P. 4hr Traces, "http://www.eecs.harvard.edu/ syrah/nc/sim/pings.4hr. stamp.gz."