In this paper. we utilize intervals for unknown values in incompleterelational databases.We usetablesto representunknown relations. First, we define three partial tuple types in a table to specify incompletenessrelationships among tuples of the sametable. For tuples of different tables, we distinguish between the caseswhere incompletenessare introduced at the relation level, tuple level or attribute-value level. And, basedon theserelationships among tuples in different tables, we present a family of incomplete relational databasemodels. tuples in the set of cubes (also called d-rectangles)are called candidate tuples for the tmknown tuple t, and exactly one of the points is the tmknown tuple. This approachallows database operations to be.transformedinto operations in Computational Geometry,leading to efficient operatorevaluations [OlaO 88a]. Following [ImiL 841we use the terminology that a table in the incomplete databaseenviromnent represents a relation some tuples of which are unknow...