On conjunctive queries containing inequalities
Journal of the ACM (JACM)
Solving satisfiability and implication problems in database systems
ACM Transactions on Database Systems (TODS)
CoBase: a scalable and extensible cooperative information system
Journal of Intelligent Information Systems - Special issue on intelligent integration of information
Static analysis in datalog extensions
Journal of the ACM (JACM)
Symbolic Logic and Mechanical Theorem Proving
Symbolic Logic and Mechanical Theorem Proving
Checking Consistency of Database Constraints: a Logical Basis
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
Implementation of Two Semantic Query Optimization Techniques in DB2 Universal Database
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Automatic Generation of Database Instances for White-box Testing
COMPSAC '01 Proceedings of the 25th International Computer Software and Applications Conference on Invigorating Software Development
Semantic Errors in SQL Queries: A Quite Complete List
QSIC '04 Proceedings of the Quality Software, Fourth International Conference
Using an SQL coverage measurement for testing database applications
Proceedings of the 12th ACM SIGSOFT twelfth international symposium on Foundations of software engineering
Semantic errors in SQL queries: A quite complete list
Journal of Systems and Software - Special issue: Quality software
Information and Software Technology
Squash: A Tool for Analyzing, Tuning and Refactoring Relational Database Applications
Applications of Declarative Programming and Knowledge Management
BNCOD 26 Proceedings of the 26th British National Conference on Databases: Dataspace: The Final Frontier
Repairing OLAP queries in databases with referential integrity errors
DOLAP '10 Proceedings of the ACM 13th international workshop on Data warehousing and OLAP
| Hi-index | 0.00 |
Many programs need to access data in a relational database. This is usually done by means of queries written in SQL. Although the language SQL is declarative, certain runtime errors are possible. Since the occurrence of these errors depend on the data, they are not easily found during testing. The question whether a query is safe can be reduced to a consistency check. It is well known that consistency is in general undecidable, and that this applies also to SQL queries. However, in this paper, we propose a consistency check that can handle a surprisingly large subset of SQL (it uses Skolemization with sorted Skolem functions, and a few other tricks). This consistency check is also the basis for generating other semantic warnings. Furthermore, it can be used to generate test data for SQL queries.