Issue No. 03 - May/June (2001 vol. 13)

ISSN: 1041-4347

pp: 519-525

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/69.929906

ABSTRACT

<p><b>Abstract</b>—This paper develops a query language for sequence databases, such as genome databases and text databases. Unlike relational data, queries over sequential data can easily produce infinite answer sets since the universe of sequences is infinite, even for a finite alphabet. The challenge is to develop query languages that are both highly expressive and finite. This paper develops such a language as a subset of a logic for string databases called <it>Sequence Datalog</it>. The main idea is to use safe recursion to control and limit unsafe recursion. The main results are the definition of a finite form of recursion, called <it>domain-bounded recursion</it>, and a characterization of its complexity and expressive power. Although finite, the resulting class of programs is highly expressive since its data complexity is complete for the elementary functions.</p>

INDEX TERMS

Sequence databases, deductive databases, query languages, Datalog, termination, complexity.

CITATION

A. J. Bonner and G. Mecca, "Query Languages for Sequence Databases: Termination and Complexity," in

*IEEE Transactions on Knowledge & Data Engineering*, vol. 13, no. , pp. 519-525, 2001.

doi:10.1109/69.929906

CITATIONS