期刊文献+

一种基于编辑距离的XML查询方案 被引量:2

XML query solution based on editing distance
下载PDF
导出
摘要 提出了一种新的XML查询方案,将内容查询置于结构查询之前,并在结构查询中提出M集合的概念,通过计算查询树的M集合和简化后的DTD的M集合之间的编辑距离,对XML文档进行排序,不仅减少了查询时间,而且在保证查全率的同时提高了查询的查准率。 Based on editing distance, a new XML query solution was proposed. To reduce the searching time, this solution performed content query before schemas query. Furthermore, M aggregation was introduced in schemas query, XML documents were ranked by the editing distance between the M aggregation of querying tree and the M aggregation of simplified DTD, which improved the precision while maintaining a high level recall.
出处 《计算机应用》 CSCD 北大核心 2006年第12期2991-2993,共3页 journal of Computer Applications
关键词 内容查询 结构查询 相关树 M集合 编辑距离 content querying schemas querying related tree M aggregation editing distance
  • 相关文献

参考文献9

  • 1路燕,张彪,郭景峰,刘国华.用户界面友好的XML查询方案[J].小型微型计算机系统,2003,24(10):1849-1852. 被引量:10
  • 2路燕,张亮,汪卫,段起阳,施伯乐.XML查询中DTD的排序技术[J].计算机研究与发展,2003,40(11):1579-1585. 被引量:6
  • 3ZHANG KZ,WANG JTL,SHASHA D.On the editing distance between Undirected acyclic graphs[J].International Journal of Foundations of Computer Science,1996,7(1):43 -57. 被引量:1
  • 4BUNKE H,SHEARER K.A graph distance metric based on maximal common subgraph[J].Pattern Recognition Letters,1998,19 (2/3):255 -259. 被引量:1
  • 5MESITI M,BERTINO E,GUERRINI G.An abstraction-based approach to measuring the structural similarity between two unordered XML documents[A].Proceedings of the 1st international symposium on information and communication technologies[C].2003.316-321. 被引量:1
  • 6BERTINO E,GUERRINI G,MESITI M.A matching algorithm for measuring the structural similarity between an XML document and a DTD and its applications[J].Informational Systems,2004,29(1):23 -46. 被引量:1
  • 7ZHANG K,SHASHA D.Simple fast algorithms for the editing distance between trees and related problems[J].SIAM Journal of Computing,1989,18(6):1245-1262. 被引量:1
  • 8陈伟,丁秋林.一种XML相似重复数据的清理方法研究[J].北京航空航天大学学报,2004,30(9):835-838. 被引量:7
  • 9郑仕辉,周傲英,张龙.XML文档的相似测度和结构索引研究[J].计算机学报,2003,26(9):1116-1122. 被引量:28

二级参考文献40

  • 1[1]Rahm E, Do H H.Data cleaning:problems and current approaches[J].IEEE Data Engineer Bulletin, 2000, 23(4):3~13 被引量:1
  • 2[2]Galhardas H, Florescu D, Shasha D,et al .Declarative data cleaning:language,model,and algorithms[A].In:Apers P, Atzeni P,Ceri S,eds.Proceedings of the 27th VLDB Conference[C].Roma:Morgan Kaufmann, 2001.371~380 被引量:1
  • 3[3]Monge A E.Matching algorithms within a duplicate detection system[J].IEEE Data Engineer Bulletin, 2000,23(4):14~20 被引量:1
  • 4[4]Zhang K,Shasha D.Tree pattern matching[M].London:Oxford Univesity Press,1997 被引量:1
  • 5[5]Guha S, Jagadish H V, Koudas N, et al .Approximate XML joins[A].In:Proceedings of the 2002 ACM SIGMOD International Conference on Management of Data[C].Madison:ACM Press,2002 被引量:1
  • 6XQuery: A query language for XML. W3C Working Draft 15February 2001, available: http://www. w3. org/TR/xquery/. 被引量:1
  • 7Tarjan. Three partition refinement algorithms. SIAM Journalon Computing, 1987, 16(6): 973-989. 被引量:1
  • 8Henzinger M R, Henzinger T A, Kopke P W. Computing sim-ulations on finite and infinite graphs. In: Proceedings of the36th Annual IEEE Symposium on Foundations of ComputerScience, Milwaukee, Wisconsin, 1995. 453-462. 被引量:1
  • 9Marian A, Abiteboul S, Cobena G, Mignet L. Change-centricmanagement of versions in an XML warehouse. In: Proceed-ings of the 27th International Conference on Very Large DataBases, Roma, Italy,2001. 581-590. 被引量:1
  • 10Goldman R, Widom J. Summarizing and searching sequential semistructured sources. Stanford University: Technical ReportTR20000312, 2000. 被引量:1

共引文献44

同被引文献18

引证文献2

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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