Patent application number | Description | Published |
20090138429 | Sructure Based Storage, Query, Update and Transfer of Tree-Based Documents - A method for storing data, comprises representing the data as a tree structure, calculating a structure ID for the tree structure, the structure ID being a representation of the tree structure and independent of node names and node values of the tree structure, and storing a mapping of the structure ID to the tree structure. | 05-28-2009 |
20090138491 | Composite Tree Data Type - A method of representing tree-structure based data. The method comprises the steps of uncomposing tree-structure based data into a plurality of elements, the plurality of elements being of different types, storing the elements in a set, the set containing one or more of each element type, and storing one or more logical compositions with the set, each logical composition specifying at least one of each element type. Each logical composition is reducible to a combination of specific elements of each element type representing a specific instance of tree-structure based data. | 05-28-2009 |
20090138503 | Structure Based Storage, Query, Update and Transfer of Tree-Based Documents - A method for storing data, comprises representing the data as a tree structure, calculating a structure ID for the tree structure, the structure ID being a representation of the tree structure and independent of node names and node values of the tree structure, and storing a mapping of the structure ID to the tree structure. | 05-28-2009 |
20090144293 | Method of Representing Relationships Between Data - Establishing relationships between data instances and characteristics of the data by associating each of data instance with at least one qualifying schema node. A unique relationship ID is assigned to relationships between any two nodes of the qualifying schema which are both associated with the same data instances. The relationship IDs can be sorted and queried. The qualifying schema, at least some of which are instantiated, serves the dual purpose of qualifying the data instances as well as establishing relationships between them. Relationships between instances can be changed by moving the instances to other nodes of the qualifying schema. | 06-04-2009 |
20090222473 | METHOD FOR ENCODING, TRAVERSING, MANIPULATING AND QUERYING A TREE - Disclosed is a method of encoding a tree structure and associated methods of traversing, manipulating and querying the tree. As tree structures are widely used in the field of computer science (as document formats like XML, as object trees of object-oriented programming languages, as XML and object databases etc), genetic analysis and other fields of science, the methods disclosed in this invention will be advantageous in analysing and indexing tree structures. Other embodiments are also disclosed. | 09-03-2009 |
20100332546 | Structure Based Storage, Query, Update and Transfer of Tree-Based Documents - A method for storing data, comprises representing the data as a tree structure, calculating a structure ID for the tree structure, the structure ID being a representation of the tree structure and independent of node names and node values of the tree structure, and storing a mapping of the structure ID to the tree structure. | 12-30-2010 |
20120158790 | STRUCTURE BASED STORAGE, QUERY, UPDATE AND TRANSFER OF TREE-BASED DOCUMENTS - Data is represented as a tree structure. A structure identifier (ID) that mathematically defines a structure of the tree structure is calculated. The structure ID is a representation of the structure of the tree structure and is independent of node names and node values of the tree structure. A mapping of the structure ID to the tree structure is stored. | 06-21-2012 |
20120303671 | STRUCTURE BASED STORAGE, QUERY, UPDATE AND TRANSFER OF TREE-BASED DOCUMENTS - A numeric structure identifier (ID) that represents a tree structure of a document that includes data is received. The numeric structure ID is calculated as a product of factors, each of a form of P raised to a power of m, where p is a prime number corresponding to a node ID of a node represented by the node ID and m is a number of children of the node represented by the node ID. A first numeric node ID that represents a first node of the tree structure of the document is received. The tree structure of the document corresponding to the numeric structure ID is identified. The data of the document is stored as the tree structure identifiable by the numeric structure ID. The first node within the tree structure corresponding to the first numeric node ID is identified. A value of the identified first node is returned. | 11-29-2012 |