In this paper, we propose a more flexible twig pattern matching algorithm named TJDirect, which skip some nodes which won't be joined. Algorithms' performance is improved.
本文提出了TJDirect算法，它采用一种更为灵活的小枝模式匹配方法，跳过了一些不参与连接的节点，提高了算法的执行效率，并且算法中不再用集合保存匹配的节点，使得空间复杂度降低。
参考来源 - TJDirect：一种基于IFED编码的XML文档小枝模式匹配算法·2,447,543篇论文数据，部分数据来源于NoteExpress
In XML database, twig pattern matching is the core of XML query processing and is important for improving the query efficiency.
在XML数据库中，小枝模式查询是XML查询处理的核心操作，它对于提高查询效率是很有意义的。
At present, there are many algorithms for twig pattern matching, but they dont have good method to solve the twigs which have parent-child edges.
目前，已经提出了很多小枝模式匹配算法，但没有解决含有父子边的小枝模式查询。
Nowadays the query optimization technique of XML databases has become a hot research topic in database field, and twig pattern matching is an important problem in XML field.
XML数据库的查询优化技术是当前数据库领域中的一个研究热点，而小枝模式匹配又是其中的一个研究重点。
应用推荐