|
|
|
@inproceedings{DBLP:conf/pods/MannilaR86,
author = {Heikki Mannila and
Kari-Jouko R{\"a}ih{\"a}},
title = {Test Data for Relational Queries},
booktitle = {Proceedings of the Fifth ACM SIGACT-SIGMOD Symposium on Principles
of Database Systems, March 24-26, 1986, Cambridge, Massachusetts},
publisher = {ACM},
year = {1986},
isbn = {0-89791-179-2},
pages = {217-223},
ee = {http://doi.acm.org/10.1145/6012.15415, db/conf/pods/MannilaR86.html},
crossref = {DBLP:conf/pods/86},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
BibTeX
An automatic technique for generating a comprehensive test database for a given query is studied. The test database is large enough to cover all essentially different situations under the given set of dependencies, and also large enough to illustrate the effect of each operation appearing in the query. On the other hand, the database attempts to do this in a minimal way. The method can be applied in the testing of queries, e.g. as an aid in learning a new query language.
The basis of the construction is the definition of an adequate test case. We characterize this concept using Armstrong relations and show that adequate examples have the desired properties. We also give a method for producing reasonably small example databases for select-project-join queries where each relation scheme appears at most once in the query.
Copyright © 1986 by the ACM, Inc., used by permission. Permission to make digital or hard copies is granted provided that copies are not made or distributed for profit or direct commercial advantage, and that copies show this notice on the first page or initial screen of a display along with the full citation.