Patents Assigned to Triada, Ltd.
-
Patent number: 6018734Abstract: 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.Type: GrantFiled: September 28, 1998Date of Patent: January 25, 2000Assignee: Triada, Ltd.Inventors: Tao Zhang, K. R. Raghavan
-
Patent number: 5983232Abstract: 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.Type: GrantFiled: September 28, 1998Date of Patent: November 9, 1999Assignee: Triada, Ltd.Inventor: Tao Zhang
-
Patent number: 5966709Abstract: 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.Type: GrantFiled: September 26, 1997Date of Patent: October 12, 1999Assignee: Triada, Ltd.Inventors: Tao Zhang, Joseph M. Bugajski, K. R. Raghavan
-
Patent number: 5592667Abstract: 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.Type: GrantFiled: November 10, 1994Date of Patent: January 7, 1997Assignee: Triada, Ltd.Inventor: Joseph M. Bugajski
-
Patent number: 5293164Abstract: 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.Type: GrantFiled: November 18, 1992Date of Patent: March 8, 1994Assignee: Triada, Ltd.Inventors: Joseph M. Bugajski, James T. Russo
-
Patent number: 5245337Abstract: 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.Type: GrantFiled: May 29, 1991Date of Patent: September 14, 1993Assignee: Triada, Ltd.Inventors: Joseph M. Bugajski, James T. Russo