论文信息 - Counter machines and the safety and disjointness problems for database queries with linear constraints

Counter machines and the safety and disjointness problems for database queries with linear constraints

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.

Oscar H. Ibarra | Jianwen Su | Constantinos Bartzis

[1] E. F. Codd,et al. A relational model of data for large shared data banks , 1970, CACM.

[2] Oscar H. Ibarra,et al. Reversal-Bounded Multicounter Machines and Their Decision Problems , 1978, JACM.

[3] Brenda S. Baker,et al. Reversal-Bounded Multipushdown Machines , 1974, J. Comput. Syst. Sci..

[4] S. Ginsburg,et al. Bounded -like languages , 1964 .

[5] Rohit Parikh,et al. On Context-Free Languages , 1966, JACM.

[6] Eitan M. Gurari,et al. The Complexity of Decision Problems for Finite-Turn Multicounter Machines , 1981, J. Comput. Syst. Sci..

[7] Oscar H. Ibarra,et al. A Technique for Proving Decidability of Containment and Equivalence of Linear Constraint Queries , 1999, J. Comput. Syst. Sci..

[8] Serge Abiteboul,et al. Foundations of Databases , 1994 .

[9] S. Ginsburg,et al. BOUNDED ALGOL-LIKE LANGUAGES^) , 1964 .

[10] Jianwen Su,et al. Finitely Representable Databases , 1997, J. Comput. Syst. Sci..