RE-tree: An efficient index structure for regular expressions

VLDB Journal

Volumn 12, Issue 2, 2003, Pages 102-119

  Chan, Chee Yong ^a   Garofalakis, Minos ^a   Rastogi, Rajeev ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

Index structure; Regular expressions; Sampling based approximations; Size measures

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; DATABASE SYSTEMS; UNIX; XML;

INDEX STRUCTURES;

COMPUTER PROGRAMMING LANGUAGES;

EID: 0043016119     PISSN: 10668888     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00778-003-0094-0     Document Type: Conference Paper

References (23)

1. Altinel M, Franklin MJ (2000) Efficient filtering of XML documents for selective dissemination of information. In: Proceedings of VLDB, Cairo, September 2000, pp 53-64
2. Baeza-Yates R, Gonnet G (1996) Fast text searching for regular expressions or automaton searching on a trie. J ACM 43(6):915-936
3. Baeza-Yates R, Ribeiro-Neto B, Navarro G (1999) Indexing and searching. In: Modern information retrieval. ACM Press, New York, pp 191-228
4. 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 SIGMOD, Atlantic City, NJ, May 1990, pp 322-331
5. Chan C-Y, Felber P, Garofalakis M, Rastogi R (2002) Efficient filtering of XML documents with XPath expressions. In: Proceedings of the 18th international conference on data engineering, San Jose, February 2002, pp 235-244
6. Chan CY, Garofalakis M, Rastogi R (2002) RE-Tree: an efficient index structure for regular expressions. In: Proceedings of VLDB, Hong Kong, August 2002, pp 251-262
7. Clark J, DeRose S (1999) XML path language (XPath) v. 1.0. W3C Recommendation, http://www.w3.org./TR/xpath
8. Cochran WG (1977) Sampling techniques. Wiley, New York
9. Intel Corporation (2000) Intel NetStructure XML accelerators, http://www.intel.com/netstructure/products/xml.accelerators.htm
10. Deutsch A, Fernandez M, Suciu D (1999) Storing semi structured data with STORED. In: Proceedings of the ACM SIGMOD conference on management of data, Philadelphia, June 1999, pp 431-442
11. Diao Y, Fischer P, Franklin MJ, To R (2002) YFilter: efficient and scalable filtering of XML documents. In: Proceedings of the 18th international conference on data engineering, San Jose, February 2002, pp 341-342
12. Garey MR. Johnson DS (1979) Computers and intractability: a guide to the theory of NP-Completeness. Freeman, San Francisco
13. Garofalakis M, Gionis A, Rastogi R, Seshadri S, Shim K (2000) XTRACT: a system for extracting document type descriptors from XML documents. In: Proceedings of SIGMOD, Dallas, May 2000, pp 165-176
14. Guttman A (1984) R-Trees: a dynamic index structure for spatial searching. In: Proceedings of SIGMOD, Boston, June 1984, pp 47-57
15. Hopcroft JE, Ullman JD (1979) Introduction to automata theory, languages, and computation. Addison-Wesley, Reading, MA
16. Ishikawa Y, Kitagawa H, Ohbo N (1993) Evaluation of signature files as set access facilities in OODBs. In: Proceedings of SIGMOD, Washington, DC, May 1993, pp 247-256
17. Kannan S, Sweedyk Z, Mahaney S (1995) Counting and random generation of strings in regular languages. In: Proceedings of SODA, San Francisco, January 1995, pp 551-557
18. Kilpelainen P, Mannila H, Ukkonen E (1995) MDL learning of unions of simple pattern languages from positive examples. In: Proceedings of EuroCOLT, Barcelona, March 1995, pp 252-260
19. Lakshmanan LVS, Parthasarathy S (2002) On efficient matching of streaming XML documents and queries. In: Proceedings of EDBT, Prague, March 2002, pp 142-160
20. Quinlan JR, Rivest RL (1989) Inferring decision trees using the minimum description length principle. Information and Computation 80:227-248
21. Rissanen J (1978) Modeling by shortest data description. Automatica 14:465-471
22. Stewart JW (1998) BGP4 inter-domain routing in the Internet. Addison-Wesley, Reading, MA
23. Wu S, Manber U (1992) Fast text searching allowing errors. Commun ACM 35(10):83-91