JP2005222465A - Information processor - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To delete garbage in consideration of processing depending on the shape of a layered structure. <P>SOLUTION: When a retrieval formula is extracted from an XML document 208, an XML processor 202 stores a search formula management table wherein by analyzing the search formula and matched information required for executing retrieval and the search formula. When a high order XML application 204 requests to delete a node in a storage part, The XML processor 202 determines whether the node to be deleted is a retrieval object of the retrieval formula with reference to the retrieval formula management table, and in the case of the retrieval node, only unnecessary information is deleted by comparing the required information and the node to be deleted of the retrieval formula management table. <P>COPYRIGHT: (C)2005,JPO&NCIPI

Description

  The present invention relates to an information processing apparatus that processes structured information in which a plurality of elements are hierarchically described.

  As a data exchange format between devices / applications, XML (Extensible Markup Language) is often used for reasons such as interoperability and good readability (see, for example, Patent Document 1 and Patent Document 2). XML can arrange various data in a virtual tree structure and express individual data and their relations.

  When performing operations such as acquisition / addition of element data and its attributes to such semantically structured XML data, it is common for an application to use a “DOM library”. The DOM (Document Object Model) is a method that takes every element of XML data as a node and expands it as a tree of nodes (DOM tree).

  As a means for searching for target element data, attributes, etc., it is also common to use an “XPath library” that searches from the structure of XML data. XPath (XML Path Language) expresses a route from a starting node to a target node in the DOM tree of the XML document.

JP 2002-297469 A JP 2002-108850 A

  XML is used in various apparatuses. Some devices may be forced to operate with a small amount of memory. For this reason, the memory area is released by deleting unnecessary element data and attribute data from the XML tree-structured data described above. It is desirable to reduce the amount of memory used. Of course, it is also conceivable to save the data in the released area to a hard disk or the like.

  However, in the data search using the XPath library described above, a search based on the target data structure is performed. Therefore, a correct search result cannot always be obtained by releasing some element data and attribute data. Therefore, when releasing unnecessary data, it is necessary to select data to be deleted so as not to affect processing (for example, XPath search) that depends on the shape of the tree structure (presence / absence of branch / node data).

  Accordingly, an object of the present invention is to delete unnecessary information in consideration of processing depending on the shape of the hierarchical structure.

  In order to achieve the above object, an information processing apparatus according to a preferred aspect of the present invention includes a storage unit in which structured information including a hierarchical structure of a plurality of elements is stored, and a specific element included in the plurality of elements. An identification unit for identifying information necessary for specifying the path of the stored structured information based on search information indicating a path to a specific element in the hierarchical structure for searching; And a deletion processing unit that deletes information requested to be deleted from the stored structured information while leaving the identified necessary information.

  According to this configuration, since information necessary for specifying a route is left, unnecessary information can be deleted while securing a search route used for search processing.

  In order to achieve the above object, an information processing apparatus according to a preferred aspect of the present invention includes a storage unit in which structured information including a hierarchical structure of a plurality of elements is stored, and a specification included in the plurality of elements. Based on the search information for searching for an element, a correspondence information generating unit that generates correspondence information that associates the data of the specific element with the search information of the specific element, and among the specific elements requested to be deleted And a deletion processing unit that deletes the specific element for which the correspondence information has been generated from the storage unit.

  According to this configuration, even if the specific element cannot be searched for by the search information as a result of the information deletion, it is possible to refer to the data corresponding to the specific element based on the correspondence information. That is, unnecessary information can be deleted while securing necessary data as a result of the search process.

  In order to achieve the above object, an information processing apparatus according to a preferred aspect of the present invention includes a storage unit in which structured information including a hierarchical structure of a plurality of elements is stored, and a specification included in the plurality of elements. An analysis unit for analyzing search information for searching for elements, a deletion processing unit for deleting information requested to be deleted from the stored structured information from the storage unit, and an analysis before the deletion And a post-deletion search for searching for a specific element corresponding to the pre-deletion search information in the post-deletion structured information based on the pre-deletion search information performed and the post-deletion structured information after the deletion. And a search information reconstruction unit that generates information.

  According to this configuration, even when the specific element cannot be searched for by the search information before deletion as a result of the deletion of the information, the specific element can be searched based on the post-deletion search information. That is, unnecessary information can be deleted while enabling a search for a specific element by using new search information.

  In order to achieve the above object, an information processing apparatus according to a preferred aspect of the present invention includes a storage unit in which structured information including a hierarchical structure of a plurality of elements is stored, and the stored structured information. Based on search information for searching for specific elements included in the plurality of elements, and a save processing unit that deletes information requested to be deleted from the storage unit and saves the deleted information to an auxiliary storage unit A target information identifying unit for identifying target information necessary for searching for a specific element from the search information; and when the target information is saved in the auxiliary storage unit, the target information is extracted from the auxiliary storage unit. It has an object information acquisition part to acquire, and a search processing part which searches a specific element from the search information using the acquired object information.

  According to this configuration, since the target information necessary for searching for the specific element can be acquired from the auxiliary storage unit, unnecessary information can be deleted from the storage unit while enabling the search for the specific element.

  In order to achieve the above object, an information processing method according to a preferred aspect of the present invention is executed by an information processing apparatus to delete information from a storage unit in which structured information including a hierarchical structure of a plurality of elements is stored. An information processing method, wherein, in order to search for a specific element included in the plurality of elements, based on search information indicating a route to the specific element in the hierarchical structure, Identifying the information necessary for specifying the path of the information, leaving the identified necessary information, and deleting the requested information of the stored structured information from the storage unit, It is characterized by that.

  Preferably, based on the search information, data corresponding to a specific element searched by the search information is searched, it is determined whether or not the data amount of the searched data is smaller than a predetermined amount, and the data amount is determined. When it is determined that the data is smaller than the fixed amount, correspondence information that associates the data with the search information is generated, and the specific element in which the correspondence information is generated among the specific elements requested to be deleted is stored in the storage unit. If the data amount is determined not to be smaller than a predetermined amount, the information required to be deleted from the stored structured information is stored, leaving the identified necessary information. It is deleted from the part. Preferably, it is determined whether the information requested to be deleted is an object returned as a search result based on search information. If it is determined that the information is not an object returned as a search result, the information requested to be deleted is stored in the memory. A specific element corresponding to the pre-deletion search information in the post-deletion structured information based on the pre-deletion search information before the deletion and the post-deletion structured information after the deletion. It is characterized by generating post-deletion search information for searching.

  In order to achieve the above object, an information processing method according to a preferred aspect of the present invention is an information processing apparatus for deleting information from a storage unit in which structured information including a hierarchical structure of a plurality of elements is stored. The information processing method executed by the information processing apparatus, wherein the information requested to be deleted among the stored structured information is deleted from the storage unit, and the deleted information is saved to the auxiliary storage unit, and the plurality of elements are stored in the plurality of elements. Based on search information for searching for a specific element included, identifying target information necessary for searching for a specific element from the search information, and when the target information is saved in the auxiliary storage unit, The target information is acquired from the auxiliary storage unit.

  According to the present invention, unnecessary information can be deleted while securing information used for processing depending on the shape of the hierarchical structure.

  DESCRIPTION OF EXEMPLARY EMBODIMENTS Hereinafter, preferred embodiments of the invention will be described with reference to the drawings.

  FIG. 1 is a diagram for explaining a preferred embodiment of the present invention, and FIG. 1 shows a configuration diagram of an information processing apparatus according to the present invention.

  The information processing apparatus 100 includes an operation unit 101, a first storage unit 102, an input / output unit 103, a CPU 105, a network I / F 106, and a ROM 107, which are connected to each other via an internal bus 108. The second storage unit 104 is connected to the input / output unit 103. A plurality of programs used in the information processing apparatus 100 are stored in the ROM 107, and the CPU 105 operates according to the programs stored in the ROM 107.

  The ROM 107 stores an XML document analysis processing program that causes the information processing apparatus 100 to function as an XML processor, and an application program that causes the information processing apparatus 100 to function as a higher-level XML application that handles XML documents. Furthermore, a program for executing the DOM tree creation process and a program for realizing the DOM interface are also stored. The processing realized by these programs will be described later with reference to FIGS.

  The first storage unit 102 is configured by a RAM, for example, and stores the created DOM tree and the like. The input / output unit 103 is an interface for inputting / outputting various data. A second storage unit 104 is connected to the input / output unit 103. For example, a hard disk device is used for the second storage unit 104. The operation unit 101 functions as a user interface that receives an operation from a user, and the network I / F 106 is a communication interface that exchanges information via the network when the information processing apparatus 100 is connected to a network (not shown). Function as.

  FIG. 2 is a diagram for explaining processing executed by the information processing apparatus 100 of FIG. FIG. 2 shows functions realized by a program stored in the ROM 107 of FIG. That is, an XML processor (XML parser) 202, an upper XML application 204, and a DOM interface 206 are shown.

  The upper XML application 204 is an application that uses the XML document 208, and provides the XML processor 208 to the XML processor 202 via the DOM interface 206 together with a DOM tree creation instruction related to the XML document 208. The XML document 208 described in the text format is analyzed by the XML processor 202, and an object (DOM tree 210) expressed as a tree structure having each element of the XML document 208 as a node is created as an analysis result. The upper XML application 204 can refer to or operate the created DOM tree 210 via the DOM interface 206.

  FIG. 3 shows an example of an XML document. The XML document 208 is described in a text format, and a plurality of elements are hierarchically expressed by a start tag “<>” indicating the start of an element and an end tag “</ >>” indicating the end. In FIG. 3, an element proc is described with a tag 302 as a start tag and a tag 304 as an end tag, and an element set is described with a tag 306 as a start tag and a tag 308 as an end tag. In the XML document 208, a plurality of elements are described in a nested structure to express the inclusion relationship between the elements. That is, it is expressed in a hierarchical structure with the outer elements as higher elements.

  FIG. 4 shows a tree-structured object (DOM tree 210) corresponding to the result of analyzing the XML document 208 of FIG. The XML processor (reference numeral 202 in FIG. 2) reads the XML document (reference numeral 208 in FIG. 3) in order from the beginning of the sentence, detects the start tag and the end tag one after another, and analyzes the hierarchical structure of each element of the XML document 208. Then, the DOM tree 210 shown in FIG. 4 is created based on the analysis result.

  In FIG. 4, the outermost element proc in the XML document 208 is arranged as the highest node, and the elements set and element mode are arranged in parallel immediately below the element proc. Further, three elements prm nodes are arranged in parallel immediately below the element set. Note that an attribute node and a name space of each element are also arranged immediately below each element node. As shown in FIG. 3, the three elements prm include texts (name1, name2, name3), respectively, and the DOM tree 210 also reflects text nodes corresponding to these texts.

  The elements, attributes, name space, and text of the XML document can be expressed by a tree structure (hierarchical structure) as shown in FIG. In an XML document, a search expression called XPath (XML Path Language) using this structure is used.

  FIG. 5 is a diagram for explaining XPath. XPath expresses a route from a starting node to a target node in the XML document DOM tree (see reference numeral 210 in FIG. 4). The meaning of XPath (/ proc / set / prm [@ id = “1”]) shown in FIG. 5 is as follows.

  That is, the node with the id attribute specified is specified among the set elements that are child nodes of the proc element that is a child node of the root node (corresponding to the parent node of the element proc in FIG. 4), and among the prm elements of the child nodes. Has been. Information necessary for the search in this XPath expression includes a proc element that is a child node of the root node, a set element of the child node, and a node having an id attribute in the prm element of the child node. In this embodiment, a search expression management table in which an XPath expression and information necessary for a search corresponding to the expression are associated is created and stored in the first storage unit (reference numeral 102 in FIG. 1).

  FIG. 6 is a flowchart for explaining details of processing executed in the information processing apparatus of this embodiment. Hereinafter, the flowchart shown in FIG. 6 will be described by using the reference numerals attached to the portions shown in FIGS. 1 and 2.

  First, the XML processor 202 receives an instruction from the upper XML application 204 and acquires an XML document 208 (S601). The XML processor 202 checks whether or not the acquired XML document 208 includes an XPath expression (search expression), and if an XPath expression is extracted, analyzes the XPath expression (S602). Then, the XML processor 202 analyzes information (see FIG. 5) necessary for the evaluation (search execution) of the XPath expression (S603), and associates the analyzed search expression with the necessary information. (See FIG. 5) is stored in the first storage unit 102 (S604). When a plurality of XPath expressions are included in the XML document, the XML processor 202 repeats steps S602 to S604, extracts all XPath expressions, associates them with necessary information, and stores them in the first storage unit 102. To do.

  Next, the XML processor 202 executes a structure analysis process from the beginning of the acquired XML document 208 (S605). In this structural analysis process, as described with reference to FIG. 3, the start tag and the end tag are detected in order. There may be a plurality of XML documents 208, and the XML document 208 in which the XPath expression is described and the XML document 208 including data referred to by the XPath expression may be separate documents.

  Then, the XML processor 202 creates a tree-structured object (DOM tree 210) based on the analysis result (S606), and stores the created DOM tree 210 in the first storage unit 102 (S607). The stored DOM tree 210 is referred to by the upper XML application 204.

  In S608 to S612, a deletion process of the DOM tree 210, which is one of characteristic processes of the present embodiment, is shown. That is, a process for partially deleting the stored DOM tree 210 is performed in accordance with an instruction from the upper XML application 204 in order to reduce the amount of used memory. The XML processor 202 determines whether or not there is a deletion request from the upper XML application 204 (S608). If there is no deletion request, the processing from S605 to S607 is executed, and the creation of the DOM tree 210 is continued. . On the other hand, if there is a deletion request, the stored search expression management table is referred to and it is determined whether or not the node to be deleted is an XPath expression search target (S609). The search target node is a node included in an object returned as a result of the search expression or a node necessary for calculation using the search expression. Further, the determination as to whether or not it is a search target is performed for all stored XPath expressions. In the case of the search target node, the XML processor 202 compares the necessary information in the search formula management table with the deletion target node and deletes unnecessary portions (S610).

  Here, regarding the DOM tree 210 in FIG. 4, unnecessary parts that can be deleted will be described by taking as an example the case where the search expression management table in FIG. 5 exists. Assume that the DOM tree 210 in FIG. 4 is requested to delete a node in the region A, that is, a node of the element set and a node of the two elements prm (including nodes associated therewith). However, the node of the element prm (its attribute is id = 1) among the nodes to be deleted is the search target node of the search formula (XPath formula) shown in FIG. Therefore, the XML processor 202 compares the necessary information in the search expression management table with the deletion target node, and determines a node other than the necessary information among the deletion target nodes as an unnecessary portion. That is, the node with “B” in FIG. 4 is determined as an unnecessary part and is deleted. Even if these nodes are deleted, a route to the node of the element prm (its attribute is id = 1) that is the search target node of the XPath expression is secured. That is, even when the node “B” is deleted, a route from the node of the element set is secured and the reference state by the XPath expression is maintained.

  Returning to FIG. 6, if it is determined in S609 that the node is not a search target node, the deletion designation node is deleted (S611). Then, it is determined whether or not the analysis process has been executed until the end of the XML document 208 (S612). If the analysis process has not been completed, the process returns to S605, and the processes after S605 are executed again. On the other hand, if it is determined in S612 that the analysis processing has been completed up to the end of the XML document 208, the tree structure (DOM tree 210) as the analysis result is passed to the upper XML application 204, and this flow ends.

  FIG. 7 is a diagram for explaining another example of the DOM tree deletion processing, and is a flowchart of processing executed in place of S608 to S612 in FIG.

  Examples of the object returned as the search result of the XPath expression, that is, the data type corresponding to the element specified by the XPath expression include a node set, a Boolean value, a numerical value, and a character string. Depending on these contents, an object with a relatively small amount of data may be returned as a search result of the XPath expression. For example, as shown in FIG. 8, an object with a small amount of data such as a Boolean value (True) or a numerical value (5) may correspond as a search result based on a search expression. In this way, in the case of an object with a relatively small amount of data, the search expression and the object that is the search result are directly associated and stored, and the object (data) stored as a result when the search expression is executed is stored. By returning, the processing efficiency is improved and more information can be reduced. Hereinafter, returning to FIG. 7, the process will be described.

  In S608 (see FIG. 6), upon receiving an instruction to delete a part of the DOM tree 210, the XML processor 202 determines whether or not the node to be deleted is an XPath expression search target (S701). If it is, it is determined whether or not the number of objects as a search result is equal to or less than a predetermined amount (S702). In S702, for example, if the search result is a Boolean value or a numerical value, the amount of these data is small, so it is always determined that the amount is less than a predetermined amount. If the result is a character string, it is determined whether it is N characters or less. It may be determined whether the search result is N bytes or less.

  If it is determined in S702 that the amount is equal to or smaller than the predetermined amount, the search formula is executed (S703), and the search result and the search formula are associated with each other and stored in the first storage unit 102 (S704). Then, the node designated to be deleted is deleted. Since the search result is associated with the search expression in S704, it is possible to refer to the object that is the search result even if the search target node is deleted.

  If it is determined in S702 that the object is not less than the predetermined amount, the necessary information in the search formula management table is compared with the deletion target node, and only unnecessary portions are deleted (S706). That is, the same processing as S610 in FIG. 6 is executed.

  FIG. 9 is a diagram for explaining still another example of the DOM tree deletion processing, and is a flowchart of processing executed in place of S608 to S612 in FIG. The search target node is a node included in an object returned as a result of the search expression or a node necessary for calculation using the search expression. Therefore, if there is a deletion request for a node that is necessary only for calculation using the search expression, delete the node, recreate the search expression that reflects the tree topology after the deletion, and search after the deletion. When executing the expression, the search is executed using the re-created search expression. Thereby, more information can be reduced.

  In S608 (see FIG. 6), when receiving an instruction to delete a part of the DOM tree 210, the XML processor 202 determines whether or not the node to be deleted is an XPath expression search target (S901). If it is a search target, it is determined whether the deleted node is an object (direct reference) returned as a result of the search expression (S902). If it is not a direct reference, an expression that can derive the same result after deleting the designated node is recreated (S903), and the original search expression and the recreated search expression are associated with each other and stored in the first storage unit 102. (S904). Then, the designated node is deleted (S905).

  FIG. 10 is a diagram for explaining a management table in which a search expression is associated with a re-created search expression. The search expression (/ proc / set / prm [2]) is an XPath expression indicating the second prm element of the child node of the set element of the child node of the proc element of the child node of the root node. Corresponds to the search expression to search. Here, when deletion of C in FIG. 4 that is a search target but not direct reference is specified, that is, when the first prm element of the child node of the set element is specified and deleted, the original second after deletion The prm element (D in FIG. 4) becomes the first prm element. Therefore, by recreating the search expression as (/ proc / set / prm [1]), it is possible to search for the same D even after C is deleted.

  Returning to FIG. 9, if it is determined in S902 that direct reference is made, the necessary information in the search expression management table is compared with the node to be deleted, and only unnecessary portions are deleted (S906). That is, the same processing as S610 in FIG. 6 is executed.

  FIG. 11 is a flowchart for explaining the XML document analysis and saving process executed in the information processing apparatus of this embodiment.

  First, the XML processor 202 receives an instruction from the upper XML application 204 and acquires an XML document 208 (S1101). The XML processor 202 sequentially analyzes the acquired XML document 208 from the beginning of the document (S1102), checks whether or not an XPath expression (search expression) is included (S1103), and if the XPath expression is extracted, the XPath The expression is analyzed (S1104).

  Then, the XML processor 202 analyzes information (see FIG. 5) necessary for the evaluation (search execution) of the XPath expression (S1105), and retrieves the correspondence data in which the analyzed search expression and the necessary information are associated with each other. Store in the management table (S1106). Further, the XML processor 202 determines whether or not the node that is the search target of the search formula has already been analyzed (S1107), and if it has been analyzed, determines whether or not the target node has been saved (S1108). ). If the target node has been saved, the saved node information is acquired from the second storage unit 104 (S1109), the search formula is executed (S1110), and the search formula and the execution result are associated with each other and registered in the management table. (S1111).

  FIG. 12 is a flowchart for explaining processing executed when a node saved in the second storage unit is referred to, that is, in steps S1108 and S1109 of FIG. First, a node reference designation by an XPath expression is accepted (S1201), and a search expression management table is referenced (S1202). Then, it is determined whether or not the search target node has already been saved (S1203). If it is a saved node, information necessary for executing the search is determined (S1204), and only the necessary information is stored in the second memory. (S1205). If it is determined in S1203 that the node has not been saved, the processes in S1204 and S1205 are not executed.

  Returning to FIG. 11, if the XPath expression is not extracted in S1103, a DOM tree is created based on the analysis result of the XML document (S1112), and the created DOM tree is stored in the first storage unit 102 (S1113). Then, it is determined whether or not the node created in S1113 is a search target of the stored search formula and the search is executed (S1114). If not, the process proceeds to S1108.

  In S1115, it is determined whether there is a deletion request from the upper XML application 204. If there is a deletion request, the designated node is saved in the second storage unit 104 (S1116). At this time, for example, as shown in FIG. 13, a saved document management table in which the saved node (save node) and the location of the save destination (document save destination) are associated is created and held. Then, it is determined whether or not the end of the XML document has been reached (S1117). If it has not ended, the process returns to S1102, and if it has ended, this flow ends.

  FIG. 14 is a flowchart for explaining the processing executed when the node is saved in the second storage unit, that is, the processing executed in S1116 of FIG. If there is a deletion designation in S1115 (FIG. 11), the data of the deletion node is converted into text format data (S1401), and the text is compressed (S1402). Then, the compressed data is saved in the second storage unit, and a saved document management table (see FIG. 13) is created and stored in the first storage unit (S1403).

  In the process described with reference to FIG. 6, it is necessary to extract a search expression before the XML document analysis process. However, the process described with reference to FIGS. 11 to 14, that is, the XML document analysis and saving process. Thus, the process of extracting the search expression first becomes unnecessary.

  As mentioned above, although preferred embodiment of this invention was described, embodiment mentioned above is only a mere illustration in all the points, and does not limit the scope of the present invention.

It is a block diagram of the information processing apparatus which concerns on this invention. FIG. 11 is a diagram for describing processing executed by the information processing apparatus. It is the figure which showed an example of the XML document. It is a figure which shows the object of a tree structure. It is a figure for demonstrating XPath. It is a flowchart for demonstrating the detail of the process performed in the information processing apparatus of this embodiment. It is a figure for demonstrating the other example of a DOM tree deletion process. It is a figure for demonstrating the search result by a search formula. It is a figure for demonstrating the further another example of a DOM tree deletion process. It is a figure for demonstrating the management table which matched the search formula and the re-created search formula. It is a flowchart for demonstrating the analysis and the evacuation process of an XML document performed in the information processing apparatus of this embodiment. It is a figure for demonstrating the process when the node evacuated to the 2nd memory | storage part is referred. It is a figure for demonstrating an evacuation document management table. It is a figure for demonstrating the process in the case of making a node evacuate to a 2nd memory | storage part.

Explanation of symbols

  DESCRIPTION OF SYMBOLS 100 Information processing apparatus, 202 XML processor, 204 High-order XML application, 206 DOM interface, 208 XML document, 210 DOM tree.

Claims (10)

A storage unit in which structured information including a hierarchical structure of a plurality of elements is stored;
To identify the path of the stored structured information based on search information indicating a path to the specific element in the hierarchical structure in order to search for a specific element included in the plurality of elements. An identification part for identifying necessary information;
A deletion processing unit that deletes information requested to be deleted from the stored structured information, leaving the identified necessary information;
Having
An information processing apparatus characterized by that. A storage unit in which structured information including a hierarchical structure of a plurality of elements is stored;
Based on search information for searching for specific elements included in the plurality of elements, a correspondence information generation unit that generates correspondence information that associates the data of the specific elements with the search information of the specific elements;
A deletion processing unit that deletes from the storage unit the specific element for which the correspondence information is generated among the specific elements requested to be deleted;
Having
An information processing apparatus characterized by that. A storage unit in which structured information including a hierarchical structure of a plurality of elements is stored;
An analysis unit for analyzing search information for searching for specific elements included in the plurality of elements;
A deletion processing unit for deleting information requested to be deleted from the stored structured information from the storage unit;
Based on the pre-deletion search information analyzed before the deletion and the post-deletion structured information after the deletion, a specific element corresponding to the pre-deletion search information is included in the post-deletion structured information. A search information reconstruction unit that generates post-deletion search information for searching;
Having
An information processing apparatus characterized by that. A storage unit in which structured information including a hierarchical structure of a plurality of elements is stored;
A evacuation processing unit that deletes information requested to be deleted from the stored structured information from the storage unit, and evacuates the deleted information to an auxiliary storage unit;
A target information identification unit for identifying target information necessary for searching for a specific element from the search information based on search information for searching for a specific element included in the plurality of elements;
A target information acquisition unit that acquires the target information from the auxiliary storage unit when the target information is saved in the auxiliary storage unit;
A search processing unit for searching for a specific element from the search information using the acquired target information;
Having
An information processing apparatus characterized by that. An information processing method executed by an information processing apparatus to delete information from a storage unit in which structured information including a hierarchical structure including a plurality of elements is stored,
To identify the path of the stored structured information based on search information indicating a path to the specific element in the hierarchical structure in order to search for a specific element included in the plurality of elements. Identify the information you need,
Leaving the identified necessary information, deleting the requested information of the stored structured information from the storage unit;
An information processing method characterized by the above. An information processing method according to claim 5,
Based on the search information, search for data corresponding to the specific element searched by the search information, determine whether the data amount of the searched data is smaller than a predetermined amount,
When it is determined that the amount of data is smaller than a predetermined amount, correspondence information in which the data is associated with the search information is generated, and the correspondence information among the specific elements requested to be deleted is generated. Delete the element from the storage,
When it is determined that the amount of data is not smaller than a predetermined amount, the information required to be deleted from the stored structured information is deleted from the storage unit, leaving the identified necessary information. ,
An information processing method characterized by the above. An information processing method according to claim 5,
Determining whether the information requested to be deleted is an object returned as a search result by search information;
When it is determined that the object is not returned as a search result, the information requested to be deleted is deleted from the storage unit,
Deletion for searching the post-deletion structured information for a specific element corresponding to the pre-deletion search information based on the pre-deletion search information before the deletion and the post-deletion structured information after the deletion Generate post-search information,
An information processing method characterized by the above. An information processing method executed by an information processing apparatus to delete information from a storage unit in which structured information including a hierarchical structure including a plurality of elements is stored,
The information requested to be deleted from the stored structured information is deleted from the storage unit, and the deleted information is saved in the auxiliary storage unit,
Based on search information for searching for specific elements included in the plurality of elements, identifying target information necessary for searching for specific elements from the search information,
When the target information is saved in the auxiliary storage unit, the target information is acquired from the auxiliary storage unit.
An information processing method characterized by the above. An information processing apparatus according to claim 2,
Based on the search information, search for data corresponding to the specific element searched by the search information, determine whether the data amount of the searched data is smaller than a predetermined amount,
When it is determined that the amount of data is smaller than a predetermined amount, correspondence information in which the data is associated with the search information is generated, and the correspondence information among the specific elements requested to be deleted is generated. Delete the element from the storage,
When it is determined that the amount of data is not smaller than a predetermined amount, leaving the information identified as information necessary for specifying the path of the stored structured information based on the search information, Deleting information requested to be deleted from the stored structured information from the storage unit;
An information processing apparatus characterized by that. The information processing apparatus according to claim 3,
Determining whether the information requested to be deleted is an object returned as a search result by search information;
When it is determined that the object is not returned as a search result, the information requested to be deleted is deleted from the storage unit,
Deletion for searching the post-deletion structured information for a specific element corresponding to the pre-deletion search information based on the pre-deletion search information before the deletion and the post-deletion structured information after the deletion Generate post-search information,
An information processing apparatus characterized by that.

Images