基于编码的XPath查询优化技术的研究与实现-计算机软件与理论专业论文.docxVIP

基于编码的XPath查询优化技术的研究与实现摘要 基于编码的XPath查询优化技术的研究与实现 摘要 XML(可扩展标记语言)已经发展成为一种通用的数据交换与传输格式，与此 同时日趋成熟的数据库技术也在不断地发展以存储目前大量的XML数据，并且能 通过在XML领域发展起来的查询语言如XPath来对这些存储在数据库中的XML数据 进行查询。然而，XML的树型数据类型以及在这种树型数据类型上进行的操作所 固有的递归性对于基于数据库的XML数据存储和查询是一个很大的挑战，尤其是 对于现在最流行和成熟的以元组表为原始数据模型、以SOL为原始查询语言的关 系数据库技术而言查询评估效率更加需要进一步。在这样的背景下XPath查询优 化技术应运而生。XPath查询优化技术是一种专门为支持XPath路径表达式的评估 而设计的数据库索引结构，因为该XPath查询优化技术允许面向集合的XPath路径 表达式评估，而且能够通过现有的关系索引结构来实现和查询，所以它能够很好 地被现有的关系数据库查询处理技术支持。本文讨论了在不同数据库后台上该 XPath查询优化技术的实施，尤其针对在传统的关系数据库系统中该XPath查询优 化技术带来的效率提高进行了详细的分析。最后，针对在MYSQL关系数据库系统 中实现该XPath查询优化技术进行模拟和实现，设计和实现了XA系统。 关键词：XPath，编码，查询窗口，STRETCT-DYNAMIC，SAX解析，XPath解析 基于编码的XPath查询优化技术的研究与实现Abstract 基于编码的XPath查询优化技术的研究与实现 Abstract XML(eXtensible Markup Language)has been developed to be one common format for data exchange and data transportation．At the same thne the database comlnunity is well underway to adapt its technology to host large XML stores and to query these stores efficiently，preferably using query languages developed in the XML domain such as XPath．But the recursion inherent in tree-shaped data types as well as in operations over these types turns out to be a challenge for database-based approaches to XML storage and querying．This is especially true for relational databaSe technology whose native data model(tables oftuples)and native query language SQL have originally not been designed to deal with recursion．Under such circumstance，the XPath accelerator has been put forward．The XPath accelerator is a databaSe indexing structure specially designed for the evaluation ofXPath expressions．Since it permits the set-oriented evaluation ofXPath experessions and Can be implemented through existing relational indexing structure，the XPath accelerator Can be well supported by existing relational database query technology．This paper discusses the implementation ofthe XPath accelerator in different back end databases。then it has a detailed analysis ofperformance improvement brought by XPath accelerator in traditiona