Design and implementation of a string database query language

Information Systems

Volumn 28, Issue 4, 2003, Pages 311-337

  Grahne, Gösta ^a   Hakli, Raul ^b   Nykänen, Matti ^b   Tamm, Hellis ^b   Ukkonen, Esko ^b  

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

^b UNIVERSITY OF HELSINKI   (Finland)

Author keywords

Query languages; String databases

Indexed keywords

DATA STRUCTURES; DNA SEQUENCES; MOLECULAR BIOLOGY; OBJECT ORIENTED PROGRAMMING; RELATIONAL DATABASE SYSTEMS; SEMANTICS;

DATA MANAGEMENT; LANGUAGE ALIGNMENT DECLARATIONS; STRING DATABASES;

QUERY LANGUAGES;

EID: 0037623358     PISSN: 03064379     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0306-4379(02)00075-3     Document Type: Article

References (41)

1. S. Abiteboul, R. Hull, V. Vianu, Foundations of Databases, Addison-Wesley, Reading, MA, 1995.
2. J. Collado-Vides, The search for a grammatical theory of gene regulation is formally justified by showing the inadequacy of context-free grammars, Comput. Appl. Biosci. 7 (3) (1991) 321-326.
3. D. Searls, Linguistic approaches to biological sequences, Comput. Appl. Biosci. 13 (4) (1997) 333-344.
4. J. Setubal, J. Meidanis, Introduction to Computational Molecular Biology, PWS Publishing Company, Boston, MA, 1997.
5. D. Searls, Formal grammars for intermolecular structure, in: Intelligence in Neural and Biological Systems, Herndon, VA, 1995, pp. 30-37.
6. J. Richardson, Supporting lists in a data model (a timely approach), in: Very Large Data Bases Conference, Vancouver, Canada, 1992, pp. 127-138.
7. S. Ginsburg, X. Wang, Regular sequence operations and their use in database queries, J. Comput. Syst. Sci. 56 (1) (1998) 1-26.
8. G. Grahne, M. Nykänen, E. Ukkonen, Reasoning about strings in databases, J. Comput. Syst. Sci. 59 (1999) 116-162.
9. A. Bonner, G. Mecca, Sequences, Datalog and transducers, J. Comput. Syst. Sci. 57 (3) (1998) 234-259.
10. A. Rajasekar, String-oriented databases, in: String Processing and Information Retrieval Symposium (SPIRE'99) & International Workshop on Groupware (CRIWG '99), IEEE (The Institute of Electrical and Electronics Engineers, Inc.), New York, 1999, pp. 158-167.
11. G. Grahne, E. Waller, How to make SQL stand for String Query Language, in: R. Connor, A. Mendelzon (Eds.), International Workshop on Database Programming Languages, Lecture Notes in Computer Science, Vol. 1949, Springer, Berlin, 1999, pp. 61-79.
12. K. Lemström, L. Hella, Approximate pattern matching is expressible in transitive closure logic. in: Logic in Computer Science, Santa Barbara, CA, 2000, pp. 157-167.
13. M. Benedikt, L. Libkin, T. Schwentick, L. Segoufin, String operations in query languages, in: ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, Santa Barbara, CA, 2001, pp. 183-194.
14. S. Ganguly, M. Noordewier, PROXIMAL: a database system for the efficient retrieval of genetic information, Comput. Biol. Med. 26 (3) (1996) 199-207.
15. P. Pistor, R. Traunmüller, A database language for sets, lists and tables. Inform. Syst. 11 (4) (1986) 323-336.
16. P. Seshadri, M. Livny, R. Ramakrishnan, SEQ: a model for sequence databases, in: IEEE International Conference on Data Engineering, Taipei, Taiwan, 1995, pp. 232-239.
17. B. Subramanian, T. Leung, S. Vandenberg, S. Zdonik, The AQUA approach to querying lists and trees in object-oriented databases, in: IEEE International Conference on Data Engineering, Taipei, Taiwan, 1995, pp. 80-89.
18. R. Hakli, M. Nykänen, H. Tamm, E. Ukkonen, Implementing a declarative string query language with string restructuring, in: G. Gupta (Ed.), First International Workshop on Practical Aspects of Declarative Languages (PADL'99), Lecture Notes in Computer Science, 1551, Springer, Berlin, 1999, pp. 179-195.
19. C. Helgesen, P. Sibbald, PALM-a pattern language for molecular biology, in: International Conference on Intelligent Systems in Molecular Biology, Bethesda, MD, 1993, pp. 172-180.
20. D. Searls, String Variable Grammar: a logic grammar formalism for the biological language of DNA, J. Logic Programming 24 (1/2) (1995) 73-102.
21. G. Grahne, R. Hakli, M. Nykänen, E. Ukkonen, AQL: an alignment based query language for querying string databases, in: C. Prabhu (Ed.), Databases for the Millennium 2000: Proceedings of the Ninth International Conference on Management of Data (COMAD'98), Tata McGraw-Hill Publishing Company Limited, New York, 1998, pp. 235-251.
22. R. Hakli, M. Nykänen, H. Tamm, A declarative programming system for manipulating strings, in: Sixth Fenno-Ugric Symposium on Software Technology, Sagadi, Estonia, 1999, pp. 29-49.
23. R. Hakli, M. Nykänen, H. Tamm, Adding string processing capabilities to data management systems, in: Proceedings of the Seventh International Symposium on String Processing and Information Retrieval (SPIRE 2000), IEEE Computer Society Press, Silver Spring, MD, 2000, pp. 122-131.
24. G. Stoesser, W. Baker, A. van den Broek, E. Canon, M. Garcia-Pastor, C. Kanz, T. Kulikova, V. Lombard, R. Lopez, H. Parkinson, N. Redaschi, P. Sterk, P. Stoehr, M. Tuli, The EMBL nucleotide sequence database, Nucleic Acids Res. 29 (1) (2001) 17-21.
25. D. Gusfield, Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology, Cambridge University Press, Cambridge, 1997.
26. E. Emerson, Temporal and modal logic, in: J. van Leeuwen (Ed.), Handbook of Theoretical Computer Science, Vol. B: Formal Models and Semantics, Elsevier, Amsterdam, 1990, pp. 994-1072. (Chapter 16).
27. A. Bonner, G. Mecca, Querying sequence databases with transducers, Acta Inform. 35 (2000) 511-544.
28. J. Hopcroft, J. Ullman, Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, Reading, MA, 1979.
29. M. Nykänen, Using acceptors as transducers, Theoret. Comput. Sci. 267 (1/2) (2001) 83-104.
30. C. Date, H. Darwen, Foundation for Object/Relational Databases-The Third Manifesto, Addison-Wesley, Reading, MA, 1998.
31. D. Searls, K. Murphy, Automata-theoretic models of mutation and alignment, in: International Conference on Intelligent Systems in Molecular Biology, Cambridge, 1995, pp. 341-349.
32. F. Lefebvre, A grammar-based unification of several alignment and folding algorithms, in: International Conference on Intelligent Systems in Molecular Biology, St Louis, MO, 1996, pp. 143-155.
33. J. Rumbaugh, M. Blaha, W. Premerlani, F. Eddy, W. Lorensen, Object-Oriented Modeling and Design, Prentice-Hall, Englewood Cliffs, NJ, 1991.
34. W. Brauer, K.-J. Lange, Non-deterministic two-tape automata are more powerful than deterministic ones, in: Symposium on Theoretical Aspects of Computer Science, Saarbrüchen, Germany, 1985, pp. 71-79.
35. J. Lloyd, Foundations of Logic Programming, 2nd Edition, Springer, Berlin, 1987.
36. M. Nykänen, E. Ukkonen, Finding paths with the right cost, in: C. Meinel, S. Tison (Eds.), Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science, Vol. 1563, Springer, Berlin, 1999, pp. 345-355.
37. M. Nykänen, E. Ukkonen, The exact path length problem. J. Algorithms 42 (1) (2002) 41-53.
38. K. Sohn, A. van Gelder, Termination detection in logic programs using argument sizes (extended abstract), in: ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, Denver, CO, 1991, pp. 216-226.
39. G. Grahne, M. Nykänen, Safety, translation and evaluation of Alignment Calculus, in: Advances in Databases and Information Systems, electronic Workshops in Computing, British Computer Society, St Petersburg, Russia, 1997, pp. 295-304, also available via http://www.ewic.org.uk.ewic/workshop/view.cfm/ADBIS-97.
40. P. Seshadri, M. Livny, R. Ramakrishnan, The case for enhanced abstract data types, in: Very Large Data Bases Conference, Athens, Greece, 1997, pp. 66-75.
41. R. Dybvig, The Scheme Programming Language: ANSI Scheme, 2nd Edition, Prentice-Hall, Englewood Cliffs, NJ, 1996.