Counter Machines and the Safety and Disjointness Problems for Database Queries with Linear Constraints

Oscar H. Ibarra (), Jianwen Su () and Constantinos Bartzis ()
Additional contact information
Oscar H. Ibarra: University of California, Department of Computer Science
Jianwen Su: University of California, Department of Computer Science
Constantinos Bartzis: University of California, Department of Computer Science

Chapter Chapter 11 in Where Mathematics, Computer Science, Linguistics and Biology Meet, 2001, pp 127-137 from Springer

Abstract: Abstract We give a brief review of some known decidability results concerning multi-counter machines. Using these results we show that safety and disjointness of database queries with linear integer constraints are decidable.

Keywords: Finite Automaton; Database Query; Conjunctive Query; Counter Machine; Universal Domain (search for similar items in EconPapers)
Date: 2001
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-94-015-9634-3_11

Ordering information: This item can be ordered from
http://www.springer.com/9789401596343

DOI: 10.1007/978-94-015-9634-3_11

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().