On the sequencing of tree structures for XML indexing

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2005, Pages 372-383

  Wang, Haixun ^a   Meng, Xiaofeng ^b  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b RENMIN UNIVERSITY OF CHINA   (China)

Author keywords

[No Author keywords available]

Indexed keywords

DATA DISTRIBUTION; PERFORMANCE ORIENTED SEQUENCING PRINCIPLE; SUBSEQUENCE MATCHING; XML INDEXING;

COMPUTATIONAL COMPLEXITY; DATA PROCESSING; DATA STRUCTURES; QUERY LANGUAGES; TREES (MATHEMATICS);

INDEXING (OF INFORMATION);

EID: 27344452252     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2005.98     Document Type: Conference Paper

References (19)

1. XMARK: The XML-benchmark project. http://monetdb.cwi.nl/xml, 2002.
2. S. Abiteboul, P. Buneman, and D. Suciu. Data on the web: front relations to semistructured data and XML. Morgan Kaufmann Publishers, Los Altos, CA 94022, USA, 1999.
3. S. Abiteboul, H. Kaplan, and T. Milo. Compact labeling schemes for ancestor queries. In Proc. ACM-SIAM Symposium on Discrete Algorithms(SODA), 2001.
4. S. Alstrup and T. Rauhe. Improved labeling scheme for ancestor queries. In Proc. ACM-SIAM Symposium on Discrete Algorithms(SODA), 2002.
5. C. Chung, J. Min, and K. Shim. APEX: An adaptive path index for XML data. In ACM SIGMOD, June 2002.
6. B. F. Cooper, N. Sample, M. Franklin, G. Hjaltason, and M. Shadmon. A fast index for semistructured data. In VLDB, pages 341-350, September 2001.
7. R. Goldman and J. Widom. DataGuides: Enable query formulation and optimization in semistructured databases. In VLDB, pages 436-445, August 1997.
8. H. Kaplan, T. Milo, and R. Shabo. A comparison of labeling schemes for ancestor queries. In Proc. ACM-SIAM Symposium on Discrete Algorithms(SODA), 2002.
9. R. Kaushik, P. Bohannon, J. Naughton, and H. Korth. Covering indexes for branching path queries. In ACM SIGMOD, June 2002.
10. M. Ley. DBLP database web site, http://www.informatik.uni-trier.de/ley/ db, 2000.
11. Q. Li and B. Moon. Indexing and querying XML data for regular path expressions. In VLDB, pages 361-370, September 2001.
12. E. M. McCreight. A space-economical suffix tree construction algorithm. Journal of the ACM, 23(2):262-272, April 1976.
13. X. Meng, Y. Jiang, Y. Chen, and H. Wang. XSeq: an indexing infrastructure for tree pattern queries (demo). In SIGMOD, pages 941-942, 2004.
14. T. Milo and D. Suciu. Index structures for path expression. In Proceedings of 7th International Conference on Database Theory (ICDT), pages 277-295, January 1999.
15. S. Picciotto. How to Encode a Tree. PhD thesis, University of California, San Diego, 1999.
16. P. R. Raw and B. Moon. PRIX: Indexing and querying XML using prüfer sequences. In ICDE, 2004.
17. E. Ukkonen. Constructing suffix-trees on-line in linear time. Algorithms, Software, Architecture: Information Processing, pages 484-92, 1992.
18. H. Wang, S. Park, W. Fan, and P. S. Yu. ViST: A dynamic index method for querying XML data by tree structures. In SIGMOD, 2003.
19. H. Wang, C.-S. Perng, W. Fan, S. Park, and P. S. Yu. Indexing weighted sequences in large databases. In ICDE, 2003.