期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

一种分数前缀XML编码方案 被引量：5

Fraction and Prefix XML Encoding Scheme
在线阅读 下载PDF
导出
摘要 针对XML数据的更新与查询问题,提出一种分数前缀编码方案(FPES)。将分数引入LSDX前缀编码中,在2个分数间可插入无穷多个分数,支持XML节点数据的无限更新,并可表示祖先后裔关系、父子关系和兄弟关系,避免二次编码。实验结果表明,FPES与LSDX相比,查询效率较高;与分数编码相比,编码时间与插入节点的时间较少。 In order to update and query eXtensible Markup Language（XML） data effectively,a Fraction and Prefix Encoding Scheme（FPES） is proposed.It introduces the fractions into prefix encoding scheme LSDX.FPES makes good use of the fraction characteristics of insertion,and unlimited fractions can be inserted between any two fractions to support the infinite update of node data.It supports the representation of ancestor-descendant relationship,parent-children relationship and sibling relationship between any two nodes.It avoids re-encoding completely.Experimental results show that FPES improves the query efficiency compared with LSDX.FPES spends less time in encoding and inserting nodes compared with fraction encoding.
作者 刘先锋 周舟 刘萍 张楚才
机构地区 晓庄学院数学与计算机科学学院
出处 《计算机工程》 CAS CSCD 2012年第12期29-31,共3页 Computer Engineering
基金 国家自然科学基金资助项目(10571052) 湖南省高等学校科学研究基金资助一般项目(10C0941) 晓庄学院青年基金资助项目(60902)
关键词 可扩展标识语言 编码方案 分数前缀编码方案 分数编码 XML数据更新 eXtensible Markup Language（XML） encoding scheme Fraction and Prefix Encoding Scheme（FPES） fraction encoding XML data updating
分类号 TP311 [自动化与计算机技术—计算机软件与理论]
  • 相关文献

参考文献8

  • 1Robie J,Chamberlin D,Florescu D.Quilt:An XML QueryLanguage for Heterogeneous Data Sources[C]//Proc.ofWebDB’00.Dallas,Texas,USA:[s.n.],2000.
  • 2Robie J,Lapp J,Schach D.XML Query Language(XQL)[EB/OL].[2011-07-01].http://www.w3.org/TandS/QL/QL98/pp/xql.html.
  • 3Clark J,DeRose S.XML Path Language(XPath)Version1.0[Z].W3C Recommendation,1999.
  • 4Chamberlin D.Xquery 1.0:An XML Query Language[Z].W3CWorking Draft,2001.
  • 5Duong M,Zhang Yanchun.LSDX:A New Labelling Scheme forDynamically Updating XML Data[C]//Proc.of ADC’05.Darlinghurst,Australia:[s.n.],2005.
  • 6孙勇义 高军 王腾蛟 等.一种更新友好的基于分数的XML编码方法.计算机科学,2008,35(10):165-169.
  • 7Zhang Chun,Naughton J,DeWitt D,et al.On SupportingContainment Queries in Relational Database ManagementSystems[C]//Proc.of ACM SIGMOD Conf.on Management ofData.New York,USA:ACM Press,2001.
  • 8Schmidt A,Waas F,Kersten M,et al.XMark:A Benchmark forXML Data Management[C]//Proc.of VLDB’02.Hong Kong,China:[s.n.],2002.

共引文献1

同被引文献37

  • 1Dietz P F.Maintaining Order in a Linked List[C].Proceedings of the 14th Annual ACM Symposium on Theory of Computing (STOC' 82).1982:122-127.
  • 2Li Q,Moon B.Indexing and Querying XML Date for Regular Path Expressions[C] //Apers P M Get al Eds.Proceedings of the 27th VLDB International Conference on Very Large Databases.Rome,Italy.Sept.11-14,2001.San Francisco:Morgan kaufmann Publishem,2001:361-370.
  • 3ZHANG C,NAUGHTON J,DEWITT D,et al.On supporting containment queries in relational database management systems[C] //Proceedings of the 2001 ACM SIGMOD International Conference on Management of Data.NewYork:ACM Press,2001:425-436.
  • 4TARNOV I,VIGLAS S D,BERYER K,et al.Storing and querying ordered XML using a relational database system[C] //Proceeding of the 2002 ACM SIGMOD International Conference on Management of Data.New York:ACM Press,2002:204-215.
  • 5Amagasa T,Yoshikawa M,Uemura S.QRS:A robust numbering scheme for XML documents[C] //Proceedings of the 19th International Conference on Data Engineering(ICDE2003),2003:705-707.
  • 6O' NeilP,O' Neil E,PalS,et al.ORDPATHS:Insert-Friendly XML Node Labels[C] //Proceedings of the 2004 ACM SIGMOD International Conference on Management of Data.Paris,France.Jun.13-18ACM (Press),2004:903-908.
  • 7Wu X,Lee M L,Hsu W.A Prime number labeling scheme for dynamic ordered ML Tees[C] //Proceedings of the 20 International Conference on Data Engineering(ICDE2004),2004:66-78.
  • 8Tatarinov I,Viglas S D,Beyer K,et al.Storing and Querying Ordered XML using a Relational Database System[C] // Proceedings of 21th ACM SIGMOD International Conference on Management of Data.Madison,Wisconsin,USA,2002:204-215.
  • 9Cohen E,Kaplan H,Milo T.Labeling Dynamic XML Trees[C] //Proceedings of 21th ACM SIGMOD-SIGACT-SIGART Symp.Principles of Database Systems (SPDS).2002.
  • 10Abiteboul S,Alstrup S,Kaplan H,et al.Compact Labeling Scheme for Ancestor Queries[J].SIAM J.Computing Systems,2006 (40):55-99.

引证文献5

二级引证文献2

计算机工程
2012年 第12期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部