Filtering algorithms and implementation for very fast publish/subscribe systems

被引:5
作者
Fabret, F
Jacobsen, HA
Llirbat, F
Pereira, J
Ross, KA
Shasha, D
机构
[1] INRIA, Rocquencourt, France
[2] Univ Toronto, Toronto, ON, Canada
[3] Columbia Univ, New York, NY 10027 USA
[4] NYU, Courant Inst Math Sci, New York, NY USA
关键词
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Publish/Subscribe is the paradigm in which users express long-term interests ("subscriptions") and some agent "publishes" events (e.g., offers). The job of Publish/Subscribe software is to send events to the owners of subscriptions satisfied by those events. For example, a user subscription may consist of an interest in an airplane of a certain type, not to exceed a certain price. A published event may consist of an offer of an airplane with certain properties including price. Each subscription consists of a conjunction of (attribute, comparison operator, value) predicates. A subscription closely resembles a trigger in that it is a long-lived conditional query associated with an action (usually, informing the subscriber). However, it is less general than a trigger so novel data structures and implementations may enable the creation of more scalable, high performance publish/subscribe systems. This paper describes an attempt at the construction of such algorithms and its implementation. Using a combination of data structures, application-specific caching policies, and application-specific query processing our system can handle 600 events per second for atypical workload containing 6 million subscriptions.
引用
收藏
页码:115 / 126
页数:12
相关论文
共 15 条
[1]  
AGUILERA M, 1999, 18 ACM S PRINC DISTR
[2]  
ALTINEL M, 2000, P 26 VLDB C
[3]  
BERNSTEIN P, 1998, ACM SIGMOD RECORD, V27
[4]  
CARZANIGA A, 2000, 9 ACM S PRINC DISTR
[5]  
CHEN J, 2000, P ACM SIGMOD C MAN D
[6]  
GOUGH KJ, 1995, P ACSC 18
[7]  
HANSON E, 1999, P INT C DAT ENG
[8]  
Hanson E. N., 1992, P ACM SIGMOD INT C M
[9]  
HANSON EN, 1990, SIGMOD 90
[10]  
PEREIRA J, 2000, P INT C COOP INF SYS