Reasoning about strings in databases

Journal of Computer and System Sciences

Volumn 59, Issue 1, 1999, Pages 116-162

  Grahne, Gösta ^a   Nykänen, Matti ^a   Ukkonen, Esko ^a  

^a UNIVERSITY OF HELSINKI   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; COMPUTATIONAL METHODS; DATA STRUCTURES; FINITE AUTOMATA; FORMAL LOGIC; INFORMATION RETRIEVAL SYSTEMS; LINGUISTICS; QUERY LANGUAGES;

ALIGNMENT CALCULUS; RELATIONAL ALGEBRA; STRINGS;

DATABASE SYSTEMS;

EID: 0033169435     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.1999.1633     Document Type: Article

References (34)

1. W. Brauer and K.-J. Lange, Non-deterministic two-tape automata are more powerful than deterministic ones, in Symposium on Theoretical Aspects of Computer Science, 1985, pp. 71-79.
2. Collado-Vides J. The search for a grammatical theory of gene regulation is formally justified by showing the inadequacy of context-free grammars. Comput. Appl. Biosci. 7:1991;321-326.
3. Emerson E. A. Temporal and modal logic. van Leeuwen J. Handbook of Theoretical Computer Science, Vol. B, Formal Models and Semantics. 1990;994-1072 Elsevier, Amsterdam.
4. M. Escobar-Molano, R. Hull, and D. Jacobs, Safety and translation of calculus queries with scalar functions (extended abstract), in ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1993, pp. 253-264.
5. Galil Z., Seiferas J. Time-space optimal string matching. J. Comput. System Sci. 26:1983;280-294.
6. Garey M. R., Johnson D. S. Computers and Intractability: A Guide to the Theory of NP-Completeness. 1979;Freeman, San Francisco.
7. Ginsburg S., Spanier H. Mappings of languages by two-tape devices. J. Assoc. Comput. Mach. 12:1965;423-434.
8. S. Ginsburg and X. Wang, Pattern matching by rs-operations: Towards a unified approach to querying sequenced data (extended abstract), in ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1992, pp. 293-300.
9. Goldberg R. R. Finite state automata from regular expression trees. Comput. J. 36:1993;623-630.
10. Grahne G., Nykänen M. Safety, translation and evaluation of Alignment Calculus. Advances in Databases and Information Systems. Springer Electronic Workshops in Computing. 1997;. p. 295-304.
11. G. Grahne, M. Nykänen, and E. Ukkonen, Reasoning about strings in databases, in ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Databases Systems, 1994, pp. 303-312.
12. Harrison M. A., Ibarra O. H. Multi-tape and multi-head pushdown automata. Information and Control. 13:1968;433-470.
13. C. Helgesen and P. R. Sibbald, PALM - a pattern language for molecular biology, in International Conference on Intelligent Systems in Molecular Biology, 1993, pp. 172-180.
14. Hopcroft J. E., Ullman J. D. Introduction to Automata Theory, Languages, and Computation. 1979;Addison-Wesley, Reading.
15. Hull R., Su J. Domain independence and the relational calculus. Acta Inform. 31:1994;513-524.
16. H. V. Jagadish, A. O. Mendelzon, and T. Milo, Similarity-based queries, in ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1995, pp. 36-45.
17. McAdams H. H., Shapiro L. Circuit simulation of genetic networks. Science. 269:1995;650-656.
18. G. Mecca and A. J. Bonner, Sequences, Datalog and transducers, in ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1995, pp. 23-35.
19. Pistor P., Traunmüller R. A database language for sets, lists and tables. Information Systems. 11:1986;323-336.
20. Rajlich V. Absolutely parallel grammars and two-way finite-state transducers. J. Comput. Sys. Sci. 6:1972;324-342.
21. R. Ramakhrisnan, F. Bancilhon, and A. Silberschatz, Safety of recursive Horn clauses with infinite relations (extended abstract), in ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1987, pp. 328-339.
22. J. Richardson, Supporting lists in a data model (a timely approach), in Very Large Data Bases Conference, 1992, pp. 127-138.
23. Rogers H. Theory of Recursive Functions and Effective Computability. 1967;McGraw-Hill, New York.
24. Sankoff D., Kruskal J. B. Time Warps, String Edits and Macromolecules: The Theory and Practice of Sequence Comparison. 1983;Addison-Wesley, Reading.
25. Searls D. B. String variable grammar: A logic grammar formalism for the biological language of DNA. J. Logic Programming. 1995;73-102.
26. D. B. Searls and K. P. Murphy, Automata-theoretic models of mutation and alignment, in International Conference on Intelligent Systems in Molecular Biology, 1995, pp. 341-349.
27. Sippu S., Soisalon-Soininen E. Parsing Theory, Vol. I, Languages and Parsing. 1988;Springer-Verlag, New York/Berlin.
28. Stockmeyer L. J. The polynomial-time hierarchy. Theoret. Comput. Sci. 3:1977;1-22.
29. Ullman J. D. Principles of Database and Knowledge-Base Systems. 1988;Comput. Sci. Press, New York.
30. M. Vardi, The complexity of relational query languages, in ACM Symposium on Theory of Computing, 1982, pp. 137-145.
31. Wang X. Pattern Matching by Rs-Operations: Towards a Unified Approach to Querying Sequenced Data. 1992;University of Southern Carolina.
32. Weber A. On the valuedness of finite transducers. Acta Inform. 27:1990;749-780.
33. Weber A. On the lengths of values in a finite transducer. Acta Inform. 29:1992;663-687.
34. Wolper P. Temporal logic can be more expressive. Inform. and Control. 56:1983;72-99.