A closed form for Datalog queries with integer order (preliminary version)

Authors:
Peter Z. Revesz
Affiliations:
-
Venue:
ICDT '90 Proceedings of the third international conference on database theory on Database theory
Year:
1990

Citing 0
Cited 7

On the representation of infinite temporal data and queries (extended abstract)

PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Pushing constraint selections

PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Finite representation of infinite query answers

ACM Transactions on Database Systems (TODS)
Finitely representable databases (extended abstract)

PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Modeling temporal primitives: back to basics

CIKM '97 Proceedings of the sixth international conference on Information and knowledge management
A Decompositional Approach for Computing Least Fixed-Pointsof Datalog Programs with Z-Counters

Constraints
Constraint Database Models Characterizing Timed Bisimilarity

PADL '01 Proceedings of the Third International Symposium on Practical Aspects of Declarative Languages

Quantified Score

Hi-index	0.00

Visualization

Abstract

The use of constraints within logic programming and within database languages promises interesting new applications. We show that Datalog queries with simple integer order constraints can be evaluated bottom-up in closed form over generalized databases.