Göm menyn
Files: Description Format
Fulltext PDF (requires Acrobat Reader)
Fulltext part 1 PostScript (requires a PostScript Reader)
  Fulltext part 2 PostScript (requires a PostScript Reader)
   
Authors: M.F. van Bommel and T.J. Beck
Article title: Incremental Encoding of Multiple Inheritance Hierarchies Supporting Lattice Operations
Publ. type: Article
Volume: 5
Article No: 1
Language: English
Abstract [en]: Incremental updates to multiple inheritance hierachies are becoming more prevalent with the increasing number of persistent applications supporting complex objects. Efficient computation of lattice operations such as greatest lower bound (GLB), least upper bound (LUB), and subsumption subsequently is becoming more and more important. General techniques for compact encoding of a hierarchy are presented that support the operations, and are flexible enough to allow incremental updates to the hierarchy. One such method is to plunge the given ordering into a boolean lattice of binary words, leading to an almost constant time complexity of the lattice operations. The method is based on an inverted version of the encoding of Aït-Kaci et al. to allow incremental update. Simple grouping is used to reduce the code space while keeping the lattice operations efficient. Comparisons are made to an incremental version of the range compression scheme of Agrawal et al., where each class is assigned an interval, and relationships are based on containment in the interval. The result is two incoding methods which have their relative merits.
Publisher: LINKÖPING University Electronic Press
Year: 2000
Available: 2000-12-05
No. of pages: 11
Series: LINKÖPING Electronic Articles in Computer and Information Science
ISSN: 1401-9841
Note: First posting 2000-03-08 in ETAI area "Concept Based Knowledge Representation"


Responsible for this page: Peter Berkesand
Last updated: 2017-02-21