公开(公告)号：US09715525B2

公开(公告)日：2017-07-25

申请号：US13929870

申请日：2013-06-28

申请人： Khalifa University of Science, Technology, and Research ,  British Telecommunications plc ,  Emirates Telecommunications Corporation

发明人： Quang Hieu Vu ,  Rasool Asal

IPC分类号： G06F17/30

CPC分类号： G06F17/30451 ,  G06F17/30716 ,  G06F17/30985

摘要： This invention relates to methods for storing and searching data. Embodiments of the invention make use of suffix trees to support binary pattern matching. Embodiments of the invention can be shown to have comparable search speeds to searches of known suffix trees, but are advantageous in that they have lower memory usage requirements which is important in large data environments.

公开(公告)号：US20150006577A1

公开(公告)日：2015-01-01

申请号：US13929870

申请日：2013-06-28

申请人： Khalifa University of Science, Technology, and Research ,  Emirates Telecommunications Corporation ,  British Telecommunications plc

发明人： Quang Hieu Vu ,  Rasool Asal

IPC分类号： G06F17/30

CPC分类号： G06F17/30451 ,  G06F17/30716 ,  G06F17/30985

摘要： This invention relates to methods for storing and searching data. Embodiments of the invention make use of suffix trees to support binary pattern matching. Embodiments of the invention can be shown to have comparable search speeds to searches of known suffix trees, but are advantageous in that they have lower memory usage requirements which is important in large data environments.

摘要翻译： 本发明涉及用于存储和搜索数据的方法。 本发明的实施例利用后缀树来支持二进制模式匹配。 可以示出本发明的实施例具有与已知后缀树的搜索相当的搜索速度，但是有利的是它们具有较低的存储器使用要求，这在大数据环境中是重要的。