Electrical computers and digital processing systems: multicomput – Distributed data processing
Reexamination Certificate
2005-01-04
2005-01-04
Alam, Hosain (Department: 2155)
Electrical computers and digital processing systems: multicomput
Distributed data processing
C707S793000, C707S793000
Reexamination Certificate
active
06839730
ABSTRACT:
A method is provided for efficiently solving the matching problem in content-based publish-subscribe systems. Subscribers may define arbitrary boolean predicates as conditions to subscribe to the published event. The subscribers and their predicates can be organized in the form of a virtual Direct Acyclic Graph (DAG) such that a traversal of the DAG yields one or more matching subscribers. The present invention improves upon the conventional method of linearly matching individual subscribers against an event.
REFERENCES:
patent: 5659725 (1997-08-01), Levy et al.
patent: 6065009 (2000-05-01), Leymann et al.
patent: 6091724 (2000-07-01), Chandra et al.
patent: 6108645 (2000-08-01), Eichstaedt et al.
patent: 6169989 (2001-01-01), Eichstaedt et al.
patent: 6216132 (2001-04-01), Chandra et al.
patent: 6725227 (2004-04-01), Li
“Design of a Scalable Event Notification Service: Interface and Architecture”, by Carzaniga et al., University of Colorado, Technical Report CU-CS-863-98, Aug. 1998, pp. 1-16.
“Achieving Scalability and Expressiveness in an Internet-Scale Event Notification Service”, by Carzaniga, et al., University of Colorado and University of California, pp. 1-10.
“Elvin has left the building: A publish/subscribe notification service with quenching”, by Segall, et al., University of Queensland, Australia, pp. 1-12.
“An Efficient Multicast Protocol for Content-Based Publish-Subscribe Systems”, by Banavar, et al., IBM T. J. Watson Research Center, pp. 1-9.
“Java Message Service™”, Sun Microsystems, Version 1.0.2, Nov. 9, 1999, pp. 1-109.
Matching Events in a Content-based Subscription System, by Aguilera, et al., Nov. 10, 1998, pp. 1-17.
“Symbolic Boolean Manipulation with Ordered Binary Decision Diagrams”, by Randal E. Bryant, Carnegie-Mellon University, CMU-CS-92-160, Jul. 1992, pp. 1-33.
“Graph-Based Algorithms for Boolean Function Manipulation”, by Randal E. Bryant, Carnegie-Mellon University, pp. 1-25.
Representing Boolean Functions with If-Then-Else DAG's, by Kevin Karplus, University of California, Santa Cruz, UCSC-CRL-88-28, Nov. 30, 1998, pp. 1-21.
Alam Hosain
Haynes and Boone LLP
Novell Inc.
Qureshi Shabana
LandOfFree
Method and system for efficiently matching events with... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Method and system for efficiently matching events with..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and system for efficiently matching events with... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3394622