专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明授权

US08914415B2 Serial and parallel methods for I/O efficient suffix tree construction 有权
标题翻译：用于I / O高效后缀树构建的串行和并行方法
公开(公告)号：US08914415B2
公开(公告)日：2014-12-16
申请号：US12697159
申请日：2010-01-29
申请人： Amol N. Ghoting , Konstantin Makarychev
发明人： Amol N. Ghoting , Konstantin Makarychev
IPC分类号： G06F17/30
CPC分类号： G06F17/30
摘要： System and method for suffix tree creation for large input data/text streams. The methodology leverages the structure of suffix trees to build a suffix tree by simultaneously tiling accesses to both the input string as well as the partially constructed suffix tree. The end result enables the indexing of very large input strings and at the same time maintain a bounded working set size and a fixed memory footprint. The method is employed for serial processing. Further, a scalable parallel suffix tree construction is realized that is suitable for implementation on parallel distributed memory systems that use effective collective communication and in-network caching. The methodology is also applied for suffix link recovery in both serial and parallel implementations.
摘要翻译：为大型输入数据/文本流创建后缀树的系统和方法。该方法利用后缀树的结构，通过同时对输入字符串以及部分构造的后缀树进行平铺访问来构建后缀树。最终结果使得可以对非常大的输入字符串进行索引，同时保持有界的工作集大小和固定的内存占用。该方法用于串行处理。此外，实现了适用于在使用有效集体通信和网络缓存的并行分布式存储器系统上实现的可扩展并行后缀树构造。该方法也适用于串行和并行实现中的后缀链接恢复。

2. 发明申请

US20110191382A1 SERIAL AND PARALLEL METHODS FOR I/O EFFICIENT SUFFIX TREE CONSTRUCTION 有权
标题翻译：串行和并行方法用于I / O高效的三叉树结构
公开(公告)号：US20110191382A1
公开(公告)日：2011-08-04
申请号：US12697159
申请日：2010-01-29
申请人： Amol N. Ghoting , Konstantin Makarychev
发明人： Amol N. Ghoting , Konstantin Makarychev
IPC分类号： G06F17/30
CPC分类号： G06F17/30
摘要： System and method for suffix tree creation for large input data/text streams. The methodology leverages the structure of suffix trees to build a suffix tree by simultaneously tiling accesses to both the input string as well as the partially constructed suffix tree. The end result enables the indexing of very large input strings and at the same time maintain a bounded working set size and a fixed memory footprint. The method is employed for serial processing. Further, a scalable parallel suffix tree construction is realized that is suitable for implementation on parallel distributed memory systems that use effective collective communication and in-network caching. The methodology is also applied for suffix link recovery in both serial and parallel implementations.
摘要翻译：为大型输入数据/文本流创建后缀树的系统和方法。该方法利用后缀树的结构，通过同时对输入字符串以及部分构造的后缀树进行平铺访问来构建后缀树。最终结果使得可以对非常大的输入字符串进行索引，同时保持有界的工作集大小和固定的内存占用。该方法用于串行处理。此外，实现了适用于在使用有效集体通信和网络缓存的并行分布式存储器系统上实现的可扩展并行后缀树构造。该方法也适用于串行和并行实现中的后缀链接恢复。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式