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. It is a subset of a recently developed logic called Sequence Datalog. Sequence Datalog distinguishes syntactically between subsequence extraction and sequence construction: extraction creates sequences of bounded length, and leads so safe recursion, while construction can create sequences of arbitrary length, and can lead to unsafe recursion. In this paper, we develop syntactic restrictions for Sequence Datalog that allow sequence construction but preserve finiteness. The main idea is to use safe recursion to control and limit unsafe recursion. The main results are a finite language, called Weakly Constructive Sequence Datalog, and a characterization of its complexity and expressive poewer. Although finite, the new language is highly expressive, since its data complexity is complete for the elementary functions.

Finite Query Languages for Sequence Databases

MECCA, Giansalvatore;
1995

Abstract

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. It is a subset of a recently developed logic called Sequence Datalog. Sequence Datalog distinguishes syntactically between subsequence extraction and sequence construction: extraction creates sequences of bounded length, and leads so safe recursion, while construction can create sequences of arbitrary length, and can lead to unsafe recursion. In this paper, we develop syntactic restrictions for Sequence Datalog that allow sequence construction but preserve finiteness. The main idea is to use safe recursion to control and limit unsafe recursion. The main results are a finite language, called Weakly Constructive Sequence Datalog, and a characterization of its complexity and expressive poewer. Although finite, the new language is highly expressive, since its data complexity is complete for the elementary functions.
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/11563/10555
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? ND
social impact