Patents Assigned to S. Grants Co., Ltd.
-
Publication number: 20120284279Abstract: An index data configuration adapted to a code-string search method for a structured code string having data codes, first separator codes that separate a data code or a data code string and second separator codes that divide a code string into partial code strings. The configuration has a code ID range table holding the code ID ranges for each code and a next code ID table holding next code IDs. Using the configuration, a partial code string is searched for in the search target code string by a first search code string consisting of the data code or the data code string and a first separator code. Next, using a second search code string consisting of first separator codes, the data code or the data code string separated by each of the first separator codes is searched from the found partial code string.Type: ApplicationFiled: July 18, 2012Publication date: November 8, 2012Applicant: S. Grants Co., Ltd.Inventors: Toshio Shinjo, Mitsuhiro Kokubun
-
Publication number: 20120239664Abstract: To increase space efficiency of a coupled node tree, a branch node does not have an area that holds an array element number of an array element wherein is stored the primary node of the node pair that is the link target, and the root node is disposed in an array element with a node location number 1, and the primary node is disposed in an array element whose node location number is twice the node location number of the branch node. The node location number of an array element wherein is disposed a link target node is obtained by adding the bit value in the search key at the discrimination bit position for the link source branch node to twice the node location number of the branch node.Type: ApplicationFiled: May 30, 2012Publication date: September 20, 2012Applicant: S. Grants Co., Ltd.Inventors: Toshio Shinjo, Mitsuhiro Kokubun
-
Patent number: 8250076Abstract: 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.Type: GrantFiled: October 19, 2009Date of Patent: August 21, 2012Assignee: S. Grants Co., Ltd.Inventors: Toshio Shinjo, Mitsuhiro Kokubun
-
Patent number: 8250089Abstract: 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].Type: GrantFiled: March 12, 2010Date of Patent: August 21, 2012Assignee: S. Grants Co., Ltd.Inventors: Toshio Shinjo, Mitsuhiro Kokubun
-
Publication number: 20120209855Abstract: When keys are to be classified into a plurality of blocks, to provide a classification method wherein the range of key values does not overlap and a method for distributing the classified keys by applying the art of a coupled-node tree. Keys are successively selected as classification keys from a key storage means holding the keys to be classified, and a classification tree, which is an application of a coupled-node tree, is generated by means of the classification keys, and the classification is done by making a correspondence between its leaf nodes and the keys to be classified into each of N blocks. The number of levels in the classification tree is constrained as a function of the block number N. A leaf node is extracted from the classification tree and the corresponding key is extracted as a classified key and distributed.Type: ApplicationFiled: April 26, 2012Publication date: August 16, 2012Applicant: S. Grants Co., Ltd.Inventors: TOSHIO SHINJO, Mitsuhiro Kokubun
-
Patent number: 8224861Abstract: 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.Type: GrantFiled: May 27, 2009Date of Patent: July 17, 2012Assignee: S. Grants Co., Ltd.Inventors: Toshio Shinjo, Mitsuhiro Kokubun
-
Patent number: 8214405Abstract: 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.Type: GrantFiled: October 19, 2009Date of Patent: July 3, 2012Assignee: S. Grants Co., Ltd.Inventors: Toshio Shinjo, Mitsuhiro Kokubun
-
Patent number: 8195667Abstract: 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.Type: GrantFiled: July 16, 2010Date of Patent: June 5, 2012Assignee: S. Grants Co., Ltd.Inventors: Toshio Shinjo, Mitsuhiro Kokubun
-
Patent number: 8190591Abstract: 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.Type: GrantFiled: July 22, 2009Date of Patent: May 29, 2012Assignee: S. Grants Co., Ltd.Inventors: Toshio Shinjo, Mitsuhiro Kokubun
-
Patent number: 8166043Abstract: 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.Type: GrantFiled: November 17, 2010Date of Patent: April 24, 2012Assignee: S. Grants Co., Ltd.Inventors: Toshio Shinjo, Koutaro Shinjo, legal representative, Mitsuhiro Kokubun
-
Publication number: 20120089806Abstract: To provide a technology that, regardless of the capacity of a storage device, enables its areas to be flexibly partitioned and managed, and, when a file is allocated to a region also, can also use its areas effectively by means of an efficient method. When a region size of a storage device is expressed as the sum of mutually differing power-of-2 values, and areas whose size is one of the power-of-2 sizes configuring that sum are taken to be master partitions, to partition the areas into partitions each of whose size is the size made by successively dividing each master partition in half and to generate an allocation table holding allocation information expressing the allocation status of each of the files that have partitions with each of the sizes included in the master partitions. To manage a region based on the allocation information stored in the allocation table.Type: ApplicationFiled: December 12, 2011Publication date: April 12, 2012Applicant: S. Grants Co., Ltd.Inventors: Makoto Yoshioka, Mitsuhiro Kokubun, Toshio Shinjo
-
Patent number: 8150856Abstract: Bit string searching apparatus using a coupled node tree with a root node and a node pair stored in adjacent areas that is formed by a branch node and a leaf node, branch nodes, or leaf nodes; the branch node including a discrimination bit position in the search key and information indicating a position of a primary node that is one node of a node pair; the leaf node including an index key formed by a bit string; from the root node of an arbitrary subtree of the coupled node tree, linking is repeated based on the search key's bit value at the discrimination bit position and information indicating a position of a primary node until a leaf node is reached; an index key stored in the leaf node is obtained as a search result key of the subtree by means of the search key.Type: GrantFiled: April 24, 2009Date of Patent: April 3, 2012Assignee: S. Grants Co., Ltd.Inventor: Toshio Shinjo
-
Patent number: 8145665Abstract: 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.Type: GrantFiled: December 31, 2009Date of Patent: March 27, 2012Assignee: S. Grants Co., Ltd.Inventors: Toshio Shinjo, Mitsuhiro Kokubun
-
Patent number: 8103697Abstract: 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.Type: GrantFiled: June 18, 2010Date of Patent: January 24, 2012Assignee: S. Grants Co., Ltd.Inventors: Toshio Shinjo, Mitsuhiro Kokubun
-
Patent number: 8073874Abstract: A bit string searching apparatus has a coupled node tree, having 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 in adjacent storage areas, the branch node including a search key discrimination bit position and information indicating a position of one node of a node pair of a link target, and the leaf node including an index key that is a bit string that is the target of a search, wherein a search for an index key from the root node to a branch node using a search key is executed by repeatedly and successively linking to one node of a node pair of a link target, according to a bit value of a search key at the discrimination bit position in the branch node, until reaching the leaf node.Type: GrantFiled: June 15, 2007Date of Patent: December 6, 2011Assignee: S. Grants Co., Ltd.Inventor: Toshio Shinjo
-
Publication number: 20110258205Abstract: 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.Type: ApplicationFiled: June 22, 2011Publication date: October 20, 2011Applicant: S. Grants Co., Ltd.Inventors: Toshio Shinjo, Koutaro Shinjo, Mitsuhiro Kokubun
-
Publication number: 20110191756Abstract: 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.Type: ApplicationFiled: March 28, 2011Publication date: August 4, 2011Applicant: S. Grants Co., Ltd.Inventors: Toshio Shinjo, Mitsuhiro Kokubun
-
Publication number: 20110145538Abstract: 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.Type: ApplicationFiled: February 17, 2011Publication date: June 16, 2011Applicant: S. Grants Co., Ltd.Inventors: Makoto Yoshioka, Mitsuhiro Kokubun, Toshio Shinjo, Koutaro Shinjo
-
Publication number: 20110066638Abstract: 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.Type: ApplicationFiled: November 17, 2010Publication date: March 17, 2011Applicant: S. Grants Co., Ltd.Inventors: Toshio Shinjo, Koutaro Shinjo, Mitsuhiro Kokubun
-
Publication number: 20100287193Abstract: 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.Type: ApplicationFiled: July 16, 2010Publication date: November 11, 2010Applicant: S. Grants Co., Ltd.Inventors: Toshio Shinjo, Mitsuhiro Kokubun