Adaptive reorganization of coherency-preserving dissemination tree for streaming data

Proceedings - International Conference on Data Engineering

Volumn 2006, Issue , 2006, Pages 55-

  Zhou, Yongluan ^a   Ooi, Beng Chin ^a   Tan, Kian Lee ^a   Yu, Feng ^a  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STREAMING; DISSEMINATION TREES; INCREMENTALLY TRANSFORMS; TREE CONSTRUCTION ALGORITHMS;

ADAPTIVE SYSTEMS; ALGORITHMS; DATA FLOW ANALYSIS; DATA PROCESSING; INFORMATION DISSEMINATION; OPTIMIZATION; SERVERS; STATISTICS;

TREES (MATHEMATICS);

EID: 33749646820     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2006.13     Document Type: Conference Paper

References (17)

1. M. Aguilera, R. Strom, et al. Matching events in a content-based subscription system. In PODC, 1999.
2. G. Banavar, et al. An efficient multicast protocol for content-based publish-subscribe systems. In ICDCS, 1999.
3. S. Banerjee, et al. Construction of an efficient overlay multicast infrastructure for real-time applications. In INFOCOM, 2003.
4. M. Blum, et al. The minimum latency problem. In STOC, 1994
5. E. Brosh and Y. Shavitt. Approximation and heuristic algorithms for minimum delay application-layer multicast trees. In INFOCOM, 2004.
6. A. Carzaniga, M. Rutherford, and A. Wolf. A routing scheme for content-based networking. In INFOCOM, 2004.
7. Y. hua Chu, et al. A case for end system multicast. In SIGMETRICS, 2000.
8. A. Carzaniga and A. Wolf. Forwarding in a content-based network. In SIGCOMM'03, 2003.
9. Y. Diao, S. Rizvi, and M. J. Franklin. Towards an internet-scale xml dissemination service. In VLDB, 2003.
10. F. Fabret, et al. Filtering algorithms and implementation for very fast publish/subscribe. In SIGMOD, 2001.
11. Y. E. Ioannidis and Y. Kang. Randomized algorithms for optimizing large join queries. In SIGMOD, 1990.
12. D.S. Johnson, et al. Optimization by simulated annealing an experimental evaluation unpublished manuscript, 1987.
13. S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi. Optimization by simulated annealing. Science, Number 4598, 13 May 1983
14. S. Shah, et al. An efficient and resilient approach to filtering and disseminating streaming data. In VLDB, 2003.
15. S. Shah, et al. Maintaining coherency of dynamic data in co-operating repositories. In VLDB, 2002.
16. L. Tang and M. Crovella. Virtual landmarks for the internet. In Proceedings of the ACM/SIGCOMM Internet Measurement Conference (IMC-03), 2003.
17. Y. Zhou, B. C. Ooi, K.-L. Tan, F. Yu. Adaptive Reorganization of Coherency-Preserving Dissemination Tree for streaming data. Extended version, available at http://www.comp. nus.edu.sq/~zhouyonq/dissemination.html, 2005.