中国最大的综合性文献数据库 -维普资讯 关键词: 关联规则 频繁项集挖掘 可扩展性 模式树[gap=935]Key words: association rule;frequent item-set mining;scalability;pattern tree
基于28个网页-相关网页
Based on successive pattern tree,a united method to search nodes and text in XPath is introduced.
在后继模式树的基础上提出了XPath中节点与文本的联合查询方法。
参考来源 - XPath中的文本查询研究 in C·2,447,543篇论文数据，部分数据来源于NoteExpress
模式树是对像XML和LDAP等树形结构数据进行查询的基础。
Pattern trees form a natural basis to query tree-structured data such as XML and LDAP.
提出了访问模式树(APT)算法，证明该法能有效减小存储空间。
Access Pattern Tree algorithm (APT) is proposed, finally, it demonstrates that the algorithm can reduce space.
除此之外，算法对频繁模式树中每个节点增加一个位串来存储该项目的前缀项目，以避免在模式扩展的时候频繁的遍历子树。
In addition, we add a bit string to each node in the tree to store the prefix of the items. By using the structure we can avoid repeatedly traversing the sub-tree while expanding the patterns.
应用推荐