Indexing XML documents for XPath query processing in external memory

Data and Knowledge Engineering

Volumn 59, Issue 3 SPEC. ISS., 2006, Pages 681-699

  Chen, Qun ^a   Lim, Andrew ^a   Ong, Kian Win ^b   Tang, Jiqing ^a  

^a HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

B+ tree; External memory index structure; XML; XPath query language

Indexed keywords

DATA REDUCTION; DATABASE SYSTEMS; INDEXING (OF INFORMATION); INFORMATION RETRIEVAL SYSTEMS; TREES (MATHEMATICS); XML;

B+-TREE; EXTERNAL-MEMORY INDEX STRUCTURE; XPATH QUERY LANGUAGE;

QUERY LANGUAGES;

EID: 33749234757     PISSN: 0169023X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.datak.2005.11.002     Document Type: Article

References (24)

1. C. Zhang, J. Naughton, D. Dewitt, Q. Luo, G. Lohman, On supporting containment queries in relational database management systems, in: Proceedings of the 20th ACM International Conference on Management of Data (SIGMOD), 2001, pp. 425-436.
2. Q. Li, B. Moon, Indexing and querying XML data for regular path expressions, in: Proceedings of 27th International Conference on Very Large Data Bases (VLDB), 2001, pp. 361-370.
3. D. Srivastava, S. Al-Khalifa, H.V. Jagadish, N. Koudas, J.M. Patel, Y. Wu, Structural joins: a primitive for efficient XML query pattern matching, in: Proceedings of the 18th International Conference on Data Engineering (ICDE), 2002, pp. 141-152.
4. E. Cohen, H. Kaplan, T. Milo, Labeling dynamic XML trees, in: Proceedings of the 21st ACM International Conference on Principles of Database Systems (PODS), 2002, pp. 271-281.
5. J. Clark, S. DeRose, XML path language, in: W3C Recommendation 16 November, 1999. Available from: .
6. N. Bruno, N. Koudas, D. Srivastava, Holistic twig joins: optimal XML pattern matching, in: Proceedings of the 21st ACM International Conference on Management of Data (SIGMOD), 2002, pp. 310-321.
7. S.-Y. Chien, Z. Vagena, D. Zhang, V. Tsotras, C. Zaniolo, Efficient structural joins on indexed XML documents, in: Proceedings of 28th International Conference on Very Large Data Bases (VLDB), 2002, pp. 263-274.
8. R. Busse, M. Carey, D. Florescu, M. Kersten, A. Schmidt, I. Manolescu, F. Waas, The XML Benchmark Project. Available from: .
9. H.F. Jiang, W. Wang, H.J. Lu, Holistic twig joins on indexed XML documents, in: Proceedings of 29th International Conference on Very Large Data Bases (VLDB), 2003, pp. 273-284.
10. S-Y. Chien, V.J. Tsotras, C. Zaniolo, Efficient management of multiversion documents by object referencing, in: Proceedings of 27th International Conference on Very Large Data Bases (VLDB), 2001, pp. 291-300.
11. S-Y. Chien, V.J. Tsotras, C. Zaniolo, D. Zhang, Efficient complex query support for multiversion XML documents, in: Proceedings of the 8th International Conference on Extending Database Technology (EDBT), 2002, pp. 161-178.
12. Bayer R., and McCreight C. Organization and maintenance of large ordered indexes. Acta Informatica 1 3 (1972) 173-189
13. Bayer R., and Unterauer K. Prefix B-trees. ACM Transactions on Database Systems 2 1 (1977) 11-26
14. Comer D. The ubiquitous B-tree. Computing Survey 11 (1979) 121-137
15. Ferragina P., and Grossi R. The string B-tree: a new data structure for string search in external memory and its applications. Journal of ACM 46 2 (1999) 236-280
16. B.F. Cooper, N. Sample, M.J. Franklin, G.R. Hjatlason, M. Shadmon, A fast index for semistrucured data, in: Proceedings of 27th International Conference on Very Large Data Bases (VLDB), 2001, pp. 341-350.
17. N. Zhang, V. Kacholia, M.T. Ozsu, A succinct physical storage scheme for efficient evaluation of path queries in XML, in: Proceedings of the 20th International Conference on Data Engineering (ICDE), 2004, pp. 54-65.
18. T. Grust, Accelerating XPath location steps, in: Proceedings of the 21st ACM International Conference on Management of Data (SIGMOD), 2002, pp. 109-120.
19. Ramakrishnan R., and Gehrke J. Database Management Systems. third ed. (2002), McGraw-Hill
20. S. Abiteboul, H. Kaplan, T. Milo, Compact labeling schemes for ancestor queries, in: The 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2001, pp. 547-556.
21. S. Alstrup, T. Rauhe, Improved labeling scheme for ancestor queries, in: The 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2002, pp. 947-953.
22. H. Kaplan, T. Milo, R. Shabo, A comparison of labeling schemes for ancestor queries, in: The 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2002, pp. 954-963.
23. Prywes N.S., and Gray H.J. The organization of a multilist-type associative memory. IEEE Transactions on Communication and Electronics 68 (1963) 488-492
24. The TPIE Project. Available from: .