专利快速检索-快速检索全球专利，免费商用专利数据库-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. 发明公开

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.

3. 发明专利

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.

4. 发明公开

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).

5. 发明公开

EP0588921A1 DATA COMPRESSION USING MULTIPLE LEVELS 失效
标题翻译：数据压缩使用多个级别。
公开(公告)号：EP0588921A1
公开(公告)日：1994-03-30
申请号：EP92913110.0
申请日：1992-05-11
申请人： TRIADA, LTD.
发明人： BUGAJSKI, Joseph, M. , RUSSO, James, T.
IPC分类号： G06F5 , G06F17 , H03M7
CPC分类号： G06F17/3061 , H03M7/3084 , H03M7/3088
摘要： Série de processeurs de données (20a-20n) exploitant une programmation de données pour la convertir en une forme condensée pour le stockage ou la transmission. Les processeurs sont reliés en série de telle façon que la sortie d'un processeur représente l'entrée du processeur suivant. Chaque processeur comporte une mémoire associée (24a-24n). Chaque processeur analyse par paire les éléments de donnés d'entrée séquentiellement afin de détecter les paires non présentes précédemment et les mémorise. Le signal de sortie de chaque processeur identifie la position de stockage dans la mémoire associée de chaque paire d'entrées, que la paire ait été présente ou non précédemment. Chaque processeur fournit un signal unique de sortie de position de mémoire pour chaque paire d'entrées d'éléments et tient un compte des occurrences de chaque paire.

6. 发明专利

AU5239499A Methods of deleting information in n-gram tree structures 未知
公开(公告)号：AU5239499A
公开(公告)日：2000-02-21
申请号：AU5239499
申请日：1999-07-28
申请人： TRIADA LTD
发明人： ZHANG TAO
IPC分类号： G06F17/30

7. 发明专利

AU9589298A Virtual structured information system 未知
公开(公告)号：AU9589298A
公开(公告)日：1999-04-23
申请号：AU9589298
申请日：1998-09-29
申请人： TRIADA LTD
发明人： ZHANG TAO
IPC分类号： G06F17/30
摘要： 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.

8. 发明专利

CA2304478A1 METHOD OF OPTIMIZING AN N-GRAM MEMORY STRUCTURE 未知
公开(公告)号：CA2304478A1
公开(公告)日：1999-04-08
申请号：CA2304478
申请日：1998-09-10
申请人： TRIADA LTD
发明人： RAGHAVEN K R , ZHANG TAO , BUGAJSKI JOSEPH M
IPC分类号： G06F17/30 , H03M7/30 , G06F7/00
摘要： 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 rearranged 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).

9. 发明专利

AU9672298A Multi-dimensional pattern analysis 未知
公开(公告)号：AU9672298A
公开(公告)日：1999-04-23
申请号：AU9672298
申请日：1998-09-29
申请人： TRIADA LTD
发明人： ZHANG TAO , RAGHAVAN R K
IPC分类号： G06F17/30
摘要： 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.

10. 发明专利

AU9478998A Method of optimizing an n-gram memory structure 未知
公开(公告)号：AU9478998A
公开(公告)日：1999-04-23
申请号：AU9478998
申请日：1998-09-10
申请人： TRIADA LTD
发明人： ZHANG TAO , BUGAJSKI JOSEPH M , RAGHAVAN K R
IPC分类号： G06F17/30 , H03M7/30 , G06F7/00
摘要： 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.

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式