Query answering and containment for regular path queries under distortions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2942, Issue , 2004, Pages 98-115

  Grahne, Gösta ^a   Thomo, Alex ^b  

^a Civil and Environmental Engineering   (Canada)

^b SUFFOLK UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

POLYNOMIAL APPROXIMATION; QUERY PROCESSING;

APPROXIMATE QUERY PROCESSING; DISTANCE AUTOMATA; OPTIMAL ALGORITHM; POLYNOMIAL-TIME; QUERY CONTAINMENT; REGULAR EXPRESSIONS; REGULAR PATH QUERIES; SEMISTRUCTURED DATABASE;

QUERY LANGUAGES;

EID: 35048812461     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24627-5_8     Document Type: Article

References (19)

1. Abiteboul S., P. Buneman and D. Suciu. Data on the Web : From Relations to Semistructured Data and Xml. Morgan Kaufmann Pulishers. San Francisco, Ca., 1999.
2. Aho A., J. E. Hopcroft and J. D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley. Reading Ma., 1974.
3. Calvanese D., G. Giacomo, M. Lenzerini and M. Y. Vardi. Rewriting of Regular Expressions and Regular Path Queries. Proc. PODS '99, pp. 194-204.
4. Calvanese D., G. Giacomo, M. Lenzerini and M. Y. Vardi. View-Based Query Processing and Constraint Satisfaction. Proc. LICS '00, pp. 361-371
5. Grahne G., and A. Thomo. An Optimization Technique for Answering Regular Path Queries Proc. WebDB '00, pp. 99-104.
6. Grahne G., and A. Thomo. Algebraic rewritings for optimizing regular path queries. Proc. ICDT '01, pp. 303-315
7. Hashiguchi K. Limitedness Theorem on Finite Automata with Distance Functions. J. Comp. Syst. Sci. 24 (2) : 233-244, 1982
8. Hashiguchi K. Improved Limitedness Theorems on Finite Automata with Distance Functions. Theoretical Computer Science 72 (1) : 27-38, 1990
9. Hashiguchi K. New upper bounds to the limitedness of distance automata. Theoretical Computer Science 233 (1-2) : 19-32, 2000
10. Hopcroft J. E., and J. D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley. Reading Ma., 1979.
11. Hunt H. B. III, D. J. Rosenkrantz, and T. G. Szymanski, On the Equivalence, Containment, and Covering Problems for the Regular and Context-Free Languages. J. Comp. Syst. Sci. 12 (2) : 222-268, 1976
12. Kruskal J. An Overview of Sequence Comparison. In: Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison. D. Sankoff and J. Kruskal (Eds.). Addison-Wesley. Reading Ma., 1983. pp. 1-44.
13. Jagadish H. V., A. O. Mendelzon, and T. Milo. Similarity-Based Queries. Proc. PODS '95, pp. 36-45.
14. Leung H. Limitedness Theorem on Finite Automata with Distance Functions: An Algebraic Proof. Theoretical Computer Science 81 (1) : 137-145, 1991
15. Mendelzon A. O., and P. T. Wood, Finding Regular Simple Paths in Graph Databases. SIAM J. Comp. 24 (6) : 1235-1258, 1995.
16. Mendelzon A. O. G. A. Mihaila and T. Milo. Querying the World Wide Web. Int. J. Dig. Lib. 1 (1) : 57-67, 1997
17. Pin. J. E. Tropical Semirings, in Idempotency, J. Gunawardena (ed.) Cambridge University Press, pp. 50-69, 1998
18. Simon I. On Semigroups of Matrices over the Tropical Semiring. Informatique Theorique et Applications 28 (3-4) : 277-294, 1994
19. Wagner R. A., and M. J. Fischer. The String-to-String Correction Problem. J. ACM 21 (1) : 168-173, 1974