Virtual structured information system
First Claim
Patent Images
1. A method of building a virtual information structure with respect to an associative memory database, comprising the steps of:
- providing an input tree structure representative of the associative memory database, the input structure including a plurality of memory nodes;
building a number of unstructured virtual information sources at a given memory node in an existing memory tree structure; and
building a virtual structure from the unstructured virtual sources.
16 Assignments
0 Petitions
Accused Products
Abstract
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.
94 Citations
8 Claims
-
1. A method of building a virtual information structure with respect to an associative memory database, comprising the steps of:
-
providing an input tree structure representative of the associative memory database, the input structure including a plurality of memory nodes; building a number of unstructured virtual information sources at a given memory node in an existing memory tree structure; and building a virtual structure from the unstructured virtual sources. - View Dependent Claims (2, 3, 4)
-
-
5. A method of creating a virtual node in an information tree structure, comprising the steps of:
-
identifying two nodes a and b in an existing information tree structure, the two nodes having a common ancestor node na, wherein; a) the closest common ancestor node has a child node that is an ancestor node of only one node of the two nodes a and b, and b) the other child node of the common ancestor node na is an ancestor node of the other one of the two nodes a and b; recalling the memory tokens, defined as the memory addresses of unique data values, of node a at the memory of node n1, thereby replacing the original tokens stored at the n1 memory with the recalled tokens of node a using one or more look-up tables; recalling the memory tokens of node b at the memory of node nr, thereby replacing the original tokens stored at the nr memory with the recalled tokens of node a using one or more look-up tables; removing the redundancy of the list indices, if any such redundancy is present, by combining all the lists that have the same list index, so that all the new lists have unique indices; removing the redundancy of the list elements, if any such redundancy is present, by eliminating repetitious elements and storing a count the repeats in each new list, the result after redundancy removal being a virtual node memory structure identical to a real node as if it were built from the output streams of two leaf nodes a and b. - View Dependent Claims (6, 7, 8)
-
Specification