A new definition of complex objects is introduced which provides a denotation for incomplete tuples as well as partially described sets. Set values are "sandwiched" between "complete" and "consistent" descriptions (representing the Smyth and Hoare powerdomains respectively), allowing the maximal values to be arbitrary subsets of maximal elements in the domain of the set. We also examine the use of rules in defining queries over such objects.
|Title of host publication||PODS '88 Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems|
|Number of pages||10|
|Publication status||Published - 1 Mar 1988|