How to make SQL stand for string query language

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

Volumn 1949, Issue , 2000, Pages 61-79

  Grahne, Gösta ^a   Waller, Emmanuel ^b  

^a Gina Cody School of Engineering and Computer Science   (Canada)

^b UFR 919 Laboratoire d'Informatique Pour la Mécanique et les Sciences de l'Ingénieur   (France)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LOGIC; QUERY LANGUAGES; QUERY PROCESSING; SEMANTICS;

FIRST ORDER LOGIC; GENERICITY; NATURAL LANGUAGES; STRING DATABASE; USER FRIENDLY;

COMPUTATIONAL LINGUISTICS;

EID: 84959043571     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44543-9_5     Document Type: Conference Paper

References (38)

1. S. Abiteboul, R. Hull and V. Vianu. Foundations of Databases. Addison-Wesley, 1995.
2. N. Balkir, E. Sukan, G. Ozsoyoglu and Z. Oszoyoglu. VISUAL: A graphical iconbased query language. In IEEE International Conferecne on Data Engineering, 1996.
3. M. Benedikt, L. Libkin. Languages for Relational Databases over Interpreted Structures. In Proc. ACM Symp. on Principles of Database Systems, 1997.
4. M. Benedikt, L. Libkin. Safe Constraint Queries. In Proc. ACM Symp. on Principles of Database Systems, 1998.
5. E. F. Codd. A Relational Model of Data for Large Shared Data Banks. Communications of ACM, 13:6, 1970
6. J. Collado-Vides. The search for a grammatical theory of gene regulation is formally justified by showing the inadequacy of context-free grammars. Computer applications in the Biosciences, 7(3):321-326, 1991.
7. C. Date. An introduction to database systems. Addison-Wesley, 1994.
8. V. Diekert, Makanin’s algorithm. Available at http://www.lri.fr/˜rtaloop/92.html
9. T. Eiter, G. Gottlob, Y. Gurevich. Existential Second-Order Logic over Strings. In Proc. Symp. On Logic in Computer Science, 1998.
10. T. Etzold and P. Argos. SRS - an indexing and retrieval tool for flat file data libraries. Computer applications in the Biosciences, 9(1):49-57, 1993.
11. T. Etzold and P. Argos. Transforming a set of biological flat file libraries to a fast access network. Computer applications in the Biosciences, 9(1):59-64, 1993
12. European Molecular Biologiy Network (EMBNET). Strategies in Bioinformatics: a european perspective, 1994.
13. Z. Galil, J. I. Seiferas. Time-Space-Optimal String Matching. Journal of Computer and System Sciences26(3): 280-294, 1983.
14. S. Ginsburg, X. S. Wang. Pattern Matching by Rs-Operations: Toward a Unified Approach to Querying Sequenced Data. In Proc. ACM Symp. on Principles of Database Systems, 1992.
15. S. Ginsburg and W. Wang. Regular Sequence Operations and Their Use in Database Queries. Journal of Computer and System Science56(1): 1-26 (1998)
16. Y. Gurevich. in [1], exercice 17.27.
17. G. Grahne, M. Nykänen, E. Ukkonen. Reasoning about Strings in Databases. In Proc. ACM Symp. on Principles of Database Systems, 1994.
18. G. Grahne, M. Nykänen. Safety, translation and evaluation of Alignment calculus. First East-European Symposium on Advances in Database Information Systems (ABDIS’97), St-Petersburg, Russia, 1997.
19. G. Grahne, R. Hakli, M. Nykanen and E. Ukkonen. AQL: An alignment based language for querying string databases. Proc. of the 9TH International Conference on Management of Data (Comad’98), Hyderabad, India, December 1998.
20. R. Hull, J. Su. Domain independence and the relational calculus. Acta informatica, 31:6, 1994.
21. J. W. Lloyd Foundations of logic programming. Springer, 1984.
22. J. Barwise (Ed). Handbool of mathematical logic. North-Holland, 1991.
23. G. S. Makanin. The problem of solvability of equations in a free semi-group. English translation in Math. USSR Sbornik, 32, 129-198, 1977.
24. G. Mecca, A. J. Bonner. Sequences, Datalog and Transducers. In Proc. ACM Symp. on Principles of Database Systems, 1995.
25. C. H. Papadimitriou. Computational complexity. Addison-Wesley, Chap. 17, 1994.
26. W. V. Quine. Concatenation as a basis for arithmetic. Journal of Symbolic Logic, 11(4):105-114, 1946
27. J. Richardson. Supporting lists in a data model (a timely approach). Proc. of Intl. Conf. on Very Large Data Bases, 1992.
28. G. Rozenberg, A. Salomaa (Eds). Handbook of formal languages. Springer, 1997.
29. A. Salomaa. Formal languages, Chap. 3, Academic Press, 1973.
30. K. Schulz. Personnal communication.
31. D. Searls. String variable grammar: a logic grammar formalism for the biological language of DNA. Journal of Logic Programming, pp. 73–102, 1995.
32. P. Seshadri, M. Livny and R. Ramakrishnan. SEQ: a model for sequence databases. IEEE International Conference on Data Engineering, pp. 232–239, 1995.
33. P. Seshadri, M. Livny and R. Ramakrishnan. The design and implementation of a sequence database system. Proc. of Intl. Conf. on Very Large Data Bases, 1996.
34. L. J. Stockmeyer. The polynomial-time hierarchy. Theoretical Computer Science, 3:1-22, 1977
35. B. Subramanian, T. Leung, S. Vandenberg and S. Zdonik. The AQUA approach to querying lists and trees in objsct-oriented databases. IEEE International Conference on Data Engineering, pp. 80–89, 1995.
36. R. Treinen. A new method for undecidability proofs of first order theories. J. Symbolic Computation, 14:437-457, 1992.
37. J. Ullman. Principles of database and knowledge-base systems, Volume 1. Computer Science Press, 1988.
38. P. Wolper. Temporal logic can be more expressive. Information and Control, 56:72-99, 1983.