Implementing a declarative string query language with string restructuring

6Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We describe the design and implementation of a declarative database query language for manipulating character strings. The language can be used to create logical predicates expressing structural properties of strings and relations between several strings. The predicates can be used to query strings in databases, and by leaving variables uninstan-tiated, also to generate new strings not contained in the database. A full working system was implemented as an extension of an object-oriented database management system and its query language. The declarative expressions are evaluated by first performing a compilation transforming them to nondeterministic finite state automata and then by simulating these automata using a depth-first search engine. The system checks the safety of each string-manipulation query in advance to preclude infinite ones. This safety checking provides also a compile-time loop-checking mechanism for the search engine, improving its efficiency. © Springer-Verlag Berlin Heidelberg 1998.

Cite

CITATION STYLE

APA

Hakli, R., Nykanen, M., Tamm, H., & Ukkonen, E. (1999). Implementing a declarative string query language with string restructuring. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1551 LNCS, pp. 179–195). https://doi.org/10.1007/3-540-49201-1_13

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free