CAJ | 학술논문

随着半结构化的数据在信息交换中越来越重要,近年来,在XML数据库中,研究工作者提出了很多匹配小枝查询的算法.这些算法对仅含祖先后裔边的查询是很有效的,但是当查询中同时含祖先后裔和父子边时,以前算法仍可能产生大量中间结果,尤其是输入和输出的规模很大时.为避免中间结果的产生,提出了一种新的算法OPTwig,它是基于有序对的,通过查询树和文档树中结点有序对的匹配来进行查询,且不需要进行归并操作.结果表明,该算法优于以前算法.
수착반결구화적수거재신식교환중월래월중요,근년래,재XML수거고중,연구공작자제출료흔다필배소지사순적산법.저사산법대부함조선후예변적사순시흔유효적,단시당사순중동시함조선후예화부자변시,이전산법잉가능산생대량중간결과,우기시수입화수출적규모흔대시.위피면중간결과적산생,제출료일충신적산법OPTwig,타시기우유서대적,통과사순수화문당수중결점유서대적필배래진행사순,차불수요진행귀병조작.결과표명,해산법우우이전산법.
With the growing importance of semi-structure data in information exchange,researchers have proposed a number of matching algorithms for twig query in XML database in recent years.Those algorithms are quite efficient for queries with only ancestor-descendant edges.But for queries with mixed ancestor-descendant and parent-child edges,they still may produce many intermediate results,even when the input and output size are more manageable.In order to avoid the emergence of intermediate results,a new algorithm called OPTwig is proposed based on ordered pair in this paper.Through matching the ordered pair of node in query tree and document tree to process query,it doesn't need merge operation.The experiment shows that the algorithm is superior to previous algorithms.