A graphical query language supporting recursion
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
Efficient implementation of lattice operations
ACM Transactions on Programming Languages and Systems (TOPLAS)
CLASSIC: a structural data model for objects
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
Efficient management of transitive relationships in large data and knowledge bases
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
Efficient handling of multiple inheritance hierarchies
OOPSLA '93 Proceedings of the eighth annual conference on Object-oriented programming systems, languages, and applications
The object data standard: ODMG 3.0
The object data standard: ODMG 3.0
Discrete Mathematical Structures
Discrete Mathematical Structures
A Space-and-Time-Efficient Coding Algorithm for Lattice Computations
IEEE Transactions on Knowledge and Data Engineering
Minimal representation of type-hierarchies
AIKED'08 Proceedings of the 7th WSEAS International Conference on Artificial intelligence, knowledge engineering and data bases
Hierarchy Encoding with Multiple Genes
DEXA '08 Proceedings of the 19th international conference on Database and Expert Systems Applications
A completeness analysis of frequent weighted concept lattices and their algebraic properties
Data & Knowledge Engineering
| Hi-index | 0.00 |
Incremental updates to multiple inheritance hierarchies are becoming more prevalent with the increasing number of persistent applications supporting complex objects. Efficient computation of the lattice operations greatest lower bound (GLB), least upper bound (LUB), and subsumption is critical. Techniques for the compact encoding of a hierarchy are required that support the operations. One method is to plunge the given ordering into a Boolean lattice of binary words, and perform lattic operations via Boolean operators. An overview of the approach is given and several methods are examined and compared. A new method is proposed, based on the top-down encoding of Caseau but without the lattice completion requirement, which permits incremental updates to the hierarchy to add nodes at the leaves. The algorithm requires polynomial time and space for encoding, and supports efficient lattice computations in applications where the classes of objects are stored as codes. Experimental results illustrate its effectiveness, and an analysis is provided on the effect of the order of insertion on the encoding.