Name
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 as a subset of a logic for string databases called Sequence Datalog. 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 domain-bounded recursion, 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. |
Year | DOI | Venue |
|---|---|---|
2001 | 10.1109/69.929906 | Knowledge and Data Engineering, IEEE Transactions |
Keywords | Field | DocType |
DATALOG,computational complexity,database theory,deductive databases,query languages,query processing,Sequence Datalog,complexity,deductive databases,domain-bounded recursion,genome databases,infinite answer sets,query languages,safe recursion,sequence databases,sequential data,string databases,termination,text databases | Query language,Programming language,Relational database,Computer science,Theoretical computer science,Mutual recursion,Database theory,Left recursion,Datalog,Recursion,Database,Computational complexity theory | Journal |
Volume | Issue | ISSN |
13 | 3 | 1041-4347 |
Citations | PageRank | References |
2 | 0.37 | 6 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Giansalvatore Mecca | 1 | 1840 | 396.38 |
| Anthony J. Bonner | 2 | 733 | 422.63 |