Idioma:

A closed-form evaluation for Datalog queries with integer (gap)-order constraints

Revesz, Peter Z.

Theoretical computer science, 1993-08, Vol.116 (1), p.117-149 [Periódico revisado por pares]

Texto completo disponível

Citações Citado por

Título:
A closed-form evaluation for Datalog queries with integer (gap)-order constraints
Autor: Revesz, Peter Z.
Assuntos: Applied sciences ; Computer science; control theory; systems ; Exact sciences and technology ; Information systems. Data bases ; Memory organisation. Data processing ; Software
É parte de: Theoretical computer science, 1993-08, Vol.116 (1), p.117-149
Descrição: We provide a generalization of Datalog based on generalizing databases by adding integer order constraints to relational tuples. For Datalog queries with integer (gap)-order constraints (denoted as Datalog < z ), we show that there is a closed-form evaluation. We also show that the tuple recognition problem can be done in PTIME in the size of the generalized database, assuming that the size of the constants in the query is logarithmic in the size of the database. Note that the absence of negation in critical, Datalog ¬ queries with integer order constraints can express any Turing-computable function.
Editor: Amsterdam: Elsevier B.V
Idioma: Inglês

Links

Voltar para lista de resultados

Anterior Resultado 3 Avançar Ir para próxima página