Content-Based Publish/Subscribe System for Web Syndication 被引量：1

Content-Based Publish/Subscribe System for Web Syndication

导出

摘要 Content syndication has become a popular way for timely delivery of frequently updated information on the Web. Today, web syndication technologies such as RSS or Atom are used in a wide variety of applications spreading from large-scale news broadcasting to medium-scale information sharing in scientific and professional communities. However, they exhibit serious limitations for dealing with information overload in Web 2.0. There is a vital need for efficient real- time filtering methods across feeds, to allow users to effectively follow personally interesting information. We investigate in this paper three indexing techniques for users＇ subscriptions based on inverted lists or on an ordered trie for exact and partial matching. We present analytical models for memory requirements and matching time and we conduct a thorough experimental evaluation to exhibit the impact of critical parameters of realistic web syndication workloads. Content syndication has become a popular way for timely delivery of frequently updated information on the Web. Today, web syndication technologies such as RSS or Atom are used in a wide variety of applications spreading from large-scale news broadcasting to medium-scale information sharing in scientific and professional communities. However, they exhibit serious limitations for dealing with information overload in Web 2.0. There is a vital need for efficient real- time filtering methods across feeds, to allow users to effectively follow personally interesting information. We investigate in this paper three indexing techniques for users＇ subscriptions based on inverted lists or on an ordered trie for exact and partial matching. We present analytical models for memory requirements and matching time and we conduct a thorough experimental evaluation to exhibit the impact of critical parameters of realistic web syndication workloads.

作者 Zeinab Hmedeh Harry Kourdounakis Vassilis Christophides Cedric du Mouza Michel Scholl Nicolas Travers

机构地区 CEDRIC Laboratory FORTH//ICS

出处《Journal of Computer Science & Technology》 SCIE EI CSCD 2016年第2期359-380,共22页 计算机科学技术学报（英文版）

关键词 pub/sub subscription indexing web syndication partial matching SCALABILITY pub/sub, subscription indexing, web syndication, partial matching, scalability

分类号 TP311.133.1 [自动化与计算机技术—计算机软件与理论] TS102.526 [轻工技术与工程—纺织工程]

引文网络
相关文献

参考文献35

1Hmedeh Z, Vouzoukidou N, Travers N, Christophides V, du Mouza C, Scholl M. Characterizing web syndication be- havior and content. In Proc. the 12th WISE, Nov. 2011, pp.29-42.
2Pereira J, Fabret F, Llirbat F, Preotiuc-Pietro R, Ross K A, Shasha D. Publish/subscribe on the web at extreme speed. In Proc. the 26th VLDB, Sept. 2000, pp.627-630.
3Fabret F, Jacobsen H A, Llirbat F, Pereira J, Ross K A, Shasha D. Filtering algorithms and implementation for very fast publish/subscribe. In Proc. SIGMOD, May 2001, pp.115-126.
4Aguilera M K, Strom R E, Sturman D C, Astley M, Chan- dra T D. Matching events in a content-based subscription system. In Proc. the 8th PODC, Apr. 29-May 6, 1999, pp.53-61.
5Zobel J, Moffat A. Inverted files for text search engines. ACM Computing Survey, 2006, 38(2): Article No. 6.
6Knuth D E. The Art of Computer Programming, Volume III: Sorting and Searching (2nd edition). Addison Wesley Longman Publishing Co., Inc., Redwood City, CA, USA, 1998.
7Yan T W, Garcia-Molina H. Index structures for selec- tive dissemination of information under the Boolean model. ACM Transactions on Database Systems, 1994, 19(2): 332- 364.
8KSnig A C, Church K W, Markov M. A data structure for sponsored search. In Proc. the 25th ICDE, Mar. 29-April 2, 2009, pp.90-101.
9Bodon F. Surprising results of trie-based FIM algorithms. In Proc. IEEE CIDM Workshop on FIMI, Nov. 2004.
10Malik H H, Kender J R. Optimizing frequency queries for data mining applications. In Proc. the 7th ICDM, Oct. 2007, pp.595-600.