Compact labeling schemes for ancestor queries

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2001, Pages 547-556

  Abiteboul, Serge ^a   Kaplan, Haim ^b   Milo, Tova ^b  

^a INRIA ROCQUENCOURT   (France)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

Algorithms; Theory; Verification

Indexed keywords

EID: 64049090922     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (21)

1. Serge Abiteboul , Peter Buneman , Dan Suciu, Data on the Web: from relations to semistructured data and XML, Morgan Kaufmann Publishers Inc., San Francisco, CA, 1999
2. Altavista. http://wine.altavista.com.
3. Sergey Brin , Lawrence Page, The anatomy of a large-scale hypertextual Web search engine, Proceedings of the seventh international conference on World Wide Web 7, p.107-117, April 1998, Brisbane, Australia
4. D. Butler. Souped-up search engines. Nature, 405:112- 115, May 2000.
5. Richard Cole , Ramesh Hariharan, Dynamic LCA queries on trees, Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms, p.235-244, January 17-19, 1999, Baltimore, Maryland, United States
6. R. Cover. The xml cover pages, extensible markup language - industry news. http://www.oasis-open.org/cover/xmlNews.html.
7. Alin Deutsch , Mary Fernandez , Daniela Florescu , Alon Levy , Dan Suciu, A query language for XML, Proceeding of the eighth international conference on World Wide Web, p.1155-1169, May 1999, Toronto, Canada
8. Harold N. Gabow, Data structures for weighted matching and nearest common ancestors with linking, Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms, p.434-443, January 22-24, 1990, San Francisco, California, United States
9. C. Gavoille, D. Peleg, S. Pdrennes, and R. Raz. Distance labeling in graphs. 1999.
10. Dov Harel , Robert Endre Tarjan, Fast algorithms for finding nearest common ancestors, SIAM Journal on Computing, v.13 n.2, p.338-355, May 1984 [doi〉10.1137/0213024]
11. Oasis. Organization for the Advancement of Structured Information Standards. http://www.oasis-open.org.
12. David Peleg, Proximity-Preserving Labeling Schemes and Their Applications, Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science, p.30-41, June 17-19, 1999
13. D. Peleg, Informative Labeling Schemes for Graphs, Weizmann Science Press of Israel, Jerusalem, Israel, 2000
14. N. Santoro and R. Khatib. Labeling and implicit routing in networds. The Computer J., 28:5-8, 1985.
15. Baruch Schieber , Uzi Vishkin, On finding lowest common ancestors: simplification and parallelization, SIAM Journal on Computing, v.17 n.6, p.1253-1262, Dec. 1988 [doi〉10.1137/0217079]
16. W3C. Extensible markup language (xml) 1.0. http://www.w3.org/TR/REC-xml.
17. W3C. Extensible stylesheet language (xsl). http://www.w3.org/Style/XSL/.
18. W3C. Html home page. http://www.w3.org/MarkUp/.
19. W3C. The w3c query languages workshop, dec 1998, boston, massachussets. http://www.w3.org/WandS/QL/QL98/cfp.html.
20. W3C. Xsl transformations (xslt) specification. http://www.w3.org/TR/WD- xslt.
21. Xyleme. A dynamic data warehouse for the xml data of the web. http://www.xyleme.com.