IEICE TRANSACTIONS on Information
Regular Expression Filtering on Multiple q-Grams
Summary :
Regular expression matching is essential in network and big-data applications; however, it still has a serious performance bottleneck. The state-of-the-art schemes use a multi-pattern exact string-matching algorithm as a filtering module placed before a heavy regular expression engine. We design a new approximate string-matching filter using multiple q-grams; this filter not only achieves better space compactness, but it also has higher throughput than the existing filters.
- Publication
- IEICE TRANSACTIONS on Information Vol.E101-D No.1 pp.253-256
- Publication Date
- 2018/01/01
- Publicized
- 2017/10/11
- Online ISSN
- 1745-1361
- DOI
- 10.1587/transinf.2017EDL8180
- Type of Manuscript
- LETTER
- Category
- Information Network
Authors
Seon-Ho SHIN
Kookmin University
HyunBong KIM
Kookmin University
MyungKeun YOON
Kookmin University
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Seon-Ho SHIN, HyunBong KIM, MyungKeun YOON, "Regular Expression Filtering on Multiple q-Grams" in IEICE TRANSACTIONS on Information,
vol. E101-D, no. 1, pp. 253-256, January 2018, doi: 10.1587/transinf.2017EDL8180.
Abstract: Regular expression matching is essential in network and big-data applications; however, it still has a serious performance bottleneck. The state-of-the-art schemes use a multi-pattern exact string-matching algorithm as a filtering module placed before a heavy regular expression engine. We design a new approximate string-matching filter using multiple q-grams; this filter not only achieves better space compactness, but it also has higher throughput than the existing filters.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.2017EDL8180/_p
Copy
@ARTICLE{e101-d_1_253,
author={Seon-Ho SHIN, HyunBong KIM, MyungKeun YOON, },
journal={IEICE TRANSACTIONS on Information},
title={Regular Expression Filtering on Multiple q-Grams},
year={2018},
volume={E101-D},
number={1},
pages={253-256},
abstract={Regular expression matching is essential in network and big-data applications; however, it still has a serious performance bottleneck. The state-of-the-art schemes use a multi-pattern exact string-matching algorithm as a filtering module placed before a heavy regular expression engine. We design a new approximate string-matching filter using multiple q-grams; this filter not only achieves better space compactness, but it also has higher throughput than the existing filters.},
keywords={},
doi={10.1587/transinf.2017EDL8180},
ISSN={1745-1361},
month={January},}
Copy
TY - JOUR
TI - Regular Expression Filtering on Multiple q-Grams
T2 - IEICE TRANSACTIONS on Information
SP - 253
EP - 256
AU - Seon-Ho SHIN
AU - HyunBong KIM
AU - MyungKeun YOON
PY - 2018
DO - 10.1587/transinf.2017EDL8180
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E101-D
IS - 1
JA - IEICE TRANSACTIONS on Information
Y1 - January 2018
AB - Regular expression matching is essential in network and big-data applications; however, it still has a serious performance bottleneck. The state-of-the-art schemes use a multi-pattern exact string-matching algorithm as a filtering module placed before a heavy regular expression engine. We design a new approximate string-matching filter using multiple q-grams; this filter not only achieves better space compactness, but it also has higher throughput than the existing filters.
ER -
English
