ATTENTION: The works hosted here are being migrated to a new repository that will consolidate resources, improve discoverability, and better show UTA's research impact on the global community. We will update authors as the migration progresses. Please see MavMatrix for more information.
Show simple item record
dc.contributor.advisor | Li, Chengkai | |
dc.creator | Chandwani, Tulsi | |
dc.date.accessioned | 2018-02-15T20:32:57Z | |
dc.date.available | 2018-02-15T20:32:57Z | |
dc.date.created | 2017-12 | |
dc.date.issued | 2017-12-07 | |
dc.date.submitted | December 2017 | |
dc.identifier.uri | http://hdl.handle.net/10106/27180 | |
dc.description.abstract | A database application takes input as user-defined queries and determines the program logic to be executed based on the
results returned by the queries. A change in existing application or a new application is expected pass through extensive
testing to cover the entire code and check all the cases possible in execution. Testing the code coverage of traditional or
CRUD-based applications is a straightforward process backed by various tools and libraries. Unlike traditional applications,
checking the code coverage of database applications is a complex procedure due to its inherent structure and the inputs passed
to it. Measuring the code coverage of such programs involves the participation of DBA’s to generate mock databases that can
epitomize the existing data and trigger as many paths in the program as possible. Recent studies have introduced techniques
to directly test the programs using the existing data. In this paper, we are comparing two methods of code coverage that will
help software engineers to test their database applications without being dependent on mock databases. We aim to evaluate
the performance of Baseline and Leaf Query approaches for testing such applications. Our work focuses on using decision
trees as database applications and testing them by using both the methods. The efficiency of each method is assessed on
several parameters by conducting experiments to understand the advantages and disadvantages of each technique. | |
dc.format.mimetype | application/pdf | |
dc.language.iso | en_US | |
dc.subject | Database applications | |
dc.subject | DSE | |
dc.subject | Baseline | |
dc.subject | Leaf Query | |
dc.subject | Decision trees | |
dc.title | Maximizing Code Coverage in Database Applications | |
dc.type | Thesis | |
dc.degree.department | Computer Science and Engineering | |
dc.degree.name | Master of Science in Computer Science | |
dc.date.updated | 2018-02-15T20:33:28Z | |
thesis.degree.department | Computer Science and Engineering | |
thesis.degree.grantor | The University of Texas at Arlington | |
thesis.degree.level | Masters | |
thesis.degree.name | Master of Science in Computer Science | |
dc.type.material | text | |
Files in this item
- Name:
- CHANDWANI-THESIS-2017.pdf
- Size:
- 464.5Kb
- Format:
- PDF
This item appears in the following Collection(s)
Show simple item record