A query language and optimization techniques for unstructured data
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
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
Data on the Web: from relations to semistructured data and XML
Data on the Web: from relations to semistructured data and XML
Uniform Random Generation of Balanced Parenthesis Strings
ACM Transactions on Programming Languages and Systems (TOPLAS)
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
Improved labeling scheme for ancestor queries
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Improved labeling scheme for ancestor queries
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
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
On labeling schemes for the semantic web
WWW '03 Proceedings of the 12th international conference on World Wide Web
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
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
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
On the Sequencing of Tree Structures for XML Indexing
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Query translation from XPATH to SQL in the presence of recursive DTDs
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Stack-based algorithms for pattern matching on DAGs
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Exploiting native XML indexing techniques for XML retrieval in relational database systems
Proceedings of the 7th annual ACM international workshop on Web information and data management
Supporting complex queries on multiversion XML documents
ACM Transactions on Internet Technology (TOIT)
Journal of Algorithms
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
Dynamic interval-based labeling scheme for efficient XML query and update processing
Journal of Systems and Software
Indexing temporal XML documents
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Temporal XML: modeling, indexing, and query processing
The VLDB Journal — The International Journal on Very Large Data Bases
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
On randomized representations of graphs using short labels
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
An Optimal Labeling for Node Connectivity
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Journal of Algorithms
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
An optimal ancestry scheme and small universal posets
Proceedings of the forty-second ACM symposium on Theory of computing
Exploring XML web collections with DescribeX
ACM Transactions on the Web (TWEB)
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
Labeling recursive workflow executions on-the-fly
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
An efficient scheme to completely avoid re-labeling in XML updates
WISE'06 Proceedings of the 7th international conference on Web Information Systems
Labeling scheme and structural joins for graph-structured XML data
APWeb'05 Proceedings of the 7th Asia-Pacific web conference on Web Technologies Research and Development
Subgraph join: efficient processing subgraph queries on graph-structured XML document
WAIM'05 Proceedings of the 6th international conference on Advances in Web-Age Information Management
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
Fast computation of reachability labeling for large graphs
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
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
Dynamic range labeling for XML trees
EDBT'04 Proceedings of the 2004 international conference on Current Trends in Database Technology
General compact labeling schemes for dynamic trees
DISC'05 Proceedings of the 19th international conference on Distributed Computing
XMask: an enabled XML management system
ADVIS'06 Proceedings of the 4th international conference on Advances in Information Systems
Constructing labeling schemes through universal matrices
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Labeling schemes for vertex connectivity
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
| Hi-index | 0.00 |
Motivated by a recent application in XML search engines we study the problem of labeling the nodes of a tree (XML file) such that given the labels of two nodes one can determine whether one node is an ancestor of the other. We describe several new prefix-based labeling schemes, where an ancestor query roughly amounts to testing whether one label is a prefix of the other. We compare our new schemes to a simple interval-based scheme currently used by search engines, as well as, to schemes with the best theoretical guarantee on the maximum label length. We performed our experimental evaluation on real XML data and on some families of random trees.