J. Cho and S. Rajagopalan. A Fast Regular Expression Indexing Engine. In Proceedings of the 18th International Conference on Data Engineering, 2002. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Temporal Rule Discovery using Genetic Programming and.. - Hetland, Sætrom (2002) (Correct)
....makes it possible to e#ciently calculate the fitness of each rule. When mining sequences for complex patterns, this evaluation is not quite as straightforward. E#cient indexing methods for some forms of patterns exist, for example, using Patricia trees, as in [2] or multigram indices, as in [4]) but in this paper we use a specialized co processor designed to perform very advanced, high volume pattern matching. The paper is structured as follows: Section 1.1 describes the problem we are trying to solve in more formal terms; Section 1.2 gives a brief overview of some related work; ....
Junghoo Cho and Sridhar Rajagopalan. A fast regular expression indexing engine. In ICDE, 2002.
A Fast Regular Expression Indexing Engine - Cho, Rajagopalan (2001) (4 citations) Self-citation (Cho Rajagopalan) (Correct)
....As we will see, this algorithm is related to the frequent item set mining problem, which has been extensively studied in the database community. 3. Query compilation: A framework to develop an efficient execution plan given a query. 4. Query execution In the extended version of this pa1 per [10], we propose a new technique, called anchoring, that significantly speeds up in memory regular expression match. Motives Text and hypertext corpora have been a subject of interest in the recent database literature. There are two popular approaches to dealing with large text databases. 1. Search: ....
.... string [2] While (expand is not empty) 3] k grams : all k grams in database whose (k 1) prefix expand [4] expand : 5] For each gram x in k grams [6] If sel(x) c Then check selectivity [7] insert(x, index) the gram is useful [8] Else [9] expand : expand # x [10] k : k 1 Figure 4. Construction of a multigram index Theorem 3.9 Let X be the set of grams indexed by algorithm 3.1. 1. If x X , then x is useful. 2. Conversely, if x is useful, then either x X or there is a unique prefix x # of x such that x # X . 3. X is a prefix free set. # ....
Junghoo Cho and Sridhar Rajagopalan. A fast regular expression indexing engine. Technical report, UCLA Computer Science Department, 2001.
A Search Engine for Natural Language Applications - Cafarella, Etzioni (2005) (Correct)
No context found.
J. Cho and S. Rajagopalan. A Fast Regular Expression Indexing Engine. In Proceedings of the 18th International Conference on Data Engineering, 2002.
A Search Engine for Natural Language Applications - Cafarella, Etzioni (2005) (Correct)
No context found.
J. Cho and S. Rajagopalan. A Fast Regular Expression Indexing Engine. In Proceedings of the 18th International Conference on Data Engineering, 2002.
A Comparison of Hardware and Software in Sequence Rule Evolution - Hetland, Saetrom (2003) (Correct)
No context found.
Junghoo Cho and Sridhar Rajagopalan. A fast regular expression indexing engine. In Proc. 18th International Conference on Data Engineering, ICDE, 2002.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC