Efficient data retrieval and manipulation using Boolean entity lattice

摘要

This paper proposes a technique to organize the database such that retrievals and manipulations will be operated on a subset instead of the whole entity set. The conceptual partitioning lattice and the Boolean partitioning lattice of an entity set are introduced as basic concepts. A technique is presented for determining all descendant atoms (subsets) of a given entity set. It is demonstrated that using the Boolean lattice to describe the structure between entity subsets is better than using an ordinary lattice. It is also demonstrated that using the Boolean lattice to organize a database can make data manipulation and retrieval operations more efficient.