会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 2. 发明授权
    • Efficient memory usage for two-pass compression
    • 双向压缩的高效内存使用
    • US6037883A
    • 2000-03-14
    • US073893
    • 1998-05-07
    • Jonathan Forbes
    • Jonathan Forbes
    • H03M7/30H03M7/00
    • H03M7/3084
    • Described above is a two-pass method of compressing a data input stream to create a compressed data output stream. The method includes a step of sequentially examining data elements and strings of data elements of the data input stream in a first compression pass using a sliding window compression scheme to find literal data elements and pairs of length and displacement values. The first compression pass includes: coding the literal data elements and the length values with a first minimum redundancy coding tree; coding the displacement values with a second minimum redundancy coding tree; and adding the coded literal data elements, length values, and displacement values to a single data buffer. The method also includes a second compression pass that is performed whenever the single data buffer reaches a predefined capacity.
    • 上面描述的是压缩数据输入流以创建压缩数据输出流的双程方法。 该方法包括以下步骤:使用滑动窗口压缩方案在第一压缩通过中依次检查数据输入流的数据元素和数据元素串,以查找文字数据元素和长度和位移值对。 第一压缩传递包括:用第一最小冗余编码树对文字数据元素和长度值进行编码; 用第二最小冗余编码树对位移值进行编码; 并将编码的文字数据元素,长度值和位移值添加到单个数据缓冲器。 该方法还包括每当单个数据缓冲器达到预定容量时执行的第二压缩遍。
    • 3. 发明授权
    • Temporally ordered binary search method and system
    • 时间排序二进制搜索方法和系统
    • US5978795A
    • 1999-11-02
    • US783491
    • 1997-01-14
    • Tomi J. PoutanenJonathan Forbes
    • Tomi J. PoutanenJonathan Forbes
    • G06F17/30H03M7/30H03M7/40
    • H03M7/3086H03M7/40Y10S707/99933Y10S707/99934Y10S707/99936
    • A method and system for maintaining a binary tree of pointers to a stream of data and for searching same. A novel binary tree is created by a search engine in which the nodes associated with strings in the data stream which are closer to the current data stream position are nearer the root of the tree than nodes associated with strings which are farther. As the current position in the stream is advanced, the search engine inserts a new node to the tree for that position as the root node. The tree is then restructured based on the relative value of the strings of each node while preserving the temporal order of the tree such that strings nearer the current position are associated with nodes which are closer to the root. The tree is ideal for searching data for LZ77-based data compression, since a single traversal of the tree returns the longest match length with the smallest offset.
    • 用于维护指向数据流的指针的二进制树并用于搜索的方法和系统。 一个新颖的二叉树是由一个搜索引擎创建的,其中与数据流中与字符串相关的节点更靠近当前数据流位置的节点比与更远的字符串相关的节点更靠近树根。 当流中的当前位置提前时,搜索引擎将一个新节点插入该树位置作为根节点。 然后根据每个节点的字符串的相对值重新构建树,同时保留树的时间顺序,使得更靠近当前位置的字符串与更靠近根的节点相关联。 该树是搜索基于LZ77的数据压缩的数据的理想选择,因为树的单次遍历将以最小的偏移量返回最长的匹配长度。
    • 7. 发明授权
    • Affinitizing datasets based on efficient query processing
    • 基于有效的查询处理关联数据集
    • US08819017B2
    • 2014-08-26
    • US12905464
    • 2010-10-15
    • Jingren ZhouPatrick James HellandJonathan ForbesYaron Burd
    • Jingren ZhouPatrick James HellandJonathan ForbesYaron Burd
    • G06F7/00G06F17/30
    • G06F17/30982
    • Embodiments of the present invention relate to systems, methods, and computer-storage media for affinitizing datasets based on efficient query processing. In one embodiment, a plurality of datasets within a data stream is received. The data stream is partitioned based on efficient query processing. Once the data stream is partitioned, an affinity identifier is assigned to datasets based on the partitioning of the dataset. Further, when datasets are broken into extents, the affinity identifier of the parent dataset is retained in the resulting extent. The affinity identifier of each extent is then referenced to preferentially store extents having common affinity identifiers within close proximity of one other across a data center.
    • 本发明的实施例涉及用于基于有效查询处理关联数据集的系统,方法和计算机存储介质。 在一个实施例中,接收数据流内的多个数据集。 基于有效的查询处理对数据流进行分区。 一旦数据流被分区,基于数据集的分区,将一个亲和度标识符分配给数据集。 此外,当数据集分成多个区段时,父数据集的亲和性标识符将保留在生成的范围内。 然后引用每个范围的相似性标识符,以优先地存储具有跨越数据中心的彼此靠近的共同相似性标识符的盘区。
    • 8. 发明授权
    • Cross-file pattern-matching compression
    • 跨文件模式匹配压缩
    • US06226628B1
    • 2001-05-01
    • US09104162
    • 1998-06-24
    • Jonathan Forbes
    • Jonathan Forbes
    • G06F1730
    • G06F17/30952H03M7/3084Y10S707/918Y10S707/99931Y10S707/99932Y10S707/99936Y10S707/99942
    • A method of providing data files includes compressing the files using a cross-file compression technique. The technique makes use of ancillary files that are stored along with the data files. The ancillary files include lookup tables and indexes. A lookup table for a data file indicates the position of the last occurrence of individual data values within the data file. Each displacement index for a data file indicates displacements from respective data elements to prior strings of a particular match length that match strings of the particular match length begun by the respective data elements. Indexes corresponding to different match lengths are provided. In response to client requests for subsets of available data files, a server compresses each subset of data files using a pattern-matching compression scheme that attempts to represent given strings by referencing prior matching strings across file boundaries. To find a prior matching string for a string begun by a current data element in a current data file, the server finds a previous matching string in the current data file by referencing the displacement indexes associated with the current data file, and then searches for a larger matching string in previous data files by referencing the lookup tables and displacement indexes associated with the previous data files.
    • 提供数据文件的方法包括使用跨文件压缩技术压缩文件。 该技术利用与数据文件一起存储的辅助文件。 辅助文件包括查找表和索引。 数据文件的查找表指示数据文件中单个数据值的最后一次出现的位置。 数据文件的每个位移指数指示从相应数据元素到匹配由相应数据元素开始的特定匹配长度的字符串的特定匹配长度的先前字符串的位移。 提供了与不同匹配长度对应的索引。 响应于客户端对可用数据文件子集的请求,服务器使用模式匹配压缩方案来压缩数据文件的每个子集,该模式匹配压缩方案通过引用跨文件边界的先前匹配字符串来尝试表示给定的字符串。 要查找当前数据文件中由当前数据元素开始的字符串的先前匹配字符串,服务器将通过引用与当前数据文件相关联的位移索引来查找当前数据文件中的先前匹配字符串,然后搜索 通过引用与先前数据文件相关联的查找表和位移指数,可以获得先前数据文件中较大的匹配字符串。