Conference Proceeding Article
A text filtering system monitors a stream of incoming documents, to identify those that match the interest profiles of its users. The user interests are registered at a server as continuous text search queries. The server constantly maintains for each query a ranked result list, comprising the recent documents (drawn from a sliding window) with the highest similarity to the query. Such a system underlies many text monitoring applications that need to cope with heavy document traffic, such as news and email monitoring. In this paper, we propose the first solution for processing continuous text queries efficiently. Our objective is to support a large number of user queries while sustaining high document arrival rates. Our solution indexes the streamed documents with a structure based on the principles of the inverted file, and processes document arrival and expiration events with an incremental threshold-based method. Using a stream of real documents, we experimentally verify the efficiency of our approach, which is at least an order of magnitude faster than a competitor constructed from existing techniques.
Arrival rates, E-mail monitoring, Inverted files, Monitoring applications, Order of magnitude, Sliding Window, Structure-based, Text filtering, Text query, Text search, Threshold methods, User interests, User query
Databases and Information Systems | Numerical Analysis and Scientific Computing
Data Management and Analytics
ICDE 2009: 25th IEEE International Conference on Data Engineering: Proceedings, 29 March-2 April 2009, Shanghai, China
IEEE Computer Society
City or Country
Los Alamitos, CA
MOURATIDIS, Kyriakos and PANG, Hwee Hwa.
An Incremental Threshold Method for Continuous Text Search Queries. (2009). ICDE 2009: 25th IEEE International Conference on Data Engineering: Proceedings, 29 March-2 April 2009, Shanghai, China. 1187-1190. Research Collection School Of Information Systems.
Available at: http://ink.library.smu.edu.sg/sis_research/455
Creative Commons License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License.