{"search_session":{},"preferences":{"l":"en","queryLanguage":"en"},"patentId":"052-998-808-077-413","frontPageModel":{"patentViewModel":{"ref":{"entityRefId":"052-998-808-077-413","entityRefType":"PATENT"},"entityMetadata":{"linkedIds":{"empty":true},"tags":[],"collections":[],"notes":[],"inventorships":[],"privateCollections":[],"publicCollections":[],"privateNotes":[],"landscapeCollections":[],"landscapeNotes":[]},"document":{"record_lens_id":"052-998-808-077-413","lens_id":["052-998-808-077-413","173-118-536-713-090"],"doc_key":"US_20090019067_A1_20090115","created":"2016-01-15T10:41:29.986","docdb_id":55780343,"lens_internal":{"earliest_lens_id_created_time":"2016-01-15T10:41:29.986","last_modified":"2024-03-25T06:29:35.476","legacy_pub_key":"US_2009_0019067_A1","has_doc_lang":true,"has_biblio_lang":true,"has_all_title_lang":true,"has_all_abstract_lang":true,"has_all_claims_lang":true,"has_description_lang":true},"jurisdiction":"US","doc_number":"20090019067","kind":"A1","date_published":"2009-01-15","year_published":2009,"ids":["US_2009_0019067_A1","052-998-808-077-413","173-118-536-713-090","US_20090019067_A1_20090115","US","20090019067","A1","US20090019067A1","US20090019067","20090019067A1"],"lang":"en","publication_type":"PATENT_APPLICATION","application_reference":{"jurisdiction":"US","doc_number":"57119105","kind":"A","date":"2005-06-20"},"priority_claim":[{"jurisdiction":"JP","doc_number":"2004184497","kind":"A","date":"2004-06-23"},{"jurisdiction":"JP","doc_number":"2005011237","kind":"W","date":"2005-06-20"}],"priority_claim.source":"DOCDB","earliest_priority_claim_date":"2004-06-23","title":{"en":[{"text":"METHOD, APPARATUS, AND PROGRAM FOR INSERTING NODE","lang":"en","source":"DOCDB","data_format":"DOCDBA"}]},"title_lang":["en"],"has_title":true,"applicant":[{"name":"TURBO DATA LAB INC","residence":"JP","sequence":1,"app_type":"applicant"}],"applicant_count":1,"has_applicant":true,"inventor":[{"name":"FURUSHO SHINJI","residence":"JP","sequence":1}],"inventor_count":1,"has_inventor":true,"agent":[],"agent_count":0,"has_agent":false,"owner":[{"name":"TURBO DATA LABORATORIES INC","address":"1101-7, MATSUMI-CHO 4-CHOME, KANAGAWA-KU,, YOKOHAMA-SHI, KANAGAWA, 221-0005","country":"JP","sequence":1,"recorded_date":"2008-09-29","execution_date":"2007-01-17","is_current_owner":true}],"owner_count":1,"owner_all":[{"name":"TURBO DATA LABORATORIES INC","address":"1101-7, MATSUMI-CHO 4-CHOME, KANAGAWA-KU,, YOKOHAMA-SHI, KANAGAWA, 221-0005","country":"JP","sequence":1,"recorded_date":"2008-09-29","execution_date":"2007-01-17","is_current_owner":true}],"owner_all_count":1,"has_owner":true,"has_examiner":false,"class_ipcr":[{"symbol":"G06F17/30","version_indicator":"2006-01-01","class_symbol_position":"F","class_value":"I","action_date":"2009-01-15","class_status":"B","class_data_source":"H","generating_office":"US","sequence":1}],"class_ipcr.first_symbol":"G06F17/30","class_ipcr.later_symbol":[],"class_ipcr.inv_symbol":["G06F17/30"],"class_ipcr.add_symbol":[],"class_ipcr.source":"DOCDB","class_cpc":[{"symbol":"G06F16/2246","version_indicator":"2019-01-01","class_symbol_position":"F","class_value":"I","action_date":"2019-01-03","class_status":"B","class_data_source":"H","generating_office":"EP","sequence":1},{"symbol":"G06F16/2246","version_indicator":"2019-01-01","class_symbol_position":"F","class_value":"I","action_date":"2019-08-22","class_status":"B","class_data_source":"H","generating_office":"US","sequence":2}],"class_cpc_cset":[],"class_cpc.first_symbol":"G06F16/2246","class_cpc.later_symbol":[],"class_cpc.inv_symbol":["G06F16/2246","G06F16/2246"],"class_cpc.add_symbol":[],"class_cpc.source":"DOCDB","class_national":[{"symbol":"707/101","symbol_position":"F"},{"symbol":"X707E17009"}],"class_national.first_symbol":"707/101","class_national.later_symbol":["X707E17009"],"class_national.source":"DOCDB","reference_cited":[{"patent":{"num":1,"document_id":{"jurisdiction":"US","doc_number":"2008016074","kind":"A1","date":"2008-01-17","name":"BEN-DYKE ANDY D [GB], et al"},"lens_id":"002-350-174-687-651","category":[],"us_category":[],"cited_phase":"PRS","rel_claims":[],"sequence":1}},{"patent":{"num":2,"document_id":{"jurisdiction":"US","doc_number":"2008059507","kind":"A1","date":"2008-03-06","name":"NAJORK MARC A [US]"},"lens_id":"008-803-284-385-643","category":[],"us_category":[],"cited_phase":"PRS","rel_claims":[],"sequence":2}},{"patent":{"num":3,"document_id":{"jurisdiction":"US","doc_number":"2006106832","kind":"A1","date":"2006-05-18","name":"BEN-DYKE ANDY D [GB], et al"},"lens_id":"071-625-063-215-304","category":[],"us_category":[],"cited_phase":"PRS","rel_claims":[],"sequence":3}},{"patent":{"num":4,"document_id":{"jurisdiction":"US","doc_number":"6426750","kind":"B1","date":"2002-07-30","name":"HOPPE HUGUES H [US]"},"lens_id":"130-915-039-940-438","category":[],"us_category":[],"cited_phase":"PRS","rel_claims":[],"sequence":4}},{"patent":{"num":5,"document_id":{"jurisdiction":"US","doc_number":"2007250480","kind":"A1","date":"2007-10-25","name":"NAJORK MARC A [US]"},"lens_id":"186-031-985-015-730","category":[],"us_category":[],"cited_phase":"PRS","rel_claims":[],"sequence":5}},{"patent":{"num":6,"document_id":{"jurisdiction":"US","doc_number":"2008313196","kind":"A1","date":"2008-12-18","name":"FURUSHO SHINJI [JP]"},"lens_id":"116-482-717-075-378","category":[],"us_category":[],"cited_phase":"PRS","rel_claims":[],"sequence":6}}],"reference_cited.source":"DOCDB","reference_cited.patent_count":6,"cites_patent":true,"reference_cited.npl_count":0,"reference_cited.npl_resolved_count":0,"cites_npl":false,"cites_resolved_npl":false,"cited_by":{"patent_count":13,"patent":[{"lens_id":"028-231-502-973-051","document_id":{"jurisdiction":"US","doc_number":"20200089797","kind":"A1"}},{"lens_id":"058-661-353-361-171","document_id":{"jurisdiction":"US","doc_number":"8825710","kind":"B2"}},{"lens_id":"091-150-454-572-105","document_id":{"jurisdiction":"US","doc_number":"7937399","kind":"B2"}},{"lens_id":"073-481-807-992-492","document_id":{"jurisdiction":"US","doc_number":"20140330835","kind":"A1"}},{"lens_id":"193-784-626-949-638","document_id":{"jurisdiction":"US","doc_number":"20120303670","kind":"A1"}},{"lens_id":"117-150-261-628-872","document_id":{"jurisdiction":"US","doc_number":"9965545","kind":"B2"}},{"lens_id":"189-705-211-296-580","document_id":{"jurisdiction":"US","doc_number":"20160217302","kind":"A1"}},{"lens_id":"066-904-320-240-166","document_id":{"jurisdiction":"US","doc_number":"20180266719","kind":"A1"}},{"lens_id":"081-368-725-676-205","document_id":{"jurisdiction":"US","doc_number":"9959338","kind":"B2"}},{"lens_id":"124-224-966-100-894","document_id":{"jurisdiction":"US","doc_number":"10989430","kind":"B2"}},{"lens_id":"019-163-240-097-291","document_id":{"jurisdiction":"US","doc_number":"10872090","kind":"B2"}},{"lens_id":"039-450-491-823-216","document_id":{"jurisdiction":"US","doc_number":"9552410","kind":"B2"}},{"lens_id":"050-016-401-628-668","document_id":{"jurisdiction":"US","doc_number":"20090106194","kind":"A1"}}]},"cited_by_patent":true,"family":{"simple":{"size":4,"id":193340951,"member":[{"lens_id":"174-089-274-671-121","document_id":{"jurisdiction":"JP","doc_number":"WO2006001241","kind":"A1","date":"2008-07-31"}},{"lens_id":"104-077-931-615-123","document_id":{"jurisdiction":"WO","doc_number":"2006001241","kind":"A1","date":"2006-01-05"}},{"lens_id":"052-998-808-077-413","document_id":{"jurisdiction":"US","doc_number":"20090019067","kind":"A1","date":"2009-01-15"}},{"lens_id":"183-463-203-634-087","document_id":{"jurisdiction":"JP","doc_number":"4681555","kind":"B2","date":"2011-05-11"}}]},"extended":{"size":4,"id":193165994,"member":[{"lens_id":"104-077-931-615-123","document_id":{"jurisdiction":"WO","doc_number":"2006001241","kind":"A1","date":"2006-01-05"}},{"lens_id":"052-998-808-077-413","document_id":{"jurisdiction":"US","doc_number":"20090019067","kind":"A1","date":"2009-01-15"}},{"lens_id":"183-463-203-634-087","document_id":{"jurisdiction":"JP","doc_number":"4681555","kind":"B2","date":"2011-05-11"}},{"lens_id":"174-089-274-671-121","document_id":{"jurisdiction":"JP","doc_number":"WO2006001241","kind":"A1","date":"2008-07-31"}}]}},"has_sequence":false,"legal_status":{"ipr_type":"patent for invention","granted":false,"earliest_filing_date":"2005-06-20","application_expiry_date":"2010-01-23","has_disclaimer":false,"patent_status":"DISCONTINUED","publication_count":1,"has_spc":false,"has_grant_event":false,"has_entry_into_national_phase":false},"abstract":{"en":[{"text":"A method for inserting a node into a tree data structure is disclosed. An information processing apparatus represents parent-child relationships between the nodes in the tree data structure by means of “child->parent” relationships, which associate node identifiers assigned to parent nodes with the node identifiers assigned to child nodes of the respective parent nodes, identifies descendant nodes of a slave-side specific node in slave-side data, and inserts the descendant nodes included in the slave-side data into master-side data as the descendant nodes of a master-side specific node in the master-side data, the master-side specific node corresponding to the slave-side specific node.","lang":"en","source":"USPTO_FULLTEXT","data_format":"ORIGINAL"}]},"abstract_lang":["en"],"has_abstract":true,"claim":{"en":[{"text":"1 - 16 . (canceled)","lang":"en","source":"USPTO_FULLTEXT","data_format":"ORIGINAL"},{"text":"17 . A node insertion method for inserting a node from a slave-side data in the form of a tree data structure into a master-side data in the form of the tree data structure, wherein in each of the master-side data and the slave-side data, nodes, including a root node, are assigned unique node identifiers, which are sequential integers that are assigned to the nodes such that each child node of a node of interest is assigned the integer before each node in the same generation as the node of interest is assigned the integer, the node identifiers assigned to non-root nodes, which are nodes other than the root node, are associated with the node identifiers assigned to parent nodes of the respective non-root nodes, and a parent-child relationship between the nodes is represented by an array containing the node identifiers assigned to the parent nodes of the respective non-root nodes, said node identifiers assigned to the parent nodes being associated to the node identifiers assigned to the non-root nodes in order of the node identifiers assigned to the non-root nodes, characterized in that the node insertion method comprises the steps of: identifying all descendant nodes of the slave-side specific node by extracting a contiguous area from the array representing the parent-child relationship in the slave-side data, wherein the contiguous area starts at a location following the location where the node identifier assigned to the parent node of the slave-side specific node is stored, said node identifier assigned to the parent node being associated to the node identifier assigned to the slave-side specific node, and values larger than or equal to a value of the node identifier assigned to the slave-side specific node is stored in the contiguous area; and inserting the descendant nodes of the slave-side specific node into the master-side data, wherein the descendant nodes are regarded as descendant nodes of a master-side specific node in the master-side data, which corresponds to the slave-side specific node.","lang":"en","source":"USPTO_FULLTEXT","data_format":"ORIGINAL"},{"text":"18 . The node insertion method as claimed in claim 17 , wherein the step of inserting the descendant nodes of the slave-side specific node into the master-side data includes the steps of: creating an array representing a new parent-child relationship, wherein the created array consists of a first array representing the parent-child relationship between the nodes in the master-side data and a second array representing the parent-child relationship concerning the descendant nodes of the slave-side node in the slave-side data and being inserted into the first array, by assigning the node identifiers to the nodes in the master-side data and to the descendant nodes of the slave-side specific node in the slave-side node, wherein the node identifiers are assigned according to an order, in which the descendant nodes of the slave-side specific node are inserted at the descendant nodes of the master-side specific node and each child node of a node of interest is assigned the node identifier before each node in the same generation as the node of interest is assigned the node identifier, and associating the node identifiers assigned to the nodes with the node identifiers assigned to parent nodes of the respective nodes in order thereof.","lang":"en","source":"USPTO_FULLTEXT","data_format":"ORIGINAL"},{"text":"19 . The node insertion method as claimed in claim 18 , wherein the step of creating the array representing the new parent-child relationship includes the steps of: assigning the node identifiers to the respective nodes in the master-side data according to an order, in which each child node of a node of interest is assigned the node identifier before each node in the same generation as the node of interest is assigned the node identifier, until a master-side specific node appears, and associating the node identifiers assigned to the respective nodes in the master-side data with the node identifiers assigned to parent nodes of the respective nodes in the master-side data; assigning the node identifier to the master-side specific node, assigning the node identifiers to the descendant nodes of the slave-side specific node according to an order, in which each child node of a node of interest is assigned the node identifier before each node in the same generation as the node of interest is assigned the node identifier, such that the descendant nodes of the slave-side specific node are regarded as descendant nodes of the master-side specific node, and associating the node identifiers assigned to the descendant nodes with the node identifiers assigned to the parent nodes of the respective descendant nodes; and assigning the node identifiers to remaining nodes in the master-side data according to an order, in which each child node of a node of interest is assigned the node identifier before each node in the same generation as the node of interest is assigned the node identifier, and associating the node identifiers assigned to the remaining nodes with the node identifiers assigned to the parent nodes of the respective remaining nodes, if the remaining nodes exist in the master-side data.","lang":"en","source":"USPTO_FULLTEXT","data_format":"ORIGINAL"},{"text":"20 . An information processing apparatus comprising a storage device for storing a master-side data and a slave-side data in the form of a tree data structure therein, wherein in each of the master-side data and the slave-side data stored in the storage device, nodes, including a root node, are assigned unique node identifiers, which are sequential integers that are assigned to the nodes such that each child node of a node of interest is assigned the integer before each node in the same generation as the node of interest is assigned the integer, the node identifiers assigned to non-root nodes, which are nodes other than the root node, are associated with the node identifiers assigned to parent nodes of the respective non-root nodes, and a parent-child relationship between the nodes is represented by an array containing the node identifiers assigned to the parent nodes of the respective non-root nodes, said node identifiers assigned to the parent nodes being associated to the node identifiers assigned to the non-root nodes in order of the node identifiers assigned to the non-root nodes, characterized in that the information processing apparatus comprises: a descendant node identification means for identifying all descendant nodes of the slave-side specific node by extracting a contiguous area from the array representing the parent-child relationship in the slave-side data, wherein the contiguous area starts at a location following the location where the node identifier assigned to the parent node of the slave-side specific node is stored, said node identifier assigned to the parent node being associated to the node identifier assigned to the slave-side specific node, and values larger than or equal to a value of the node identifier assigned to the slave-side specific node is stored in the contiguous area; and a node insertion means for inserting the descendant nodes of the slave-side specific node into the master-side data, and storing information representing a new parent-child relationship in the storage means, wherein the descendant nodes are regarded as descendant nodes of a master-side specific node in the master-side data, which corresponds to the slave-side specific node.","lang":"en","source":"USPTO_FULLTEXT","data_format":"ORIGINAL"},{"text":"21 . The information processing apparatus as claimed in claim 20 wherein the node insertion means creates an array representing a new parent-child relationship, in which the created array consists of a first array representing the parent-child relationship between the nodes in the master-side data and a second array representing the parent-child relationship concerning the descendant nodes of the slave-side node in the slave-side data and being inserted into the first array, by assigning the node identifiers to the nodes in the master-side data and to the descendant nodes of the slave-side specific node in the slave-side node, wherein the node identifiers are assigned according to an order, in which the descendant nodes of the slave-side specific node are inserted at the descendant nodes of the master-side specific node and each child node of a node of interest is assigned the node identifier before each node in the same generation as the node of interest is assigned the node identifier, and associating the node identifiers assigned to the nodes with the node identifiers assigned to parent nodes of the respective nodes in order thereof.","lang":"en","source":"USPTO_FULLTEXT","data_format":"ORIGINAL"},{"text":"22 . The information processing apparatus as claimed in claim 21 , wherein the node insertion means comprises: a means for determining whether the node in the master-side data is the master-side specific node; a means for assigning the node identifier to the node in the master-side data according to an order, in which each child node of a node of interest is assigned the node identifier before each node in the same generation as the node of interest is assigned the node identifier, and associating the node identifier assigned to the node in the master-side data with the node identifier assigned to a parent node of the node in the master-side data, if the node in the master-side data is not the master-side specific node; and a means for assigning the node identifier to the master-side specific node, assigning the node identifiers to the descendant nodes of the slave-side specific node according to an order, in which each child node of a node of interest is assigned the node identifier before each node in the same generation as the node of interest is assigned the node identifier, such that the descendant nodes of the slave-side specific node are regarded as descendant nodes of the master-side specific node, and associating the node identifiers assigned to the descendant nodes with the node identifiers assigned to the parent nodes of the respective descendant nodes, if the node in the master-side data is the master-side specific node.","lang":"en","source":"USPTO_FULLTEXT","data_format":"ORIGINAL"},{"text":"23 . A program executed in a computer comprising a storage device for storing a master-side data and a slave-side data in the form of a tree data structure therein, wherein in each of the master-side data and the slave-side data stored in the storage device, nodes, including a root node, are assigned unique node identifiers, which are sequential integers that are assigned to the nodes such that each child node of a node of interest is assigned the integer before each node in the same generation as the node of interest is assigned the integer, the node identifiers assigned to non-root nodes, which are nodes other than the root node, are associated with the node identifiers assigned to parent nodes of the respective non-root nodes, and a parent-child relationship between the nodes is represented by an array containing the node identifiers assigned to the parent nodes of the respective non-root nodes, said node identifiers assigned to the parent nodes being associated to the node identifiers assigned to the non-root nodes in order of the node identifiers assigned to the non-root nodes, characterized in that the program causes the computer to perform the functions of: identifying all descendant nodes of the slave-side specific node by extracting a contiguous area from the array representing the parent-child relationship in the slave-side data, wherein the contiguous area starts at a location following the location where the node identifier assigned to the parent node of the slave-side specific node is stored, said node identifier assigned to the parent node being associated to the node identifier assigned to the slave-side specific node, and values larger than or equal to a value of the node identifier assigned to the slave-side specific node is stored in the contiguous area; and inserting the descendant nodes of the slave-side specific node into the master-side data, and storing information representing a new parent-child relationship in the storage means, wherein the descendant nodes are regarded as descendant nodes of a master-side specific node in the master-side data, which corresponds to the slave-side specific node.","lang":"en","source":"USPTO_FULLTEXT","data_format":"ORIGINAL"},{"text":"24 . The program as claimed in claim 23 , wherein the function of storing the information representing the new parent-child relationship includes the function of creating an array representing a new parent-child relationship, in which the created array consists of a first array representing the parent-child relationship between the nodes in the master-side data and a second array representing the parent-child relationship concerning the descendant nodes of the slave-side node in the slave-side data and being inserted into the first array, by assigning the node identifiers to the nodes in the master-side data and to the descendant nodes of the slave-side specific node in the slave-side node, wherein the node identifiers are assigned according to an order, in which the descendant nodes of the slave-side specific node are inserted at the descendant nodes of the master-side specific node and each child node of a node of interest is assigned the node identifier before each node in the same generation as the node of interest is assigned the node identifier, and associating the node identifiers assigned to the nodes with the node identifiers assigned to parent nodes of the respective nodes in order thereof.","lang":"en","source":"USPTO_FULLTEXT","data_format":"ORIGINAL"},{"text":"25 . The program as claimed in claim 24 , wherein the function of creating the array representing the new parent-child relationship includes the functions of: determining whether the node in the master-side data is the master-side specific node; assigning the node identifier to the node in the master-side data according to an order, in which each child node of a node of interest is assigned the node identifier before each node in the same generation as the node of interest is assigned the node identifier, and associating the node identifier assigned to the node in the master-side data with the node identifier assigned to a parent node of the node in the master-side data, if the node in the master-side data is not the master-side specific node; and assigning the node identifier to the master-side specific node, assigning the node identifiers to the descendant nodes of the slave-side specific node according to an order, in which each child node of a node of interest is assigned the node identifier before each node in the same generation as the node of interest is assigned the node identifier, such that the descendant nodes of the slave-side specific node are regarded as descendant nodes of the master-side specific node, and associating the node identifiers assigned to the descendant nodes with the node identifiers assigned to the parent nodes of the respective descendant nodes, if the node in the master-side data is the master-side specific node.","lang":"en","source":"USPTO_FULLTEXT","data_format":"ORIGINAL"},{"text":"26 . A computer readable recording medium having a program as claimed in claim 23 stored thereon.","lang":"en","source":"USPTO_FULLTEXT","data_format":"ORIGINAL"},{"text":"27 . A computer readable recording medium having a program as claimed in claim 24 stored thereon.","lang":"en","source":"USPTO_FULLTEXT","data_format":"ORIGINAL"},{"text":"28 . A computer readable recording medium having a program as claimed in claim 25 stored thereon.","lang":"en","source":"USPTO_FULLTEXT","data_format":"ORIGINAL"}]},"claim_lang":["en"],"has_claim":true,"description":{"en":{"text":"FIELD OF THE INVENTION The present invention relates to a method for handling a tree data structure, and, in particular, to a method for inserting a node into a tree data structure. The invention also relates to an information processing apparatus for carrying out the method. Furthermore, the invention relates to a program for executing the method and a recording medium having the program recorded thereon. BACKGROUND OF THE INVENTION A database has been used in a variety of applications and a Relational Database (“RDB”), among others, has been mainly used in a medium-scale or large-scale system, because the RDB is capable of removing logical inconsistencies. For example, the RDB is used in an airline reservation system and the like. In this case, reservation targets (or mostly one target) to be identified by the system can be rapidly retrieved, or the system can confirm, cancel, or change a reservation. Furthermore, the number of vacant seats on a particular flight can be determined because the number of seats on each flight is no more than at several hundreds at most. It is known that such RDB is suitable for handling tabular data, whereas the RDB is not suitable for handling the tree data (e.g., see non-patent document No. 1). Furthermore, some of the applications are adapted to be represented not by the tabular data but by the tree data. In particular, XML (extended Markup Language) adopting the tree data structure as a data standard for Internet or Intranet applications has recently spread (e.g., see non-patent document No. 2 to know details about XML). However, handling of the tree data structure, including retrieval of the tree data, is generally very inefficient. The first reason for this inefficiency is that it is difficult to locate quickly where the data should exist, as it is contained in many nodes in various places. In the RDB, for example, the data regarding “age” is stored only in the field “age”. In the tree data structure, however, since the nodes containing the data regarding “age” are located all over the place, in general, it is not possible to retrieve relevant data unless we search through the whole tree data structure. The second reason for this inefficiency is that it takes time to represent a result of the retrieval. In the case of the tree data structure, attempting to represent a node group whose nodes meet retrieval requirements often needs to represent descendant nodes of those nodes and it takes time to represent the descendant nodes since the data structure for the tree is ad hoc unlike a RDBMS (Relational DataBase Management system). Therefore, conventional methods have been proposed for converting tree type data into the RDB in order to take advantage of the RDB which is a main stream of the database when it is required to convert the tree data structure into the database (e.g., see patent document No. 1). In the RDB, the data is decomposed into a table (tabular form) to be stored therein. To this end, the tree type data has to be packed into the table in order to convert the actual tree type data into the RDB. However, it is required to individually pack the data into the table and design a system depending on the data structure. Therefore, building the system based on the RDB is a very troublesome task. In addition, a method has been proposed for converting a tree type data, in particular an XML data, into the database while keeping its data structure. In a tree type data structure, since descendant nodes are created from one node and a variety of descriptions are allowed to describe the structure, the troublesome task of designing the system can be remarkably alleviated. Accordingly, there is an increased need to treat tree structure data using a technique for handling the tree structure like the XML as a core technology. One exemplary approach of converting XML data into the database, while keeping its data structure, consists of acquiring a copy of the data written into the tree structure and separately holding index data for retrieving the data. An example of this is the index data in terms of “age” if the field of “age” is concerned (e.g., see patent document No. 2). This provides for the ability to not only take full advantage of the XML data, in that an attribute can be added to the data itself, but also to store a relational structure of each field described by a tag. Furthermore, an specification of an object model interface, called “DOM” (Document Object Model), for expanding an XML document in a memory in the form of a tree structure has been published (e.g., see non-patent document No. 3). Patent Document No. 1: JP2003-248615A Patent Document No. 2: JP2001-195406A Non-patent Document No. 1: SEC Co., Ltd., “Karearea White Paper”, [online], [searched on Feb. 19, 2004], Internet URL:http://wwww.sec.co.jp/products/karearea/ Non-patent Document No. 2: W3C, “Extensible Markup Language (XML)) 1.0 (Third Edition)”, [online], Feb. 4, 2004, [searched on Feb. 19, 2004], Internet
nodes, including a root node, are assigned unique node identifiers, which are sequential integers that are assigned to the nodes such that each child node of a node of interest is assigned the integer before each node in the same generation as the node of interest is assigned the integer,\n
the node identifiers assigned to non-root nodes, which are nodes other than the root node, are associated with the node identifiers assigned to parent nodes of the respective non-root nodes, and\n
a parent-child relationship between the nodes is represented by an array containing the node identifiers assigned to the parent nodes of the respective non-root nodes, said node identifiers assigned to the parent nodes being associated to the node identifiers assigned to the non-root nodes in order of the node identifiers assigned to the non-root nodes, characterized in that the node insertion method comprises the steps of:\n
identifying all descendant nodes of the slave-side specific node by extracting a contiguous area from the array representing the parent-child relationship in the slave-side data, wherein the contiguous area starts at a location following the location where the node identifier assigned to the parent node of the slave-side specific node is stored, said node identifier assigned to the parent node being associated to the node identifier assigned to the slave-side specific node, and values larger than or equal to a value of the node identifier assigned to the slave-side specific node is stored in the contiguous area; and\n
inserting the descendant nodes of the slave-side specific node into the master-side data, wherein the descendant nodes are regarded as descendant nodes of a master-side specific node in the master-side data, which corresponds to the slave-side specific node."],"number":17,"annotation":false,"claim":true,"title":false},{"lines":["The node insertion method as claimed in claim 17, wherein the step of inserting the descendant nodes of the slave-side specific node into the master-side data includes the steps of:\n
creating an array representing a new parent-child relationship, wherein the created array consists of a first array representing the parent-child relationship between the nodes in the master-side data and a second array representing the parent-child relationship concerning the descendant nodes of the slave-side node in the slave-side data and being inserted into the first array, by\n
assigning the node identifiers to the nodes in the master-side data and to the descendant nodes of the slave-side specific node in the slave-side node, wherein the node identifiers are assigned according to an order, in which the descendant nodes of the slave-side specific node are inserted at the descendant nodes of the master-side specific node and each child node of a node of interest is assigned the node identifier before each node in the same generation as the node of interest is assigned the node identifier, and\n
associating the node identifiers assigned to the nodes with the node identifiers assigned to parent nodes of the respective nodes in order thereof."],"number":18,"annotation":false,"claim":true,"title":false},{"lines":["The node insertion method as claimed in claim 18, wherein the step of creating the array representing the new parent-child relationship includes the steps of:\n
assigning the node identifiers to the respective nodes in the master-side data according to an order, in which each child node of a node of interest is assigned the node identifier before each node in the same generation as the node of interest is assigned the node identifier, until a master-side specific node appears, and associating the node identifiers assigned to the respective nodes in the master-side data with the node identifiers assigned to parent nodes of the respective nodes in the master-side data;\n
assigning the node identifier to the master-side specific node, assigning the node identifiers to the descendant nodes of the slave-side specific node according to an order, in which each child node of a node of interest is assigned the node identifier before each node in the same generation as the node of interest is assigned the node identifier, such that the descendant nodes of the slave-side specific node are regarded as descendant nodes of the master-side specific node, and associating the node identifiers assigned to the descendant nodes with the node identifiers assigned to the parent nodes of the respective descendant nodes; and\n
assigning the node identifiers to remaining nodes in the master-side data according to an order, in which each child node of a node of interest is assigned the node identifier before each node in the same generation as the node of interest is assigned the node identifier, and associating the node identifiers assigned to the remaining nodes with the node identifiers assigned to the parent nodes of the respective remaining nodes, if the remaining nodes exist in the master-side data."],"number":19,"annotation":false,"claim":true,"title":false},{"lines":["An information processing apparatus comprising a storage device for storing a master-side data and a slave-side data in the form of a tree data structure therein, wherein in each of the master-side data and the slave-side data stored in the storage device,\n
nodes, including a root node, are assigned unique node identifiers, which are sequential integers that are assigned to the nodes such that each child node of a node of interest is assigned the integer before each node in the same generation as the node of interest is assigned the integer,\n
the node identifiers assigned to non-root nodes, which are nodes other than the root node, are associated with the node identifiers assigned to parent nodes of the respective non-root nodes, and\n
a parent-child relationship between the nodes is represented by an array containing the node identifiers assigned to the parent nodes of the respective non-root nodes, said node identifiers assigned to the parent nodes being associated to the node identifiers assigned to the non-root nodes in order of the node identifiers assigned to the non-root nodes, characterized in that the information processing apparatus comprises:\n
a descendant node identification means for identifying all descendant nodes of the slave-side specific node by extracting a contiguous area from the array representing the parent-child relationship in the slave-side data, wherein the contiguous area starts at a location following the location where the node identifier assigned to the parent node of the slave-side specific node is stored, said node identifier assigned to the parent node being associated to the node identifier assigned to the slave-side specific node, and values larger than or equal to a value of the node identifier assigned to the slave-side specific node is stored in the contiguous area; and\n
a node insertion means for inserting the descendant nodes of the slave-side specific node into the master-side data, and storing information representing a new parent-child relationship in the storage means, wherein the descendant nodes are regarded as descendant nodes of a master-side specific node in the master-side data, which corresponds to the slave-side specific node."],"number":20,"annotation":false,"claim":true,"title":false},{"lines":["The information processing apparatus as claimed in claim 20 wherein the node insertion means creates an array representing a new parent-child relationship, in which the created array consists of a first array representing the parent-child relationship between the nodes in the master-side data and a second array representing the parent-child relationship concerning the descendant nodes of the slave-side node in the slave-side data and being inserted into the first array, by\n
assigning the node identifiers to the nodes in the master-side data and to the descendant nodes of the slave-side specific node in the slave-side node, wherein the node identifiers are assigned according to an order, in which the descendant nodes of the slave-side specific node are inserted at the descendant nodes of the master-side specific node and each child node of a node of interest is assigned the node identifier before each node in the same generation as the node of interest is assigned the node identifier, and\n
associating the node identifiers assigned to the nodes with the node identifiers assigned to parent nodes of the respective nodes in order thereof."],"number":21,"annotation":false,"claim":true,"title":false},{"lines":["The information processing apparatus as claimed in claim 21, wherein the node insertion means comprises:\n
a means for determining whether the node in the master-side data is the master-side specific node;\n
a means for assigning the node identifier to the node in the master-side data according to an order, in which each child node of a node of interest is assigned the node identifier before each node in the same generation as the node of interest is assigned the node identifier, and associating the node identifier assigned to the node in the master-side data with the node identifier assigned to a parent node of the node in the master-side data, if the node in the master-side data is not the master-side specific node; and\n
a means for assigning the node identifier to the master-side specific node, assigning the node identifiers to the descendant nodes of the slave-side specific node according to an order, in which each child node of a node of interest is assigned the node identifier before each node in the same generation as the node of interest is assigned the node identifier, such that the descendant nodes of the slave-side specific node are regarded as descendant nodes of the master-side specific node, and associating the node identifiers assigned to the descendant nodes with the node identifiers assigned to the parent nodes of the respective descendant nodes, if the node in the master-side data is the master-side specific node."],"number":22,"annotation":false,"claim":true,"title":false},{"lines":["A program executed in a computer comprising a storage device for storing a master-side data and a slave-side data in the form of a tree data structure therein, wherein in each of the master-side data and the slave-side data stored in the storage device,\n
nodes, including a root node, are assigned unique node identifiers, which are sequential integers that are assigned to the nodes such that each child node of a node of interest is assigned the integer before each node in the same generation as the node of interest is assigned the integer,\n
the node identifiers assigned to non-root nodes, which are nodes other than the root node, are associated with the node identifiers assigned to parent nodes of the respective non-root nodes, and\n
a parent-child relationship between the nodes is represented by an array containing the node identifiers assigned to the parent nodes of the respective non-root nodes, said node identifiers assigned to the parent nodes being associated to the node identifiers assigned to the non-root nodes in order of the node identifiers assigned to the non-root nodes, characterized in that the program causes the computer to perform the functions of:\n
identifying all descendant nodes of the slave-side specific node by extracting a contiguous area from the array representing the parent-child relationship in the slave-side data, wherein the contiguous area starts at a location following the location where the node identifier assigned to the parent node of the slave-side specific node is stored, said node identifier assigned to the parent node being associated to the node identifier assigned to the slave-side specific node, and values larger than or equal to a value of the node identifier assigned to the slave-side specific node is stored in the contiguous area; and\n
inserting the descendant nodes of the slave-side specific node into the master-side data, and storing information representing a new parent-child relationship in the storage means, wherein the descendant nodes are regarded as descendant nodes of a master-side specific node in the master-side data, which corresponds to the slave-side specific node."],"number":23,"annotation":false,"claim":true,"title":false},{"lines":["The program as claimed in claim 23, wherein the function of storing the information representing the new parent-child relationship includes the function of creating an array representing a new parent-child relationship, in which the created array consists of a first array representing the parent-child relationship between the nodes in the master-side data and a second array representing the parent-child relationship concerning the descendant nodes of the slave-side node in the slave-side data and being inserted into the first array, by\n
assigning the node identifiers to the nodes in the master-side data and to the descendant nodes of the slave-side specific node in the slave-side node, wherein the node identifiers are assigned according to an order, in which the descendant nodes of the slave-side specific node are inserted at the descendant nodes of the master-side specific node and each child node of a node of interest is assigned the node identifier before each node in the same generation as the node of interest is assigned the node identifier, and\n
associating the node identifiers assigned to the nodes with the node identifiers assigned to parent nodes of the respective nodes in order thereof."],"number":24,"annotation":false,"claim":true,"title":false},{"lines":["The program as claimed in claim 24, wherein the function of creating the array representing the new parent-child relationship includes the functions of:\n
determining whether the node in the master-side data is the master-side specific node;\n
assigning the node identifier to the node in the master-side data according to an order, in which each child node of a node of interest is assigned the node identifier before each node in the same generation as the node of interest is assigned the node identifier, and associating the node identifier assigned to the node in the master-side data with the node identifier assigned to a parent node of the node in the master-side data, if the node in the master-side data is not the master-side specific node; and\n
assigning the node identifier to the master-side specific node, assigning the node identifiers to the descendant nodes of the slave-side specific node according to an order, in which each child node of a node of interest is assigned the node identifier before each node in the same generation as the node of interest is assigned the node identifier, such that the descendant nodes of the slave-side specific node are regarded as descendant nodes of the master-side specific node, and associating the node identifiers assigned to the descendant nodes with the node identifiers assigned to the parent nodes of the respective descendant nodes, if the node in the master-side data is the master-side specific node."],"number":25,"annotation":false,"claim":true,"title":false},{"lines":["A computer readable recording medium having a program as claimed in claim 23 stored thereon."],"number":26,"annotation":false,"claim":true,"title":false},{"lines":["A computer readable recording medium having a program as claimed in claim 24 stored thereon."],"number":27,"annotation":false,"claim":true,"title":false},{"lines":["A computer readable recording medium having a program as claimed in claim 25 stored thereon."],"number":28,"annotation":false,"claim":true,"title":false}]}},"filters":{"npl":[],"notNpl":[],"applicant":[],"notApplicant":[],"inventor":[],"notInventor":[],"owner":[],"notOwner":[],"tags":[],"dates":[],"types":[],"notTypes":[],"j":[],"notJ":[],"fj":[],"notFj":[],"classIpcr":[],"notClassIpcr":[],"classNat":[],"notClassNat":[],"classCpc":[],"notClassCpc":[],"so":[],"notSo":[],"sat":[]},"sequenceFilters":{"s":"SEQIDNO","d":"ASCENDING","p":0,"n":10,"sp":[],"si":[],"len":[],"t":[],"loc":[]}}