Pattern matching algorithms for streaming data
Pattern matching algorithms for streaming data
批准号:
EP/H028056/1
负责人:
Benjamin Sach
金额:
$28.32万
依托单位:
依托单位国家:
英国
项目类别:
Fellowship
财政年份:
2011
资助国家:
英国
项目状态:
已结题
起止时间:
2011 至 --
中文摘要
点击翻译按钮获取中文摘要
英文摘要
Imagine that I give you the following task: read the Complete Works of Shakespeare and write down all occurrences of the phrase my good lord . The task is known in Computer Science as exact pattern matching; here the phrase my good lord is the pattern. If I asked you to find all phrases similar to the phrase my good lord , you may decide write down the phrases my noble lord , my gracious lord and simply my lord . This is approximate pattern matching, a problem whose complexity is, of course, dependent on how we define the word similar. The definition considered depends on the application and much of the breadth and depth of the field arises from this.Now imagine that I am going to read the Complete Works of Shakespeare to you and expect you to write down similar phrases as you hear them. This is online approximate pattern matching and is the focus of this proposal. The proposal is applicable to Internet related applications where a vast quantity of data passes though a computer constantly - a field known as data streaming. Here the data is far too large to be stored and results must be computed on the fly as the data arrives. In the reading analogy, if you mishear a paragraph, I'm not going to reread it to you.The aim of this proposal is to bring these fields together to search for patterns quickly in streaming data. Continuing the analogy, we will be considering finding patterns in a number of circumstances:1. As before I am going to read you a book but this time much faster. I know that you can't write down all the occurrences fast enough but I want you to guarantee you will catch most of them.2. Many people will read books out loud to you at the same time. Any time any of them say the pattern you are looking, for you have to write it down.3. I am going to read you a book but I make no promise to read the words in order: page 6 line 3 word 6 is good , page 39 line 1 word 2 is happy , page 6 line 3 word 5 is my ...Of course, these problems sound strange and counter-intuitive phrased in plain English, but the underlying Computer Science problems are highly significant for many emerging applications such as traffic shaping, firewalls, Internet monitoring and malicious content detection.
期刊论文(7)
专著(0)
科研奖励(0)
会议论文
登录
查看更多内容
Cell-Probe Bounds for Online Edit Distance and Other Pattern Matching Problems
在线编辑距离和其他模式匹配问题的单元探针边界
DOI:
--
发表时间:
期刊:
SODA 2015
影响因子:
--
作者:
[Sach, B]
通讯作者:
Sach, B
Automata, Languages, and Programming
自动机、语言和编程
DOI:
10.1007/978-3-642-39212-2_44
发表时间:
2013
期刊:
影响因子:
--
作者:
[Christodoulou G]
通讯作者:
Christodoulou G
DOI:
10.1016/j.jda.2013.06.003
发表时间:
2014
期刊:
Journal of Discrete Algorithms
影响因子:
--
作者:
[Bille P]
通讯作者:
Bille P
Tight Cell-Probe Bounds for Online Hamming Distance Computation
用于在线汉明距离计算的严格单元探针边界
DOI:
10.1137/1.9781611973105.48
发表时间:
2013
期刊:
影响因子:
--
作者:
[Clifford R]
通讯作者:
Clifford R
Pattern Matching under Polynomial Transformation
多项式变换下的模式匹配
DOI:
10.1137/110853327
发表时间:
2013
期刊:
SIAM Journal on Computing
影响因子:
1.6
作者:
[Butman A]
通讯作者:
Butman A
共 6 条
Pattern matching algorithms for streaming data
-
批准号:EP/H028056/2
-
项目类别:Fellowship
-
资助金额:$5.46万
-
财政年份:2013
-
负责人:Benjamin Sach
-
依托单位:
国内基金
海外基金
超高速正则表达式匹配技术研究
-
批准号:61073184
-
项目类别:面上项目
-
资助金额:12.0万元
-
批准年份:2010
-
负责人:董群峰
-
依托单位: