{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,1]],"date-time":"2023-11-01T13:51:43Z","timestamp":1698846703431},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2016,3,1]],"date-time":"2016-03-01T00:00:00Z","timestamp":1456790400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J. Comput. Sci. Technol."],"published-print":{"date-parts":[[2016,3]]},"DOI":"10.1007\/s11390-016-1632-8","type":"journal-article","created":{"date-parts":[[2016,3,18]],"date-time":"2016-03-18T16:29:20Z","timestamp":1458318560000},"page":"359-380","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Content-Based Publish\/Subscribe System for Web Syndication"],"prefix":"10.1007","volume":"31","author":[{"given":"Zeinab","family":"Hmedeh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Harry","family":"Kourdounakis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vassilis","family":"Christophides","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C\u00e9dric","family":"du Mouza","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michel","family":"Scholl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicolas","family":"Travers","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,3,7]]},"reference":[{"key":"1632_CR1","doi-asserted-by":"crossref","unstructured":"Hmedeh Z, Vouzoukidou N, Travers N, Christophides V, du Mouza C, Scholl M. Characterizing web syndication behavior and content. In Proc. the 12th WISE, Nov. 2011, pp.29-42.","DOI":"10.1007\/978-3-642-24434-6_3"},{"key":"1632_CR2","unstructured":"Pereira 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."},{"key":"1632_CR3","doi-asserted-by":"crossref","unstructured":"Fabret 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.","DOI":"10.1145\/376284.375677"},{"key":"1632_CR4","doi-asserted-by":"crossref","unstructured":"Aguilera M K, Strom R E, Sturman D C, Astley M, Chandra T D. Matching events in a content-based subscription system. In Proc. the 8th PODC, Apr. 29-May 6, 1999, pp.53-61.","DOI":"10.1145\/301308.301326"},{"key":"1632_CR5","doi-asserted-by":"crossref","unstructured":"Zobel J, Moffat A. Inverted files for text search engines. ACM Computing Survey, 2006, 38(2): Article No. 6.","DOI":"10.1145\/1132956.1132959"},{"key":"1632_CR6","unstructured":"Knuth 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."},{"issue":"2","key":"1632_CR7","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1145\/176567.176573","volume":"19","author":"TW Yan","year":"1994","unstructured":"Yan T W, Garcia-Molina H. Index structures for selective dissemination of information under the Boolean model. ACM Transactions on Database Systems, 1994, 19(2): 332\u2013364.","journal-title":"ACM Transactions on Database Systems"},{"key":"1632_CR8","doi-asserted-by":"crossref","unstructured":"K\u00f6nig 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.","DOI":"10.1109\/ICDE.2009.37"},{"key":"1632_CR9","unstructured":"Bodon F. Surprising results of trie-based FIM algorithms. In Proc. IEEE CIDM Workshop on FIMI, Nov. 2004."},{"key":"1632_CR10","doi-asserted-by":"crossref","unstructured":"Malik H H, Kender J R. Optimizing frequency queries for data mining applications. In Proc. the 7th ICDM, Oct. 2007, pp.595-600.","DOI":"10.1109\/ICDM.2007.34"},{"issue":"3","key":"1632_CR11","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1108\/IJWIS-06-2014-0023","volume":"10","author":"N Travers","year":"2014","unstructured":"Travers N, Hmedeh Z, Vouzoukidou N, du Mouza C, Christophides V, Scholl M. RSS feeds behavior analysis, structure and vocabulary. International Journal of Web Information Systems, 2014, 10(3): 291\u2013320.","journal-title":"International Journal of Web Information Systems"},{"issue":"4","key":"1632_CR12","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1145\/331983.331992","volume":"24","author":"TW Yan","year":"1999","unstructured":"Yan T W, Garcia-Molina H. The SIFT information dissemination system. ACM Transactions on Database Systems, 1999, 24(4): 529\u2013565.","journal-title":"ACM Transactions on Database Systems"},{"key":"1632_CR13","doi-asserted-by":"crossref","unstructured":"Bodon F. A trie-based APRIORI implementation for mining frequent item sequences. In Proc. the 1st Int. Work. Open Source Data Mining (OSDM), Aug. 2005, pp.56-65.","DOI":"10.1145\/1133905.1133913"},{"issue":"1","key":"1632_CR14","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/BF02679623","volume":"29","author":"J Cl\u00e9ment","year":"2001","unstructured":"Cl\u00e9ment J, Flajolet P, Vall\u00e9e B. Dynamical sources in information theory: A general analysis of trie structures. Algorithmica, 2001, 29(1): 307\u2013369.","journal-title":"Algorithmica"},{"key":"1632_CR15","unstructured":"Baeza-Yates R A, Ribeiro-Neto B. Modern Information Retrieval. Addison-Wesley Longman Publishing Co., Inc., Boston, MA, USA, 1999."},{"issue":"11","key":"1632_CR16","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1145\/361219.361220","volume":"18","author":"G Salton","year":"1975","unstructured":"Salton G, Wong A, Yang C S. A vector space model for automatic indexing. Communications of the ACM, 1975, 18(11): 613\u2013620.","journal-title":"Communications of the ACM"},{"issue":"5","key":"1632_CR17","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1002\/asi.4630250505","volume":"25","author":"A Bookstein","year":"1974","unstructured":"Bookstein A, Swanson D. Probabilistic models for automatic indexing. J. Am. Soc. Inf. Sci., 1974, 25(5): 312\u2013316.","journal-title":"J. Am. Soc. Inf. Sci."},{"key":"1632_CR18","unstructured":"Bagwell P. Ideal hash trees. Technical Report LAMPREPORT-2001-001, Ecole Polytechnique Federal de Lausanne, Switzerland, 2001."},{"issue":"3","key":"1632_CR19","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1145\/355744.355749","volume":"3","author":"AJ Walker","year":"1977","unstructured":"Walker A J. An efficient method for generating discrete random variables with general distributions. ACM Transactions on Mathematical Software, 1977, 3(3): 253\u2013256.","journal-title":"ACM Transactions on Mathematical Software"},{"key":"1632_CR20","doi-asserted-by":"crossref","unstructured":"Beitzel S M, Jensen E C, Chowdhury A, Grossman D, Frieder O. Hourly analysis of a very large topically categorized web query log. In Proc. the 27th SIGIR, Jul. 2004, pp.321-328.","DOI":"10.1145\/1008992.1009048"},{"key":"1632_CR21","doi-asserted-by":"crossref","unstructured":"Carzaniga A, Wolf A. Forwarding in a content-based network. In Proc. the 17th SIGCOMM, Aug. 2003, pp.163-174.","DOI":"10.1145\/863955.863975"},{"key":"1632_CR22","doi-asserted-by":"crossref","unstructured":"Kale S, Hazan E, Cao F, Singh J P. Analysis and algorithms for content-based event matching. In Proc. the 25th Int. Conf. Distributed Computing Systems (ICDCS) Workshops, Jun. 2005, pp.363-369.","DOI":"10.1109\/ICDCSW.2005.40"},{"key":"1632_CR23","doi-asserted-by":"crossref","unstructured":"Wang B, Zhang W, Kitsuregawa M. UB-tree based efficient predicate index with dimension transform for pub\/sub system. In Proc. the 9th DASFAA, Mar. 2004, pp.63-74.","DOI":"10.1007\/978-3-540-24571-1_5"},{"issue":"1","key":"1632_CR24","first-page":"451","volume":"1","author":"A Machanavajjhala","year":"2008","unstructured":"Machanavajjhala A, Vee E, Garofalakis M N, Shanmugasundaram J. Scalable ranked publish\/subscribe. PVLDB, 2008, 1(1): 451\u2013462.","journal-title":"PVLDB"},{"key":"1632_CR25","doi-asserted-by":"crossref","unstructured":"Sadoghi M, Jacobsen H A. BE-tree: An index structure to efficiently match Boolean expressions over high-dimensional discrete space. In Proc. the 30th SIGMOD, Jun. 2011, pp.637-648.","DOI":"10.1145\/1989323.1989390"},{"issue":"1","key":"1632_CR26","first-page":"37","volume":"2","author":"S Whang","year":"2009","unstructured":"Whang S, Garcia-Molina H, Brower C, Shanmugasundaram J, Vassilvitskii S, Vee E, Yerneni R. Indexing Boolean expressions. PVLDB, 2009, 2(1): 37\u201348.","journal-title":"PVLDB"},{"key":"1632_CR27","doi-asserted-by":"crossref","unstructured":"Sadoghi M, Jacobsen H A. Analysis and optimization for Boolean expression indexing. ACM Transactions on Database Systems, 2013, 38(2): Article No. 8.","DOI":"10.1145\/2487259.2487260"},{"key":"1632_CR28","doi-asserted-by":"crossref","unstructured":"Sadoghi M, Jacobsen H A. Relevance matters: Capitalizing on less (top-k matching in publish\/subscribe). In Proc. the 28th ICDE, Apr. 2012, pp.786-797.","DOI":"10.1109\/ICDE.2012.38"},{"key":"1632_CR29","doi-asserted-by":"crossref","unstructured":"Petrovic M, Liu H, Jacobsen H A. G-ToPSS: Fast filtering of graph-based metadata. In Proc. the 14th WWW, May 2005, pp.539-547.","DOI":"10.1145\/1060745.1060824"},{"key":"1632_CR30","unstructured":"Liu H, Petrovic M, Jacobsen H. Efficient filtering of RSS documents on computer cluster. Technical Report, MSRG, University of Toronto, Nov. 2007."},{"key":"1632_CR31","doi-asserted-by":"crossref","unstructured":"Demers A J, Gehrke J, Hong M, Riedewald M, White W M. Towards expressive publish\/subscribe systems. In Proc. the 10th EDBT, Mar. 2006, pp.627-644.","DOI":"10.1007\/11687238_38"},{"key":"1632_CR32","doi-asserted-by":"crossref","unstructured":"Irmak U, Mihaylov S, Suel T, Ganguly S, Izmailov R. Efficient query subscription processing for prospective search engines. In Proc. USENIX, Jun. 2006, pp.375-380.","DOI":"10.1145\/1135777.1136003"},{"issue":"6","key":"1632_CR33","first-page":"385","volume":"6","author":"A Shraer","year":"2013","unstructured":"Shraer A, Gurevich M, Fontoura M, Josifovski V. Top-k publish-subscribe for social annotation of news. PVLDB, 2013, 6(6): 385\u2013396.","journal-title":"PVLDB"},{"key":"1632_CR34","doi-asserted-by":"crossref","unstructured":"Hmedeh Z, du Mouza C, Travers N. TDV-based filter for novelty and diversity in a real-time pub\/sub system. In Proc. the 19th IDEAS, Jul. 2015, pp.136-145.","DOI":"10.1145\/2790755.2790768"},{"key":"1632_CR35","doi-asserted-by":"crossref","unstructured":"Hmedeh Z, du Mouza C, Travers N. FiND: A real-time filtering by novelty and diversity for publish\/subscribe systems. In Proc. the 27th SSDBM, June 29-July 1, 2015.","DOI":"10.1145\/2791347.2791356"}],"container-title":["Journal of Computer Science and Technology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-016-1632-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11390-016-1632-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-016-1632-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,5]],"date-time":"2019-09-05T14:29:40Z","timestamp":1567693780000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11390-016-1632-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,3]]},"references-count":35,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,3]]}},"alternative-id":["1632"],"URL":"https:\/\/doi.org\/10.1007\/s11390-016-1632-8","relation":{},"ISSN":["1000-9000","1860-4749"],"issn-type":[{"value":"1000-9000","type":"print"},{"value":"1860-4749","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,3]]}}}