Skip to main content
Article thumbnail
Location of Repository

On the decidability of termination of query evaluation in transitive-closure logics for polynomial constraint databases

By Floris Geerts and Bart Kuijpers
Topics: Data base theory, Constraint databases, Query languages, Query evaluation, Dynamical systems theory, Fixed points
Year: 2005
OAI identifier: oai:CiteSeerX.psu:10.1.1.135.9012
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://homepages.inf.ed.ac.uk/... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.