基于索引的XML查询技术研究-计算机应用技术专业论文.docxVIP

基于索引的XML查询技术研究-计算机应用技术专业论文.docx

  1. 1、本文档共53页,可阅读全部内容。
  2. 2、有哪些信誉好的足球投注网站(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
  3. 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  4. 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
  5. 5、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
  6. 6、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们
  7. 7、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
  8. 8、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
南京师范大学硕I论文 南京师范大学硕I论文 ABSTRA(玎 ABSTRACT XML query is important of XML technology.Although achievements of XML index query research made.there some problems of XML query technology because of XMLs inherent characteristic. This thesis takes focus the technology of XML query.This thesis addresses several key technical problems ofindexing and querying XML,major contributions ofthis thesis include: (1)Design XML index updating Algorithm.XML index updating has been researched deeply’but XML index updating is not resolved well.This paper presents XML index pathvalueindex which is consisted of path index and value index,the index updating algorithm resolves XML updating problem when the XML document is updated,the XML index be update at the same time. (2)Present XML multiple branch pathes query algorithm DEPTHJOIN based index. XML single path query methods and simple branch path query methods have been presented,but how to query multiple branch pathes have not been solved well.This paper presents the algorithm DEPTHJOIN for querying XML multiple branch pathes based index.The algorithm encodes the XML document and creates the index for the XML documents.It restores the single paths of the multiple branch pathes using the multiple stacks the process ofmatching ofthe query tree, judging the branch nodes have the same ancestors parent not by the index.Compared with the existing algorithms,the algorithm docsn’t needjoin the single paths. (3)Propose an efficient algorithm MBPQ for XML multiple branch pathes query.The algorithm encodes the XML document and XML query tree,disjoints the multiple branch pathes into single paths,queries the singe paths and USeS the stack to match the single pathes which have the same ancestors in the process of matching the single paths to the multiple branch pathes. Compared with the existing algorithms the algorithm makes full ofthe typical ofthe multiple

文档评论(0)

1234554321 + 关注
实名认证
文档贡献者

该用户很懒,什么也没介绍

1亿VIP精品文档

相关文档