Efficient representation of taxonomies
In this paper, the use of the concepts of dimension and boolean dimension of partial orders is studied for what concerns the efficient representation of taxonomies. Under this approach, labelings of the nodes (linear extensions of partial orders) are used to answer efficiently to such queries as "Is element a related to element b?".
KeywordsPartial Order Rooted Tree Linear Extension Transitive Closure Maximal Chain
- [DM]B. Dushnik, E. Miller: Partially ordered sets, Amer. J. Math. 63 (1941), 600–610.Google Scholar
- [GNT]G. Gambosi, J. Nešetřil, M. Talamo: On locally presented posets, submitted to "Theoretical Computer Science".Google Scholar
- [KT]D. Kelly, W.T. Trotter: Dimension theory for ordered sets in Ordered sets, (I. Rival ed.), D. Reidel, Dordrecht, 171–211.Google Scholar
- [R]I. Rival: Linear extensions of finite ordered sets, Annals of Discrete Math. 23 (1984), 355–370.Google Scholar