End-to-End Support for Joins in Large-Scale Publish/Subscribe Systems

被引:0
作者
Chandramouli, Badrish [1 ]
Yang, Jun [1 ]
机构
[1] Duke Univ, Dept Comp Sci, Durham, NC 27708 USA
来源
PROCEEDINGS OF THE VLDB ENDOWMENT | 2008年 / 1卷 / 01期
基金
美国国家科学基金会;
关键词
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
We address the problem of supporting a large number of select-join subscriptions for wide-area publish/subscribe. Subscriptions are joins over different tables, with varying interests expressed as range selection conditions over table attributes. Naive schemes, such as computing and sending join results from a server, are inefficient because they produce redundant data, and are unable to share dissemination costs across subscribers and events. We propose a novel, scalable scheme that group-processes and disseminates a general mix of multi-way select-join subscriptions. We also propose a simple and application-agnostic extension to content-driven networks (CN), which further improves sharing of dissemination costs. Experimental evaluations show that our schemes can generate orders of magnitude lower network traffic at very low processing cost. Our extension to CN can further reduce traffic by another order of magnitude, with almost no increase in notification latency.
引用
收藏
页码:434 / 450
页数:17
相关论文
共 36 条
[1]  
Agarwal P., 2006, VLDB
[2]  
Ahmad Y., 2005, NETDB
[3]  
Bernstein Philip A, 1981, ACM TODS
[4]  
Carzaniga A., 2001, ACM T COMPUTER SYSTE
[5]  
CARZANIGA A, 2001, NSF WORKSH INFR MOB
[6]  
CASTRO M, 2002, IEEE JSAC
[7]  
Chand R., 2003, NCA
[8]  
Chandramouli B., 2007, VLDB
[9]  
Chandramouli B., 2006, SIGMOD
[10]  
Chandramouli B., 2008, SIGMOD