Compact labeling scheme for XML ancestor queries

Theory of Computing Systems

Volumn 40, Issue 1, 2007, Pages 55-99

  Kaplan, Haim ^a   Milo, Tova ^a   Shabo, Ronen ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTANT FACTORS; CONSTANT TIME; CONTAINMENT TEST; CRITICAL ISSUES; FOLLOWING PROBLEM; INDEX STRUCTURE; LABELING SCHEME; PARSE TREES;

INFORMATION DISSEMINATION; SEARCH ENGINES;

XML;

EID: 33846893003     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s00224-005-1281-8     Document Type: Article

References (36)

1. S. Abiteboul, P. Buneman, and D. Suciu, Data on the web: From Relations to Semistructured Data and XML, Morgan-Kaufmann, San Mateo, CA, 1999.
2. S. Abiteboul, H. Kaplan, and T. Milo, Compact labeling schemes for ancestor queries, Proceedings of the Twelfth Annual Symposium on Discrete Algorithms (SODA), 2001, pp. 547-556.
3. S. Abiteboul, D. Quass, J. McHugh, J. Widom, and J. Wiener, The Lorel query language for semistructured data, Internat. J. Digital Libraries 1(1) (1997), 68-88.
4. S. Alstrup, P. Bille, and T. Rauhe, Labeling schemes for small distances in trees, Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003, pp. 689-698.
5. S. Alstrup, C. Gavoille, H. Kaplan, and T. Rauhe, Nearest common ancestors: a survey and a new distributed algorithm, Proceedings of the Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), 2002, pp. 258-264.
6. S. Alstrup and T. Rauhe, Improved labeling scheme for ancestor queries, Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2002, pp. 947-953.
7. Altavista, http: //www.altavista.com.
8. D. B. Arnold and M.R. Sleep, Uniform random generation of balanced parenthesis strings, ACM Trans. Program. Lang. Syst. 2 (1980), 122-128.
9. A. Barkan and H. Kaplan, Partial alphabetic trees, Algorithms - ESA 2002, 10th Annual European Symposium, 2002, pp. 114-125.
10. M. A. Bender and M. Farach-Colton, The LCA problem revisited, LATIN 2000: Theoretical Informatics, 4th Latin American Symposium, 2000, pp. 88-94.
11. O. Berkman and U. Vishkin, Recursive star-tree parallel data structure, SIAM J. Comput. 22 (1993), 221-242.
12. S. Brin and L. Page, The anatomy of a large-scale hypertextual Web search engine, Proceedings of the 7th International World Wide Web Conference (WWW 7)/Computer Networks 30(1-7) (1998), 107-117.
13. P. Buneman, S. Davidson, G. Hillebrand, and D. Suciu, A query language and optimization techniques for unstructured data, Proceedings of ACM-SIGMOD International Conference on Management of Data, 1996, pp. 505-516.
14. J. Chen, D. DeWitt, F. Tian, and Y. Wang, NiagraCQ: a scalable continuous query system for internet databases, Proceedings of ACM-SIGMOD International Conference on Management of Data, 2000, pp. 379-390.
15. R. Cole and R. Hariharan, Dynamic lea queries on trees, Proceedings of the Tenth ACM-SIAM Symposium on Discrete Algorithms (SODA), 1999, pp. 235-244.
16. A. Deutsch, M. Fernandez, D. Florescu, A. Levy, and D. Suciu, A query language for XML, Computer Networks 31(11-16) (1999), 1155-1169.
17. H. Gabow, Data structures for weighted matching and nearest common ancestors with linking, Proceedings of the 1st ACM-SIAM Symposium on Discrete Algorithms (SODA), 1990, pp. 434-443.
18. A. M. Garsia and M. L. Wachs, A new algorithm for minimum cost binary trees, SIAM J. Comput. 6(4) (1977), 622-642.
19. C. Gavoille, D. Peleg, S. Pérennes, and R. Raz, Distance labeling in graphs, Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2001, pp. 210-219.
20. E. N. Gilbert and E. F. Moore, Variable length binary encoding, Bell Systems Tech. J. 38 (1959), 933-968.
21. D. Harel and R. Tarjan, Fast algorithms for finding nearest common ancestors, SIAM J. Comput. 13(2) (1984), 338-355.
22. T. C. Hu, D. J. Kleitman, and J. K. Tamaki, Binary trees optimum under various criteria, SIAM J. Appl. Math. 37(2) (1979), 514-532.
23. T. C. Hu and C. Tacker, Optimum computer search trees, SIAM J. Appl. Math. 21 (1971), 514-532.
24. D. A. Huffman, A method for the construction of minimum-redundancy codes, Proc. IRE 40 (1952), 1098-1101.
25. D. E. Knuth, Optimum binary search trees, Acta Inform. 1 (1971), 14-25.
26. K. Mehlhorn, A best possible bound for the weighted path length of binary search trees, SIAM J. Comput. 6(2) (1977), 235-239.
27. D. Peleg, Proximity-preserving labeling schemes and their applications, Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science (WADS), 1999, pp. 30-41.
28. D. Peleg, Informative labeling schemes for graphs, Mathematical Foundations of Computer Science (MFCS), 2000, pp. 579-588.
29. N. Santoro and R. Khatib, Labeling and implicit routing in networds, Comput. J. 28 (1985), 5-8.
30. B. Schieber and U. Vishkin, On finding lowest common ancestors: simplification and parallelization, SIAM J. Comput. 17(6) (1988), 1253-1262.
31. W3C, Extensible markup language (xml) 1.0, http://www.w3.org/TR/REC-xml.
32. W3C, Extensible stylesheet language (xsl), http://www.w3.org/Style/XSL/.
33. W3C, Xsl transformations (xslt) specification, http://www.w3.org/TR/WD- xslt.
34. D. B. West, Introduction to Graph Theory, 1996.
35. Xdex, http://www.xmlindex.com.
36. Xyleme, A dynamic data warehouse for the xml data of the web, http://www.xyleme.com.