ACM Home Page
Please provide us with feedback. Feedback
An intensional approach to the specification of test cases for database applications
Full text PdfPdf (360 KB)
Source International Conference on Software Engineering archive
Proceedings of the 28th international conference on Software engineering table of contents
Shanghai, China
SESSION: Research papers: test & analysis I table of contents
Pages: 102 - 111  
Year of Publication: 2006
ISBN:1-59593-375-1
Authors
David Willmor  University of Manchester, Oxford Road, Manchester, UK
Suzanne M. Embury  University of Manchester, Oxford Road, Manchester, UK
Sponsors
ACM: Association for Computing Machinery
SIGSOFT: ACM Special Interest Group on Software Engineering
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 14,   Downloads (12 Months): 86,   Citation Count: 7
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1134285.1134301
What is a DOI?

ABSTRACT

When testing database applications, in addition to creating in-memory fixtures it is also necessary to create an initial database state that is appropriate for each test case. Current approaches either require exact database states to be specified in advance, or else generate a single initial state (under guidance from the user) that is intended to be suitable for execution of all test cases. The first method allows large test suites to be executed in batch, but requires considerable programmer effort to create the test cases (and to maintain them). The second method requires less programmer effort, but increases the likelihood that test cases will fail in non-fault situations, due to unexpected changes to the content of the database. In this paper, we propose a new approach in which the database states required for testing are specified intensionally, as constrained queries, that can be used to prepare the database for testing automatically. This technique overcomes the limitations of the other approaches, and does not appear to impose significant performance overheads.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
L. E. Bertossi and J. Chomicki. Query answering in inconsistent databases. In J. Chomicki, R. van der Meyden, and G. Saake, editors, Logics for Emerging Applications of Databases, pages 43--83. Springer, 2003.
3
 
4
L. Bravo and L. E. Bertossi. Logic programs for consistently querying data integration systems. In G. Gottlob and T. Walsh, editors, Proceedings of the 18th International Joint Conference on Artificial Intelligence (IJCAI), pages 10--15. Morgan Kaufmann, August 2003.
5
6
 
7
 
8
J. Chomicki and J. Marcinkowski. On the computational complexity of minimal-change integrity maintenance in relational databases. In L. E. Bertossi, A. Hunter, and T. Schaub, editors, Inconsistency Tolerance, volume 3300 of Lecture Notes in Computer Science, pages 119--150. Springer, 2005.
9
 
10
 
11
 
12
 
13
F. Haftmann, D. Kossmann, and A. Kreutz. Efficient regression tests for database applications. In Proceedings of the 2nd Biennial Conference on Innovative Data Systems Research (CIDR), pages 95--106. Online Proceedings, January 2005.
14
15
 
16
 
17
 
18
 
19
D. Willmor and S. M. Embury. Exploring test adequacy for database systems. In Proceedings of the 3rd UK Software Testing Research Workshop (UKTest), pages 123--133. The University of Sheffield, September 2005.
 
20

CITED BY  7

Collaborative Colleagues:
David Willmor: colleagues
Suzanne M. Embury: colleagues