Fast algorithms for finding nearest common ancestors
SIAM Journal on Computing
On finding lowest common ancestors: simplification and parallelization
SIAM Journal on Computing
The anatomy of a large-scale hypertextual Web search engine
WWW7 Proceedings of the seventh international conference on World Wide Web 7
WWW '99 Proceedings of the eighth international conference on World Wide Web
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Data structures for weighted matching and nearest common ancestors with linking
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Data on the Web: from relations to semistructured data and XML
Data on the Web: from relations to semistructured data and XML
Informative Labeling Schemes for Graphs
Informative Labeling Schemes for Graphs
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Labeling schemes for flow and connectivity
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Improved labeling scheme for ancestor queries
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
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
Short and Simple Labels for Small Distances and Other Functions
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Labeling Schemes for Dynamic Tree Networks
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Efficiently mining frequent trees in a forest
Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
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
A Prime Number Labeling Scheme for Dynamic Ordered XML Trees
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
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
On the Sequencing of Tree Structures for XML Indexing
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Incremental maintenance for materialized XPath/XSLT views
WWW '05 Proceedings of the 14th international conference on World Wide Web
Efficiently Mining Frequent Trees in a Forest: Algorithms and Applications
IEEE Transactions on Knowledge and Data Engineering
An access control method based on the prefix labeling scheme for XML repositories
ADC '05 Proceedings of the 16th Australasian database conference - Volume 39
QED: a novel quaternary encoding to completely avoid re-labeling in XML updates
Proceedings of the 14th ACM international conference on Information and knowledge management
Supporting complex queries on multiversion XML documents
ACM Transactions on Internet Technology (TOIT)
Oracle size: a new measure of difficulty for communication tasks
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Integrating document and data retrieval based on XML
The VLDB Journal — The International Journal on Very Large Data Bases
Dynamic labeling schemes for ordered XML based on type information
ADC '06 Proceedings of the 17th Australasian Database Conference - Volume 49
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
Efficient updates in dynamic XML data: from binary string to quaternary string
The VLDB Journal — The International Journal on Very Large Data Bases
Trade-offs between the size of advice and broadcasting time in trees
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Efficient maintenance techniques for views over active documents
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
On randomized representations of graphs using short labels
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
A bi-labeling based XPath processing system
Information Systems
As Good as It Gets: Competitive Fault Tolerance in Network Structures
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
An Optimal Labeling for Node Connectivity
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Labeling schemes for vertex connectivity
ACM Transactions on Algorithms (TALG)
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
Communication algorithms with advice
Journal of Computer and System Sciences
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
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
DISC'10 Proceedings of the 24th international conference on Distributed computing
SIAM Journal on Computing
An efficient scheme to completely avoid re-labeling in XML updates
WISE'06 Proceedings of the 7th international conference on Web Information Systems
Short labels by traversal and jumping
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Compact encodings for all local path information in web taxonomies with application to wordnet
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
HID: an efficient path index for complex XML collections with arbitrary links
DNIS'05 Proceedings of the 4th international conference on Databases in Networked Information Systems
A dynamic implicit adjacency labelling scheme for line graphs
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
An improved prefix labeling scheme: a binary string approach for dynamic ordered XML
DASFAA'05 Proceedings of the 10th 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
Compact separator decompositions in dynamic trees and applications to labeling schemes
DISC'07 Proceedings of the 21st international conference on Distributed Computing
Labeling schemes for vertex connectivity
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
An efficient encoding and labeling scheme for dynamic XML data
DEXA'07 Proceedings of the 18th international conference on Database and Expert Systems Applications
Temporal and multi-versioned XML documents: A survey
Information Processing and Management: an International Journal
| Hi-index | 0.00 |
We consider the following problem. Give a rooted tree T, label the nodes of T in the most compact way such that given the labels of two nodes one can determine in constant time, by looking only at the labels, if one node is an ancestor of the other. The best known labeling scheme is rather straightforward and uses labels of size at most 2 log n, where n is the number of vertices In the tree. Our main result in this paper is a labeling scheme with maximum label size close to 3/2 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 size are important.There are no lower bounds known for this problem except for an obvious lower bound of log n that follows from the fact that different vertices must have different labels. The question whether one can find even shorter labels remains an intriguing open question.