In this paper, we use binary sort tree data structure to find the frequent predicate sets and this improvement reduces the memory space occupied.3.
本文利用二叉排序树的数据结构来查找频繁谓词集,较好的解决了占用内存空间大的问题。
参考来源 - 基于日志数据挖掘的网络安全审计技术研究·2,447,543篇论文数据，部分数据来源于NoteExpress
First, classic string matching algorithms and regular expression matching algorithms are studied; second a binary sort tree string matching algorithm is proposed and realized.
终结符号处理过程中，深入地研究了字符串匹配算法和正则表达式匹配算法，并实现了二叉排序树字符串匹配算法。
This paper is devoted to a study of an algorithm of generating the binary-sort-tree on the new structure and, on the basis of this algorithm, an analysis is made of the time complexity.
研究了基于一种新二叉树结构的二叉排序树的生成算法，并在此算法的基础上进行时间复杂度分析。
应用推荐