Indexed Regular Expression Matching
Years and Authors of Summarized Work
2003; Chan, Garofalakis, Rastogi
Regular expressions (REs) provide an expressive and powerful formalism for capturing the structure of messages, events, and documents. Consequently, they have been used extensively in the specification of a number of languages for important application domains, including the XPath pattern language for XML documents  and the policy language of the Border Gateway Protocol (BGP) for propagating routing information between autonomous systems in the Internet . Many of these applications have to manage large databases of RE specifications and need to provide an effective matching mechanism that, given an input string, quickly identifies all the REs in the database that match it. This RE retrieval problem is therefore important for a variety of software components in the middleware and networking infrastructure of the Internet.
The RE retrieval problem can be stated as follows: Given a large set S...
KeywordsRegular expression indexing Regular expression retrieval
- 1.Altinel M, Franklin M (2000) Efficient filtering of XML documents for selective dissemination of information. In: Proceedings of 26th international conference on very large data bases, Cairo. Morgan Kaufmann, Missouri, pp 53–64Google Scholar
- 2.Beckmann N, Kriegel H-P, Schneider R, Seeger B (1990) The R*-tree: an efficient and robust access method for points and rectangles. In: Proceedings of the ACM international conference on management of data, Atlantic City. ACM, New York, pp 322–331Google Scholar
- 6.Clark J, DeRose S (1999) XML Path Language (XPath) Version 1.0. W3C Recommendation. http://www.w3.org./TR/xpath. Accessed Nov 1999
- 8.Guttman A (1984) R-trees: a dynamic index structure for spatial searching. In: Proceedings of the ACM international conference on management of data, Boston. ACM, New York, pp 47–57Google Scholar
- 10.Kannan S, Sweedyk Z, Mahaney S (1995) Counting and random generation of strings in regular languages. In: Proceedings of the 6th ACM-SIAM symposium on discrete algorithms, San Francisco. ACM, New York, pp 551–557Google Scholar
- 12.Stewart JW (1998) BGP4, inter-domain routing in the Internet. Addison Wesley, ReadingGoogle Scholar