Labeling Dynamic XML Trees

DOI10.1137/070687633MaRDI QIDQ3053159zbMATH OpenOpenAlexFDO

Authors Edith Cohen, Haim Kaplan, Tova Milo

Publication date 4 November 2010

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/070687633

zbMATH Keywords

ancestor querieslabeling schemesupdatesXML

Mathematics Subject Classification ID

Database theory (68P15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Efficient labeling scheme for dynamic XML trees
• scientific article; zbMATH DE number 2086375
• Labeling schemes for dynamic tree networks
• Compact ancestry labeling schemes for XML trees
• Distributed Computing – IWDC 2005
• Labeling schemes for tree representation
• Labeling schemes for weighted dynamic trees
• scientific article; zbMATH DE number 2038724

Cited in

(11)

• A dynamic distributed approach to representing proper interval graphs
• General compact labeling schemes for dynamic trees
• Near-optimal induced universal graphs for cycles and paths
• SLS: a numbering scheme for large XML documents
• Numeric-based XML labeling schema by generalized dynamic method
• Efficient labeling scheme for dynamic XML trees
• A dynamic prefix XML encoding scheme based on fraction
• A simple and optimal ancestry labeling scheme for trees
• Distance labeling for families of cycles
• Dynamically querying possibilistic XML data
• Constructing labeling schemes through universal matrices

This page was built for publication: Labeling Dynamic XML Trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3053159)