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

1. 发明申请

WO1992022141A1 DATA COMPRESSION USING MULTIPLE LEVELS 审中-公开
标题翻译：使用多级数据压缩
公开(公告)号：WO1992022141A1
公开(公告)日：1992-12-10
申请号：PCT/US1992003932
申请日：1992-05-11
申请人： TRIADA, LTD.
发明人： TRIADA, LTD. , BUGAJSKI, Joseph, M. , RUSSO, James, T.
IPC分类号： H03M07/30
CPC分类号： G06F17/3061 , H03M7/3084 , H03M7/3088
摘要： A series of data processors (20a-20n) operate on a body of data to convert it to compressed form for storage or transmission. The processors are connected in series such that the output of one processor is the input to the next processor. Each processor has an associated memory (24a-24n). Each processor analyzes the serially input data elements in pairs to detect previously non-occurring pairs and stores those pairs in its memory. The output signal from each processor identifies the storage position in its associated memory of each input pair, whether or not the pair previously occurred. Each processor provides a single storage location output signal for each input pair of elements and maintains a count of the occurrences of each pair.
摘要翻译：一系列数据处理器（20a-20n）对一组数据进行操作，将其转换为压缩形式用于存储或传输。处理器串联连接，使得一个处理器的输出是下一个处理器的输入。每个处理器具有相关联的存储器（24a-24n）。每个处理器成对地分析串行输入数据元素以检测先前不存在的对并将这些对存储在其存储器中。来自每个处理器的输出信号识别每个输入对的关联存储器中的存储位置，无论该对是否先前发生。每个处理器为每个输入元件对提供单个存储位置输出信号，并保持每对的出现次数。

2. 发明授权

US5983232A Virtual structured information system 有权
标题翻译：虚拟结构化信息系统
公开(公告)号：US5983232A
公开(公告)日：1999-11-09
申请号：US162186
申请日：1998-09-28
申请人： Tao Zhang
发明人： Tao Zhang
IPC分类号： G06F17/30
CPC分类号： G06F17/30982 , Y10S707/99943
摘要： A virtual structured information system or a virtual database is developed and presented in the framework of an information theory for multiple source information systems such as databases. A virtual tree structure is built from virtual nodes in main memory which contain no raw data. The virtual nodes and virtual trees provide general non-data virtual structure, like cross-table nodes, for systematic information manipulations such as on-line analytical processing in a structured information system.
摘要翻译：虚拟结构化信息系统或虚拟数据库是在诸如数据库等多种源信息系统的信息理论框架下开发出来的。虚拟树结构由主内存中的虚拟节点构建，不包含原始数据。虚拟节点和虚拟树提供了一般的非数据虚拟结构，如跨表节点，用于系统信息处理，如结构化信息系统中的在线分析处理。

3. 发明授权

US5592667A Method of storing compressed data for accelerated interrogation 失效
标题翻译：存储用于加速询问的压缩数据的方法
公开(公告)号：US5592667A
公开(公告)日：1997-01-07
申请号：US336942
申请日：1994-11-10
申请人： Joseph M. Bugajski
发明人： Joseph M. Bugajski
IPC分类号： G06F17/30 , H03M7/30 , G06F7/00 , G06F12/00
CPC分类号： G06F17/3061 , H03M7/3084 , H03M7/3088 , Y10S707/99943
摘要： A method of data compression includes means to accelerate a direct query thereof. Input data are transformed into a multilevel n-ary tree structure wherein each leaf node corresponds to the creation of a memory storing unique occurrences of a particular data body, and each non-leaf node corresponds to a memory storing unique occurrences associated with its child nodes, whether leaf or non-leaf types. To accelerate a determination as to the solution of a query of the data, one or more pointers are further stored at each memory level, the pointers at least including those used to identify the parent of each child node and the children of each parent. In the preferred embodiment additional pointers are further stored in conjunction with each non-leaf node, these being used to identify other locations corresponding to unique occurrences derived through the same child nodes.
摘要翻译：数据压缩的方法包括加速其直接查询的手段。输入数据被转换为多级n元树结构，其中每个叶节点对应于存储特定数据体的唯一出现的存储器的创建，并且每个非叶节点对应于存储与其子节点相关联的唯一出现的存储器，无论是叶类还是非叶型。为了加速对数据查询的解决的确定，在每个存储器级别进一步存储一个或多个指针，指针至少包括用于标识每个子节点的父节点和每个父节点的子节点的指针。在优选实施例中，附加指针还与每个非叶节点相结合存储，这些指针用于标识对应于通过相同子节点导出的唯一出现的其他位置。

4. 发明授权

US6018734A Multi-dimensional pattern analysis 有权
标题翻译：多维模式分析
公开(公告)号：US6018734A
公开(公告)日：2000-01-25
申请号：US162187
申请日：1998-09-28
申请人： Tao Zhang , K. R. Raghavan
发明人： Tao Zhang , K. R. Raghavan
IPC分类号： G06F17/30
CPC分类号： G06F17/30982 , Y10S707/99933
摘要： A pattern recognition method applicable to unique associated pattern recognition in a structured information system or structured database is presented. The process may be used to find patterns in a column which are associated with unique data values in another column, or to find the number of unique values in the second column which are paired with the same associated pattern in the first column. The technique is easily extended to more general cases in which both the condition field and the associated pattern field may be two groups of fields.
摘要翻译：提出了一种适用于结构化信息系统或结构化数据库中唯一相关模式识别的模式识别方法。该过程可以用于查找与另一列中的唯一数据值相关联的列中的模式，或者找到第二列中与第一列中的相同关联模式配对的唯一值的数量。该技术容易地扩展到更一般的情况，其中条件字段和关联模式字段都可以是两组字段。

5. 发明公开

EP0588921A4 DATA COMPRESSION USING MULTIPLE LEVELS. 失效
标题翻译：数据压缩使用多个级别。
公开(公告)号：EP0588921A4
公开(公告)日：1995-04-19
申请号：EP92913110
申请日：1992-05-11
申请人： TRIADA LTD
发明人： BUGAJSKI JOSEPH M , RUSSO JAMES T
IPC分类号： G06F5/00 , G06F17/30 , H03M7/30 , H03M7/42
CPC分类号： G06F17/3061 , H03M7/3084 , H03M7/3088
摘要： A series of data processors (20a-20n) operate on a body of data to convert it to compressed form for storage or transmission. The processors are connected in series such that the output of one processor is the input to the next processor. Each processor has an associated memory (24a-24n). Each processor analyzes the serially input data elements in pairs to detect previously non-occurring pairs and stores those pairs in its memory. The output signal from each processor identifies the storage position in its associated memory of each input pair, whether or not the pair previously occurred. Each processor provides a single storage location output signal for each input pair of elements and maintains a count of the occurrences of each pair.

6. 发明专利

CA2103445A1 DATA COMPRESSION USIN MULTIPEL LEVELS 未知
公开(公告)号：CA2103445A1
公开(公告)日：1992-11-30
申请号：CA2103445
申请日：1992-05-11
申请人： TRIADA LTD
发明人： BUGAJSKI JOSEPH M , RUSSO JAMES T
IPC分类号： G06F5/00 , G06F17/30 , H03M7/30 , H03M7/42
摘要： 2103445 9222141 PCTABS00018 A series of data processors (20a-20n) operate on a body of data to convert it to compressed form for storage or transmission. The processors are connected in series such that the output of one processor is the input to the next processor. Each processor has an associated memory (24a-24n). Each processor analyzes the serially input data elements in pairs to detect previously non-occurring pairs and stores those pairs in its memory. The output signal from each processor identifies the storage position in its associated memory of each input pair, whether or not the pair previously occurred. Each processor provides a single storage location output signal for each input pair of elements and maintains a count of the occurrences of each pair.

7. 发明授权

US5966709A Method of optimizing an N-gram memory structure 失效
标题翻译：优化N-gram记忆体结构的方法
公开(公告)号：US5966709A
公开(公告)日：1999-10-12
申请号：US939023
申请日：1997-09-26
申请人： Tao Zhang , Joseph M. Bugajski , K. R. Raghavan
发明人： Tao Zhang , Joseph M. Bugajski , K. R. Raghavan
IPC分类号： G06F17/30 , H03M7/30
CPC分类号： H03M7/3084 , Y10S707/99933 , Y10S707/99942
摘要： By placing a low cardinality node or a leaf in a lower level, and a high cardinality node or a leaf at a higher level, an optimal memory structure is automatically generated which yields the best compression within N-gram technology. After making an initial list of parallel streams or fields, the streams are ordered in accordance with increasing cardinality. Adjacent streams (fields), or nodes, are paired, and the children of the resulting node are eliminated from the list, while a new parent node is added to the list. The resulting new list is re-arranged from right to left as a function of increasing cardinality, and the pairing steps are repeated until a single root node is remains for the final memory structure.
摘要翻译：通过将低基数节点或叶片放置在较低级别，以及高基数节点或较高级别的叶片，将自动生成最佳存储器结构，从而在N-gram技术中产生最佳压缩。在制作并行流或字段的初始列表之后，流将按照增加的基数进行排序。相邻的流（字段）或节点被配对，生成的节点的子节点从列表中删除，而新的父节点被添加到列表中。所产生的新列表作为增加基数的函数从右到左重新布置，并且重复配对步骤，直到为最终存储器结构保留单个根节点。

8. 发明授权

US5293164A Data compression with pipeline processor having separate memories 失效
标题翻译：具有分离存储器的流水线处理器的数据压缩
公开(公告)号：US5293164A
公开(公告)日：1994-03-08
申请号：US978360
申请日：1992-11-18
申请人： Joseph M. Bugajski , James T. Russo
发明人： Joseph M. Bugajski , James T. Russo
IPC分类号： G06F5/00 , G06F17/30 , H03M7/30 , H03M7/42
CPC分类号： G06F17/3061 , H03M7/3084 , H03M7/3088
摘要： The compression system includes a series of pipelined data processors. Each processor has an associated memory. The body of digital data is applied serially to the first processor in the chain. The first processor analyzes pairs of data elements in its incoming signal to detect the occurrence of previously non-occurring sequences and stores those sequences in its associated memory. The output signal from the processor identifies the storage position in its associated memory of each pair of data elements in its input, whether or not those sequences have previously occurred in the data stream. Subsequent processors work with storage location signals only. Each processor provides a single output location signal for each pair of signals in its input. Each processor also determines the number of times that each incoming sequences has occurred and stores that number in association with each stored pair. A hashing table created by each processor and stored in its associated memory is used to segregate the stored pairs into groups having common lower significant figures to simplify the task of determining whether a pair of elements in the input has previously been stored. Pointers stored with each unique pair link the pairs in each hashed sequence in the order of their frequency of occurrence in the incoming data stream so that the incoming elements may be compared with the previously stored elements in the order of probability of occurrence of each pair in the data stream.
摘要翻译：压缩系统包括一系列流水线数据处理器。每个处理器都有一个关联的内存。数字数据的主体被串行地应用到链中的第一处理器。第一处理器在其输入信号中分析数据元素对以检测先前不发生的序列的发生，并将这些序列存储在其相关联的存储器中。来自处理器的输出信号识别其输入中每对数据元素的关联存储器中的存储位置，无论这些序列是否先前已经在数据流中发生。后续处理器仅与存储位置信号一起使用。每个处理器在其输入中为每对信号提供单个输出位置信号。每个处理器还确定每个输入序列已经发生的次数，并存储与每个存储的对相关联的该数量。由每个处理器创建并存储在其相关联的存储器中的散列表用于将存储的对分离成具有共同较低有效图形的组，以简化确定输入中的一对元素是否先前已被存储的任务。存储有每个唯一对的指针按照其在输入数据流中的发生频率的顺序将每个散列序列中的对链接起来，使得可以将输入元素与先前存储的元素以每对的出现概率的顺序进行比较数据流。

9. 发明授权

US5245337A Data compression with pipeline processors having separate memories 失效
标题翻译：具有独立存储器的管道处理器的数据压缩
公开(公告)号：US5245337A
公开(公告)日：1993-09-14
申请号：US706949
申请日：1991-05-29
申请人： Joseph M. Bugajski , James T. Russo
发明人： Joseph M. Bugajski , James T. Russo
IPC分类号： G06F5/00 , G06F17/30 , H03M7/30 , H03M7/42
CPC分类号： G06F17/3061 , H03M7/3084 , H03M7/3088
摘要： The compression system includes a series of piplined data processors. Each processor has an associated memory. The body of digital data is applied serially to the first processor in the chain. The first processor analyzes pairs of data elements in its incoming signal to detect the occurrence of previously non-occurring sequences and stores those sequences in its associated memory. The output signal from the processor identifies the storage position in its associated memory of each pair of data elements in its input, whether or not those sequences have previously occurred in the data stream. Subsequent processors work with storage location signals only. Each processor provides a single output location signal for each pair of signals in its input. Each processor also determines the number of times that each incoming sequence has occurred and stores that number in association with each stored pair. A hashing table created by each processor and stored in its associated memory is used to segregate the stored pairs into groups having common lower significant figures to simplify the task of determining whether a pair of elements in the input has previously been stored. Pointers stored with each unique pair link the pairs in each hashed sequence in the order of their frequency of occurrence in the incoming data stream so that the incoming elements may be compared with the previously stored elements in the order of probability of occurrence of each pair in the data stream.
摘要翻译：该压缩系统包括一系列线性化数据处理器。每个处理器都有一个关联的内存。数字数据的主体被串行地应用到链中的第一处理器。第一处理器在其输入信号中分析数据元素对以检测先前不发生的序列的发生，并将这些序列存储在其相关联的存储器中。来自处理器的输出信号识别其输入中每对数据元素的关联存储器中的存储位置，无论这些序列是否先前已经在数据流中发生。后续处理器仅与存储位置信号一起使用。每个处理器在其输入中为每对信号提供单个输出位置信号。每个处理器还确定每个传入序列已经发生的次数，并且存储与每个存储的对相关联的数字。由每个处理器创建并存储在其相关联的存储器中的散列表用于将存储的对分离成具有共同较低有效图形的组，以简化确定输入中的一对元素是否先前已被存储的任务。存储有每个唯一对的指针按照其在输入数据流中的发生频率的顺序将每个散列序列中的对链接起来，使得可以将输入元素与先前存储的元素以每对的出现概率的顺序进行比较数据流。

10. 发明公开

EP1016008A1 METHOD OF OPTIMIZING AN N-GRAM MEMORY STRUCTURE 审中-公开
标题翻译： METHOD FOR优化n-gram中存储器结构的
公开(公告)号：EP1016008A1
公开(公告)日：2000-07-05
申请号：EP98948158.5
申请日：1998-09-10
申请人： TRIADA, LTD.
发明人： ZHANG, Tao , BUGAJSKI, Joseph, M. , RAGHAVAN, K., R.
IPC分类号： G06F17/30 , G06F7/00
CPC分类号： H03M7/3084 , Y10S707/99933 , Y10S707/99942
摘要： By placing a low cardinality node (1084) or a leaf in a lower level (841), and a high cardinality node (620) or a leaf at a higher level (409), an optimal memory structure is automatically generated which yields the best compression within N-gram technology. After making an initial list of parallel streams or fields, the streams are ordered in accordance with increasing cardinality. Adjacent streams (fields), or nodes (L and LC), are paired (4383), and the children of the resulting node are eliminated from the list, while a new parent node (5432) is added to the list. The resulting new list (112) is re-arranged from right to left (817) as a function of increasing cardinality, and the pairing steps are repeated until a single root node remains for the final memory (8554).

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式