Semantic complexity of classes of relational queries and query independent data partitioning
Shaibal Roy · 1991
We introduce a measure of the semantic complexity of classes of selection queries in relational databases.This measure allows us to extend certain probabilistic bounds hitherto provable only for individual queries to an entire class of queries.Two applications follow immediately from well known results in the theory of