Adding string processing capabilities to data management systems

Proceedings - 7th International Symposium on String Processing and Information Retrieval, SPIRE 2000

Volumn , Issue , 2000, Pages 122-131

  Hakli, R ^a   Nykanen M ^a   Tamm, H ^a  

^a UNIVERSITY OF HELSINKI   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

DATA HANDLING; INFORMATION RETRIEVAL SYSTEMS; MOLECULAR BIOLOGY; PROCESSING; QUERY PROCESSING; SEARCH ENGINES;

APPLICATION AREA; COMPUTATIONAL MOLECULAR BIOLOGY; DATA MANAGEMENT SYSTEM; STRING PROCESSING;

INFORMATION MANAGEMENT;

EID: 0013186689     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SPIRE.2000.878187     Document Type: Conference Paper

References (36)

1. S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison-Wesley, 1995.
2. H. Aït-Kaci. Warren's Abstract Machine: a Tutorial Reconstruction. The MIT Press, 1991.
3. A. Bonner and G. Mecca. Sequences, Datalog and transducers. Journal of Computer and System Sciences, 57(3):234-259, 1998.
4. A. Bonner and G. Mecca. Querying sequence databases with transducers. Acta Informatica, 36:511-544, 2000.
5. T. Coupaye. Wrapping SRS with CORBA: from textual data to distributed objects. Bioinformatics, 15(4):333-338, 1999.
6. C. Date and H. Darwen. Foundation for Object/Relational Databases - The Third Manifesto. Addison-Wesley, 1998.
7. S. Ganguly and M. Noordewier. PROXIMAL: a database system for the efficient retrieval of genetic information. Computers in Biology and Medicine, 26(3):199-207, 1996.
8. S. Ginsburg and X. Wang. Regular sequence operations and their use in database queries. Journal of Computer and System Sciences, 56(1):1-26, 1998.
9. G. Grahne, R. Hakli, M. Nykänen, and E. Ukkonen. AQL: An alignment based query language for querying string databases. In C. Prabhu, editor, Databases for the Millennium 2000: Proceedings of the Ninth International Conference on Management of Data (COMAD'98), pages 235-251. Tata McGraw-Hill Publishing Company Limited, 1998.
10. G. Grahne and M. Nykänen. Safety, translation and evaluation of Alignment Calculus. In Advances in Databases and Information Systems, electronic Workshops in Computing, pages 295-304. British Computer Society, 1997. 'http://www.ewic.org.uk/ewic/workshop/view.cfm/ADBIS-97'.
11. G. Grahne, M. Nykänen, and E. Ukkonen. Reasoning about strings in databases. Journal of Computer and System Sciences, 59:116-162, 1999.
12. G. Grahne and E. Waller. How to make SQL stand for String Query Language. In International Workshop on Database Programming Languages, 1999.
13. D. Gusfield. Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. Cambridge University Press, 1997.
14. R. Hakli, M. Nykänen, and H. Tamm. A declarative programming system for manipulating strings. In Sixth Fenno-Ugric Symposium on Software Technology, pages 29-40, 1999.
15. R. Hakli, M. Nykänen, H. Tamm, and E. Ukkonen. Implementing a declarative string query language with string restructuring. In G. Gupta, editor, First International Workshop on Practical Aspects of Declarative Languages (PADL'99), volume 1551 of Lecture Notes in Computer Science, pages 179-195. Springer-Verlag, Jan. 1999.
16. C. Helgesen and P. Sibbald. PALM - a pattern language for molecular biology. In International Conference on Intelligent Systems in Molecular Biology, pages 172-180, 1993.
17. I. Hopcroft and J. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, 1979.
18. M. Jaedicke and B. Mitschang. User-defined table operators: Enhancing extensibility for ORDBMS. In Very Large Data Bases Conference, pages 494-505, 1999.
19. S. Kosaraju. Decidability of reachability in vector addition systems. In ACM Symposium on Theory of Computing, pages 267-281, 1982.
20. F. Lefebvre. A grammar-based unification of several alignment and folding algorithms. In International Conference on Intelligent Systems in Molecular Biology, pages 143-155, 1996.
21. J. Lloyd. Foundations of Logic Programming. Springer-Verlag, 2nd edition, 1987.
22. E. Mayr. An algorithm for the general Petri net reachability problem. SIAM Journal on Computing, 13(3):441-460, 1984.
23. M. Nykänen. Using acceptors as transducers. In J.-M. Champarnaud, D. Maurel, and D. Ziadi, editors, Third International Workshop on Implementing Automata (WIA'98), volume 1660 of Lecture Notes in Computer Science, pages 133-148. Springer-Verlag, Sept. 1999.
24. M. Nykänen. Using acceptors as transducers. To appear in the forthcoming Theoretical Computer Science special section on WIA'98, 2000.
25. M. Nykänen and E. Ukkonen. Finding paths with the right cost. In C. Meinel and S. Tison, editors, Symposium on Theoretical Aspects of Computer Science, volume 1563 of Lecture Notes in Computer Science, pages 345-355, 1999.
26. P. Pistor and R. Traunmüller. A database language for sets, lists and tables. Information Systems, 11(4):323-336, 1986.
27. 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.), 1999.
28. J. Richardson. Supporting lists in a data model (a timely approach). In Very Large Data Bases Conference, pages 127-138, 1992.
29. J. Rumbaugh, M. Blaha, W. Premerlani, F. Eddy, and W. Lorensen. Object-Oriented Modeling and Design. Prentice-Hall, 1991.
30. D. Searls. String Variable Grammar: A logic grammar formalism for the biological language of DNA. Journal of Logic Programming, pages 73-102, 1995.
31. D. Searls and K. Murphy. Automata-theoretic models of mutation and alignment. In International Conference on Intelligent Systems in Molecular Biology, pages 341-349, 1995.
32. P. Seshadri, M. Livny, and R. Ramakrishnan. SEQ: A model for sequence databases. In IEEE International Conference on Data Engineering, pages 232-239, 1995.
33. P. Seshadri, M. Livny, and R. Ramakrishnan. The case for enhanced abstract data types. In Very Large Data Bases Conference, pages 66-75, 1997.
34. K. Sohn and A. van Gelder. Termination detection in logic programs using argument sizes (extended abstract). In ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pages 216-226, 1991.
35. B. Subramanian, T. Leung, S. Vandenberg, and S. Zdonik. The AQUA approach to querying lists and trees in object-oriented databases. In IEEE International Conference on Data Engineering, pages 80-89, 1995.
36. P. Wolper. Temporal logic can be more expressive. Information and Control, 56:72-99, 1983.