A comparison of labeling schemes for ancestor queries

@inproceedings{Kaplan2002ACO,
  title={A comparison of labeling schemes for ancestor queries},
  author={Haim Kaplan and Tova Milo and Ronen Shabo},
  booktitle={SODA},
  year={2002}
}
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… CONTINUE READING
Highly Cited
This paper has 105 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.

105 Citations

051015'02'05'09'13'17
Citations per Year
Semantic Scholar estimates that this publication has 105 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-4 of 4 references

Informative Labeling Schemes for Graphs

MFCS • 2000
View 4 Excerpts
Highly Influenced

Labelling and Implicit Routing in Networks

Comput. J. • 1985
View 3 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…