Improved compact routing schemes for dynamic trees
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Engineering Tree Labeling Schemes: A Case Study on Least Common Ancestors
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Prefix based numbering schemes for XML: techniques, applications and performances
Proceedings of the VLDB Endowment
Note: A note on models for graph representations
Theoretical Computer Science
DDE: from dewey to a fully dynamic XML labeling scheme
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
On randomized representations of graphs using short labels
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
Labeling schemes for vertex connectivity
ACM Transactions on Algorithms (TALG)
Shorter implicit representation for planar graphs and bounded treewidth graphs
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Distributed relationship schemes for trees
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
An optimal ancestry scheme and small universal posets
Proceedings of the forty-second ACM symposium on Theory of computing
Compact ancestry labeling schemes for XML trees
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
On enhancing scalability for distributed RDF/S stores
Proceedings of the 14th International Conference on Extending Database Technology
SIAM Journal on Computing
Short labels by traversal and jumping
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Journal of Parallel and Distributed Computing
Efficient label encoding for range-based dynamic XML labeling schemes
DASFAA'10 Proceedings of the 15th international conference on Database Systems for Advanced Applications - Volume Part I
Compact separator decompositions in dynamic trees and applications to labeling schemes
DISC'07 Proceedings of the 21st international conference on Distributed Computing
A dynamic labeling scheme using vectors
DEXA'07 Proceedings of the 18th international conference on Database and Expert Systems Applications
| Hi-index | 0.00 |
We consider the following problem. Given a rooted tree $T$, label the nodes of $T$ in the most compact way such that, given the labels of two nodes $u$ and $v$, one can determine in constant time, by looking only at the labels, whether $u$ is ancestor of $v$. The best known labeling scheme is rather straightforward and uses labels of length at most $2\log_2 n$ bits each, where $n$ is the number of nodes in the tree. Our main result in this paper is a labeling scheme with maximum label length $\log_2 n + \Oh(\sqrt{\log n})$. Our motivation for studying this problem is enhancing the performance of web search engines. In the context of this application each indexed document is a tree, and the labels of all trees are maintained in main memory. Therefore even small improvements in the maximum label length are important.