Efficient multi-event monitoring using built-in search engines

作     者：Zhaoman ZHONG Zongtian LIU Yun HU Cunhua LI 

作者机构：School of Computer Engineering Huaihai Institute of Technology Lianyungang 222006 China School of Computer Engineering and Science Shanghai University Shanghai 200072 China 

出 版 物：《Frontiers of Computer Science》 (中国计算机科学前沿（英文版）)

年 卷 期：2016年第10卷第2期

页      面：281-291页

核心收录：

学科分类：12[管理学] 1201[管理学-管理科学与工程(可授管理学、工学学位)] 08[工学] 081201[工学-计算机系统结构] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：国家自然科学基金 the Science and Technology Foundation of Lianyungang 

主　　题：information retrieval event retrieval event monitoring BSEs event rule reduction 

摘      要：Users of the internet often wish to follow certain news events, and the interests of these users often overlap. General search engines （GSEs） cannot be used to achieve this task due to incomplete coverage and lack of freshness. Instead, a broker is used to regularly query the built-in search engines （BSEs） of news and social media sites. Each user defines an event profile consisting of a set of query rules called event rules （ERs）. To ensure that queries match the semantics of BSEs, ERs are transformed into a disjunctive normal form, and separated into conjunctive clauses （atomic event rules, AERs）. It is slow to process all AERs on BSEs, and can violate query submission rate limits. Accordingly, the set of AERs is reduced to eliminate AERs that are duplicates, or logically contained by other AERs. Five types of event are selected for experimental comparison and analysis, including natural disasters, accident disasters, public health events, social security events, and negative events of public servants. Using 12 BSEs, 85 ERs for five types of events are defined by five users. Experimental comparison is conducted on three aspects： event rule reduction ratio, number of collected events, and that of related events. Experimental results in this paper show that event rule reduction effectively enhances the efficiency of crawling.