Issue No. 04 - December (1990 vol. 2)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/69.63254
<p>The evaluability of queries on a statistical database containing joinable tables connected by an intersection hypergraph is considered. A characterization of evaluable queries is given, which allows one to define polynomial-time procedures both for testing evaluability and for evaluating queries. These results are useful in designing an 'informed query system' for statistical databases which promotes an integrated use of stored information. Such a query system allows the user to formulate a query involving attributes from several joinable tables as if they were all contained in a single universal table.</p>
query evaluability; statistical databases; joinable tables; intersection hypergraph; evaluable queries; polynomial-time procedures; informed query system; integrated use; stored information; universal table; database management systems; database theory; graph theory; information retrieval systems; statistical analysis
F. Malvestuto and M. Moscarini, "Query Evaluability in Statistical Databases," in IEEE Transactions on Knowledge & Data Engineering, vol. 2, no. , pp. 425-430, 1990.