A fast regular expression indexing engine

被引:18
作者
Cho, JH [1 ]
Rajagopalan, S [1 ]
机构
[1] Univ Calif Los Angeles, Los Angeles, CA 90024 USA
来源
18TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING, PROCEEDINGS | 2002年
关键词
D O I
10.1109/ICDE.2002.994755
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In this paper; we describe the design, architecture, and the lessons learned from the implementation of a fast regular expression indexing engine FREE. FREE uses a pre-built index to identify the text data units which nay contain a matching string and only examines these further. In this nay, FREE shows orders of magnitude performance improvement in certain cases over standard regular expression matching systems, such as lex, awk and grep [18, 4].
引用
收藏
页码:419 / 430
页数:12
相关论文
共 27 条
[1]  
ADELBERG B, 1998, P ACM SIGMOD C MAN D
[2]  
Agrawal R., 1993, SIGMOD Record, V22, P207, DOI 10.1145/170036.170072
[3]  
Agrawal R., 1994, P 20 INT C VER LARG, V1215, P487
[4]  
Aho AV., 1988, AWK PROGRAMMING LANG
[5]   Fast text searching for regular expressions or automaton searching on tries [J].
BaezaYates, RA ;
Gonnet, GH .
JOURNAL OF THE ACM, 1996, 43 (06) :915-936
[6]   FROM REGULAR EXPRESSIONS TO DETERMINISTIC AUTOMATA [J].
BERRY, G ;
SETHI, R .
THEORETICAL COMPUTER SCIENCE, 1986, 48 (01) :117-126
[7]   FAST STRING SEARCHING ALGORITHM [J].
BOYER, RS ;
MOORE, JS .
COMMUNICATIONS OF THE ACM, 1977, 20 (10) :762-772
[8]   DERIVATIVES OF REGULAR EXPRESSIONS [J].
BRZOZOWSKI, JA .
JOURNAL OF THE ACM, 1964, 11 (04) :481-&
[9]  
CHO JH, 2001, FAST REGULAR EXPRESS
[10]  
Cooper B. F., 2001, P 27 VLDB C ROM IT