Abstract: A method of database update processing for updating efficiently database index keys, when new database index keys are supplied to replace index keys already in the database, generates a delta data between the new and old data comprising insert and delete keys by delete processing from a coupled node tree holding the index keys in the old data using index keys of new data as delete keys, and generates new data by delete and insert processing from and into a coupled node tree holding index keys in old data as index keys using the delete keys and insert keys of the delta data.

Abstract: The sort processing of keys to be sorted, which keys are expressed as bit strings involves a classification processing. In the classification processing, a bit string comparison between a reference key and a key which is an object of the classification is performed, and a difference bit position is obtained that is the bit position of the first bit that differs in the bit string comparison and the keys to be sorted are classified by the difference bit position into key groups with the same difference bit position.

Abstract: A code ID range table holding code ID ranges for each code and a next code ID table holding next code IDs, which are the code ID located next to each code ID, are created. Code ID ranges of codes configuring a search code string are read out from the code ID range table for the search target code string, and the stored next code ID corresponding to a code ID included in the code ID range of the head code in the search code string is read out from the next code ID table while the stored next code IDs corresponding to the next codes are successively read out from the next code ID table, and the next code ID read out from the next code ID table is verified whether it is included in the code ID range read out from the code ID range table.

Abstract: To perform a path finding for a network by traversing mutually connected links by means of a link destination table that is a data configuration for representing the network. The link destination table contains, for link IDs of each of the links in the network, a node ID of a node on one side of the link, destination link IDs for the node on one side which are link IDs of other links to that node, a node ID of the node on the other side of the link, destination link IDs of the node on the other side which are link IDs of other links to that node, and interval costs.

Abstract: A storage area management method for a data storage apparatus partitions an acquired storage area into storage areas with differing power-of-2 sizes and manages each of them. Also, a storage area allocation method receives an allocation request for a storage area that includes a requested allocation size, and acquires an available storage area whose size is the smallest power-of-2 size encompassing the requested allocation size, and obtains a binary expression of the requested allocation size, and in response to the received allocation request, allocates a contiguous storage area comprised of storage areas each of whose size is a power of 2 of a value of a bit position wherein a 1 is set in the binary expression.

Abstract: Using a tree configuration wherein node groups of four or more nodes composed of combinations of branch nodes, leaf nodes or empty nodes are linked into a tree form, a bit string search by a search key string is enabled by repeatedly linking to one of the nodes of a node group to which a primary node belongs in response to the bit values of keys of the search key string at the discrimination bit position included in the branch node.

Abstract: An index key is a key string formed of three or more keys whose tail-end key is unique, and a search key string for a bit string search has a unique key as its tail-end key. A branch node includes a search key sequence number expressing the position information of a key in the search key string to be used in the bit string comparison during the bit string search and the discrimination bit position for that key. Search for index keys is performed by extracting from the search key string the key with the search key sequence number in the branch node and repeatedly linking to one of the nodes of a node pair of the link target in response to the bit value at the discrimination bit position of that key until the leaf node corresponding to that index key is reached.

Abstract: A method of database update processing for updating efficiently database index keys, when new database index keys are supplied to replace index keys already in the database, generates a delta data between the new and old data comprising insert and delete keys by delete processing from a coupled node tree holding the index keys in the old data using index keys of new data as delete keys, and generates new data by delete and insert processing from and into a coupled node tree holding index keys in old data as index keys using the delete keys and insert keys of the delta data.

Abstract: To realize a high speed merge sort method by applying a coupled node tree, which method extracts a smallest or largest key from a plurality of sorted key storage areas in each of which is stored keys comprised of bit strings that are sorted, and generates a coupled node tree for merge while adding a processing source identifier that identifies the sorted storage area wherefrom the key has been extracted, and repeats the actions of writing out into the merged key storage area a key being obtained by a minimum or maximum value search on the coupled node tree and deleting the key, and inserting into the coupled node tree a key by extracting the key from one of the plurality of sorted key storage areas.

Abstract: To provide a method that lessens the reduction in efficiency of processing using a coupled node tree even if the scale of the coupled node tree grows large. Is stored a termination node, whose discrimination bit position has a value smaller than 0, in a search path stack that holds the search history while successively storing therein branch nodes that have been traversed in the search path. The coupled node indicator of the stored branch node is converted to a value wherein a 1 is added if the link target is node [1].

Abstract: Provided is a search method which is appropriate for handling a don't-care bit. A coupled node tree comprises a root node and a node pair, the node pair being a branch node and leaf node, or a pair of branch nodes, or a pair of leaf nodes located in adjacent storage areas. The branch node includes a discrimination bit position of a search key for the bit string search, which key is encoded so as to distinguish between don't-care bits and significant bits, and position information indicating a position of a primary node, which is one node of a node pair of a link target. A leaf node includes an index key which is a bit string in the status of either being or not being encoded.

Abstract: A coupled node tree comprises a root node and a node pair, the node pair being a branch node and leaf node, or a pair of branch nodes, or a pair of leaf nodes arranged in adjacent storage areas. The branch node includes a discrimination bit position of the search key and the first position information of a primary node, one node of a node pair of a link target. The leaf node includes the second position information of the storage area holding an index key that is the target of a search. According to a bit value of the search key of a discrimination bit position in the branch node, repeated linking to a primary node of a node pair of the link target or a node at a position in a memory area adjacent thereto until a leaf node is reached.

Abstract: A coupled node tree has a root node and a node pair, the node pair being a branch node, which includes position information of a link target node pair, and a leaf node, which includes a search target index key, or a pair of branch nodes, or a pair of leaf nodes located in adjacent storage areas. The nodes of the coupled node tree are backed up in a depth precedence search sequence. The coupled node tree is restored by repeating the following process: reading out the nodes in the sequence they are backed up, storing in a stack the position information of the node to be restored, successively restoring child nodes as long as branch nodes are encountered, restoring a leaf node which is read out and then, tracing back up the stack, a decision being made as to which node is next to be restored.

Abstract: A coupled node tree comprises a root node and a node pair, the node pair being a branch node and leaf node, or a pair of branch nodes, or a pair of leaf nodes located in adjacent storage areas. The branch node includes a discrimination bit position of the search key and a position information of a primary node, which is one node of a node pair of a link target. The leaf node includes an index key that is a bit string that is the target of a search. A coupled node tree is searched using a longest-match/shortest-match search key and the longest-match/shortest-match node is determined through a comparison of the difference bit position between the index key resulting from the search and the longest-match/shortest-match search key and the discrimination bit position of a branch node on the search path memorized when the search is performed.

Abstract: To provide a method that minimizes efficiency reductions in processing coupled node trees even if the size of the coupled node tree grows large. In basic searching or maximum or minimum value searching, the search history, not only the address information of the storage area wherein a node is stored but also the discrimination bit position of branch nodes traversed in the search path, is stored in the search path stack.

Abstract: The minimum value or the maximum value of the index keys of a coupled node tree of a processing source is determined, and the index keys are successively deleted until the index key that is to be the splitting point is reached, the deleted index keys being inserted into the coupled node tree of the processing target, thereby splitting the coupled node tree. Deletion processing is done of one coupled node tree, taking as the processing source in the above-noted splitting method, and insertion processing is done of the other, taken as the processing target, thereby conjoining the coupled node trees.

Abstract: A structured data management system which provides services concerning a structured electronic data object. In this system, a structured data storage unit stores a plurality of structured data objects associated with each other. Each structured data object can be represented as a tree structure constructed by a plurality of data elements, or nodes. Further, the individual nodes of a tree structure are associated with their respective process scripts. Through an input/output interface unit, a message addressed to a certain destination node arrives. Upon receipt of the message, a structured data processing unit identifies the destination node by tracing the tree structure of a particular structured data object where the destination node resides. The structured data processing unit then executes a process script associated with the destination node being identified.

Abstract: A structured data management system capable of easily changing the definition of a logical structure and controlling semantics described in data adapted to the defined structure as intended by persons who have defined the logical structure. A contents model defines an internal structure of a contents description. The contents description describes data to be managed according to the contents model. An operation description is coupled to the contents model and manipulates data in the contents description depending on the structure of the data in the contents description. The operation description functions to define semantics of each element of the structure defined by the contents model. An operation description executing unit executes the operation description coupled to the contents model. A structure managing unit verifies and manages the structure of the contents description according to the contents model.

Abstract: In an information management system, individual entity information items related to one another are assigned unique identifiers. A smaller number of pointers are used to define high, low, front and rear-rank links among the entity information items. In an entity management table are placed records having a pointer to an entity information item and an identifier of the entity information item. In a structure management table are placed records representing types of the entity information items and having pointers to high, low, front and rear-rank records. There is further provided an identifier management table that relates the types of the entity information items to the identifiers. Use of these tables permits data retrieval in four directions of upward, downward, forward and rearward.

Abstract: A structured database system includes a first unit for obtaining a structure definition frame of a document showing a structure of the document, and a second unit for storing body data of the document in a database together with the structure definition frame.