OEH is a unified index that supports subsumption order-testing and index-resident monoid roll-up on poset hierarchies via nested-set embeddings for trees or chain decomposition for low-width DAGs.
In: Proceedings of the ACM SIGMOD Inter- national Conference on Management of Data, SIGMOD 2011, Athens, Greece, June 12-16
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
Algorithms based on path and channel decomposition for reachability-focused hierarchical drawings of directed graphs, with experiments on bends, crossings, and clarity, running in O(kn+m) time.
citing papers explorer
-
One Index for Subsumption and Roll-up across Time, Geography, and Ontology
OEH is a unified index that supports subsumption order-testing and index-resident monoid roll-up on poset hierarchies via nested-set embeddings for trees or chain decomposition for low-width DAGs.
-
Adventures in Abstraction: Reachability in Hierarchical Drawings
Algorithms based on path and channel decomposition for reachability-focused hierarchical drawings of directed graphs, with experiments on bends, crossings, and clarity, running in O(kn+m) time.