Hierarchy Encoding with Multiple Genes

Authors:
Martin Bommel;Ping Wang
Affiliations:
Department of Mathematics, Statistics, and Computer Science, St. Francis Xavier University, Antigonish, Canada B2G 2W5;Department of Mathematics, Statistics, and Computer Science, St. Francis Xavier University, Antigonish, Canada B2G 2W5
Venue:
DEXA '08 Proceedings of the 19th international conference on Database and Expert Systems Applications
Year:
2008

Citing 6
Cited 0

Efficient implementation of lattice operations

ACM Transactions on Programming Languages and Systems (TOPLAS)
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
Discrete Mathematical Structures

Discrete Mathematical Structures
A Space-and-Time-Efficient Coding Algorithm for Lattice Computations

IEEE Transactions on Knowledge and Data Engineering
Encoding multiple inheritance hierarchies for lattice operations

Data & Knowledge Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

Efficient implementation of type inclusion testing is important for data and knowledge base systems employing large hierarchies. The bit vector encoding of a partially ordered set representing a type hierarchy permits constant-time type inclusion testing. Current such methods employ a simple encoding, associating a single gene for each join-irreducible element. We present an algorithm using multiple genes for those elements with many siblings. The new algorithm provides a significant improvement on the encoding size for hierarchies with low multiple inheritance factors.