期刊文献+

XML查询中DTD的排序技术 被引量:6

DTD Ranking in the Smart XML Query
下载PDF
导出
摘要 Smaxt XML Query是一种支持多模式的XML查询方法.详细讨论Smart XML Query的关键技术“DTD与用户查询结构的距离排序”,提出以“树间亚距离排序”代替“树间距离排序”的观点,给出接近线性时间复杂性的排序算法,并对主要算法进行正确性证明. Smart XML Query(SXQ) is a method developed to support multi-DTD XML query. Discussed in this paper is a key technique in the SXQ, i.e. ranking of DTDs against user' s query structure. The point is the concept of sub-distance and its role to substitute conventional distance metric between trees. A ranking algorithm with near-linear complexity is proposed and proved.
出处 《计算机研究与发展》 EI CSCD 北大核心 2003年第11期1579-1585,共7页 Journal of Computer Research and Development
基金 国家自然科学基金(69933010) 国家"八六三"高技术研究发展计划项目(2002AA4Z3430)
关键词 DTD 结构树 上下文 亚距离 DTD structure tree context sub-distance
  • 相关文献

参考文献14

  • 1J Robie, J Lapp, D Schach. XML query language(XQL). 1998.http://www. vsehcol, com. en/xml/xm10450, htm. 被引量:1
  • 2A Deutsch, M Fernandez, D Florescu et al. XML-QL: A query language for XML. The 8th Int'l World Wide Web Conf(WWW'8), Toronto, Canada, 1999. 被引量:1
  • 3W3C Working Draft. XQuery 1.0: An XML query language.2001. http://www.w3. org/TR/xquery. 被引量:1
  • 4Y Kanza, Y Sagiv. Flexible queries over semistructured data. The 12th ACM SIGACT-SIGMOD-SIGART Symp on Principles of Database Systems. New York: ACM Press, 2001. 被引量:1
  • 5K Zhang, D Shasha. Simple fast algorithms for the editing distance between trees and related problems. Siam Journal on Computing, 1989, 18(6): 1245-1262. 被引量:1
  • 6K Zhang, J T L Wang, D Shasha. On the editing distance between undirected acyclic graphs. International Journal of Foundations of Computer Science, 1996, 7( 1 ) : 43- 57. 被引量:1
  • 7C Isert. The editing distance between trees. 1999. http://citeseer. nj. nec. com/isert99editing, html. 被引量:1
  • 8H Bunke, K Shearer. A graph distance metric based on maximal common subgraph. Pattern Recognition Letters, 1998, 19(2/3):255-259. 被引量:1
  • 9M L Fernandez, G Valiente. A graph distance metric combining maximum common subgraph and minimum common supergraph.Pattern Recognition Letters, 2001, 22(6-7) : 753-758. 被引量:1
  • 10S A Yahia, S Cho, L V S Lakshmanan et al. Minimization of tree pattem queries. In: Proc of the ACM SIGMOD Int' 1 Conf on Management of Data. New York: ACM Press, 2001. 497-508. 被引量:1

同被引文献45

引证文献6

二级引证文献20

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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