Indexing for Subscription Covering in Publish-Subscribe Systems

18th ISCA International Conference on Parallel and Distributed Computing Systems 2005, PDCS 2005

Volumn , Issue , 2005, Pages 328-333

  Shen, Zhenhui ^a   Aluru, Srinivas ^a   Tirthapura, Srikanta ^a  

^a Iowa State University of Science and Technology   (United States)

Author keywords

multidimensional index; publish subscribe; relation graph; subscription covering

Indexed keywords

INDEXING (OF INFORMATION); PUBLISHING;

CONTENT BASED ROUTING; CONTENT-BASED PUBLISH/SUBSCRIBE SYSTEMS; CURRENT SYSTEM; DISTRIBUTED ENVIRONMENTS; INDEXING SCHEME; MULTIDIMENSIONAL INDEX; PUBLISH/SUBSCRIBE; PUBLISH/SUBSCRIBE SYSTEM; RELATION GRAPH; SUBSCRIPTION COVERINGS;

MESSAGE PASSING;

EID: 84899376631     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (11)

1. +99] M. K. Aguilera, R. E. Strom, D. C. Sturman, M. Astley, and T. D. Chandra. Matching events in a content-based subscription system. In Proceedings of the ACM Symposium on Principles of Distributed Computing (PODC), 1999.
2. [Cen] IBM T.J. Watson Research Center. Gryphon: Publish/subscribe over public networks. White paper.
3. [Cha90a] B. Chazelle. Lower bounds for orthogonal range searching:ii.the arithmetic model. Journal of the ACM, 37:439–463, Jul 1990.
4. [Cha90b] B. Chazelle. Lower bounds for orthogonal range searching:i.the reporting case. Journal of the ACM, 37:200–212, Apr 1990.
5. [CRW01] A. Carzaniga, D.S. Rosenblum, and A.L. Wolf. Design and evaluation of a wide-area event notification service. ACM Transactions on Computer Systems, 19(3):332–383, 2001.
6. [Fre81] M.L. Fredman. A lower bound on the complexity of orthogonal range queries. Journal of the ACM, 28:696–705, Oct 1981.
7. [LHJ05] Guoli Li, Shuang Hou, and Hans-Arno Jacob-sen. A unified approach to routing, covering and merging in publish/subscribe systems based on modified binary decision diagrams. In International Conference on Distributed Computing Systems(ICDCS’05), 2005.
8. [MF01] G. Mühl and L. Fiege. Supporting covering and merging in content-based publish/subscribe systems: Beyond name/value pairs. IEEE Distributed Systems Online (DSOnline), 2(7), 2001.
9. [MFB02] G. Mühl, L. Fiege, and A.P. Buchmann. Filter similarities in content-based publish/subscribe systems. In International Conference on Architecture of Computing Systems (ARCS), volume 2299 of Lecture Notes in Computer Science, pages 224–238, 2002.
10. [Müh01] G. Mühl. Generic constraints for content-based publish/subscribe systems. In Proceedings of the 6th International Conference on Cooperative Information Systems (CoopIS), volume 2172 of Lecture Notes in Computer Science, pages 211–225, Sep 2001.
11. [SAT05] Zhenhui Shen, Srinivas Aluru, and Srikanta Tirthapura. Indexing for subscription covering in publish-subscribe systems. Technical Report TR-2005-07-2, 2005. http://archives.ece.iastate.edu/archive/00000163/.