標題: On processing continuous frequent K-N-match queries for dynamic data over networked data sources
作者: Chiu, Shih-Chuan
Huang, Jiun-Long
Huang, Jen-He
資訊工程學系
Department of Computer Science
關鍵字: Similarity search;k-n-match problem;Continuous query;Dynamic data
公開日期: 1-六月-2012
摘要: Similarity search is one of the critical issues in many applications. When using all attributes of objects to determine their similarity, most prior similarity search algorithms are easily influenced by a few attributes with high dissimilarity. The is proposed to overcome the above problem. However, the prior algorithm to process frequent --match queries is designed for static data, whose attributes are fixed, and is not suitable for dynamic data. Thus, we propose in this paper two schemes to process continuous frequent --match queries over dynamic data. First, the concept of is proposed and four formulae are devised to compute safe regions. Then, scheme CFKNMatchAD-C is developed to speed up the process of continuous frequent --match queries by utilizing safe regions to avoid unnecessary query re-evaluations. To reduce the amount of data transmitted by networked data sources, scheme CFKNMatchAD-C also uses safe regions to eliminate transmissions of unnecessary data updates which will not affect the results of queries. Moreover, for large-scale environments, we further propose scheme CFKNMatchAD-D by extending scheme CFKMatchAD-C to employ multiple servers to process continuous frequent --match queries. Experimental results show that scheme CFKNMatchAD-C and scheme CFKNMatchAD-D outperform the prior algorithm in terms of average response time and the amount of produced network traffic.
URI: http://hdl.handle.net/11536/16296
ISSN: 0219-1377
期刊: KNOWLEDGE AND INFORMATION SYSTEMS
Volume: 31
Issue: 3
結束頁: 547
顯示於類別:期刊論文


文件中的檔案:

  1. 000304116100007.pdf

若為 zip 檔案,請下載檔案解壓縮後,用瀏覽器開啟資料夾中的 index.html 瀏覽全文。