Safety of recursive Horn clauses with infinite relations
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Principles of database and knowledge-base systems, Vol. I
Principles of database and knowledge-base systems, Vol. I
Pattern matching by Rs-operations: towards a unified approach to querying sequenced data
PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On the lengths of values in a finite transducer
Acta Informatica
Safety and translation of calculus queries with scalar functions
PODS '93 Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Pattern matching by RS-operations: towards a unified approach to querying sequenced data
Pattern matching by RS-operations: towards a unified approach to querying sequenced data
Reasoning about strings in databases
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Sequences, Datalog and transducers
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A framework for testing safety and effective computability
Journal of Computer and System Sciences
Reasoning about strings in databases
Journal of Computer and System Sciences
Principles of Database and Knowledge-Base Systems: Volume II: The New Technologies
Principles of Database and Knowledge-Base Systems: Volume II: The New Technologies
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Introduction to Database Systems
Introduction to Database Systems
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The AQUA Approach to Querying Lists and Trees in Object-Oriented Databases
ICDE '95 Proceedings of the Eleventh International Conference on Data Engineering
SEQ: A Model for Sequence Databases
ICDE '95 Proceedings of the Eleventh International Conference on Data Engineering
VISUAL: A Graphical Icon-Based Query Language
ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
PALM - A Pattern Language for Molecular Biology
Proceedings of the 1st International Conference on Intelligent Systems for Molecular Biology
A Grammar-Based Unification of Several Alignment and Folding Algorithms
Proceedings of the Fourth International Conference on Intelligent Systems for Molecular Biology
Supporting Lists in a Data Model (A Timely Approach)
VLDB '92 Proceedings of the 18th International Conference on Very Large Data Bases
Optimization of Queries with User-defined Predicates
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Checking automata and one-way stack languages
Journal of Computer and System Sciences
String operations in query languages
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Using acceptors as transducers
Theoretical Computer Science
Journal of Algorithms
Implementing a Declarative String Query Language with String Restructuring
PADL '99 Proceedings of the First International Workshop on Practical Aspects of Declarative Languages
How to Make SQL Stand for String Query Language
DBPL '99 Revised Papers from the 7th International Workshop on Database Programming Languages: Research Issues in Structured and Semistructured Database Programming
Design and implementation of a string database query language
Information Systems - Special issue: Data management in bioinformatics
Finding paths with the right cost
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
| Hi-index | 0.00 |
In this paper we pursue the study of Alignment Calculus, a declarative string database query language that supports both string querying and restructuring. This language is aimed for applications such as molecular biology databases, where the basic data type is a string, and the queries are combinatorial in nature. The declarative nature of our language does, however, require some additional effort in its implementation. Here we solve this problem by first defining a domain independent syntactic subset of the full language and then developing a query evaluation mechanism for this sublanguage. This mechanism then handles the required restructuring operations in a finite manner.