Maintaining order in a generalized linked list
Acta Informatica
Implicit representation of graphs
SIAM Journal on Discrete Mathematics
Ambivalent Data Structures for Dynamic 2-Edge-Connectivity and k Smallest Spanning Trees
SIAM Journal on Computing
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Compact labeling schemes for ancestor queries
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Labeling schemes for flow and connectivity
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
A comparison of labeling schemes for ancestor queries
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Minimizing Diameters of Dynamic Trees
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A comparison of labeling schemes for ancestor queries
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Nearest common ancestors: a survey and a new distributed algorithm
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
Labeling schemes for small distances in trees
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Improved Compact Routing Scheme for Chordal Graphs
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
An Additive Stretched Routing Scheme for Chordal Graphs
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
ViST: a dynamic index method for querying XML data by tree structures
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Compact and localized distributed data structures
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
BLAS: an efficient XPath processing system
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
On-the-fly maintenance of series-parallel relationships in fork-join multithreaded programs
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Dynamically Updating XML Data: Numbering Scheme Revisited
World Wide Web
On the Sequencing of Tree Structures for XML Indexing
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
LSDX: a new labelling scheme for dynamically updating XML data
ADC '05 Proceedings of the 16th Australasian database conference - Volume 39
Indexing XML documents for XPath query processing in external memory
Data & Knowledge Engineering - Special issue: ER 2003
Labeling schemes for weighted dynamic trees
Information and Computation
Dynamic Labelling Scheme for XML Data Processing
OTM '08 Proceedings of the OTM 2008 Confederated International Conferences, CoopIS, DOA, GADA, IS, and ODBASE 2008. Part II on On the Move to Meaningful Internet Systems
A bi-labeling based XPath processing system
Information Systems
An Optimal Labeling for Node Connectivity
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Labeling schemes for weighted dynamic trees
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
An optimal ancestry scheme and small universal posets
Proceedings of the forty-second ACM symposium on Theory of computing
An optimal labeling scheme for workflow provenance using skeleton labels
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
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
The tree inclusion problem: In linear space and faster
ACM Transactions on Algorithms (TALG)
Labeling recursive workflow executions on-the-fly
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Exploit sequencing to accelerate XML twig query answering
DASFAA'06 Proceedings of the 11th international conference on Database Systems for Advanced Applications
General compact labeling schemes for dynamic trees
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Constructing labeling schemes through universal matrices
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Labeling workflow views with fine-grained dependencies
Proceedings of the VLDB Endowment
Labeling schemes for vertex connectivity
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
| Hi-index | 0.01 |
We present a labeling scheme for rooted trees that supports ancestor queries. Given a tree, the scheme assigns to each node a label which is a binary string. Given the labels of any two nodes u and v, it can in constant time be determined whether u is ancestor to v alone from these labels. For trees of size n our scheme assigns labels of size bounded by log n + O(√log n) bits to each node. This improves a recent result of Abiteboul, Kaplan and Milo at SODA'01, where a labeling scheme with labels of size 3/2log n + O(log log n) was presented. The problem is among other things motivated in connection with efficient representation of information for XML-based search engines for the internet.