JP6640991B2 - Data processing system and data processing method - Google Patents

Description

  The present invention generally relates to data processing.

  With the spread of virtualization mechanisms and the emergence of system provision forms such as the cloud, the operation management of IT (Information Technology) systems has become complicated. In addition, the amount of data has exploded, and the scale of IT systems has been expanding year by year, and the number of objects (for example, the number of volumes provided by storage devices) handled by management software for managing IT systems has also increased. I have.

  In recent years, big data analysis, which obtains new knowledge and notice in business by analyzing such a huge amount of accumulated data, is being utilized. In general data analysis processing, data is processed in the flow of collection, extraction (storage), and analysis. Examples of the collected data include image data from a surveillance camera installed in a city, log data output from manufacturing equipment in a factory, and CAD data created in a design process in an office. In recent years, these data can be collected in a data center or the like via the Internet and accumulated intensively.

  Next, a process of searching (extracting) data necessary for analysis from the collected data is performed. The data area to be searched (range) is enormous, and if analysis is performed from the data area, it takes time to search for necessary data, and it takes a lot of time to complete the analysis. In order to shorten the analysis time, a data set including only data necessary for analysis may be created. This process is particularly useful when performing repetitive analysis in a data center or the like where a large amount of data is stored, and is generally called a data mart (DM) creation process. Patent Literature 1 discloses a technology that enables data replication in a short time by showing source data to a host computer as virtually replicated snapshot data. Patent Document 2 discloses a technique for creating a DM.

US5,819,292 JP 2002-366401 A

  A DM, which is a data set including only data related to an analysis viewpoint in a large amount of data, is generally created by specifying data related to an analysis viewpoint by a search process and duplicating the specified data. Therefore, a large amount of computer resources is required for the search processing and the data duplication processing, and further, a storage capacity for the duplicated DM is required.

  In addition, there are cases where analysis is performed a plurality of times (for example, analysis is performed while changing the analysis target little by little). Even in such a case, search processing and data duplication processing are performed each time. Will be. Therefore, there is a problem in that each analysis consumes a large amount of resources and takes time. Further, since a DM is created each time analysis is performed, it is necessary to make settings for using the DM each time analysis is performed.

  Such a problem is not limited to a process of creating a DM for analysis from an unstructured data source, but also to a process of creating a data set (subset) from an unstructured data source for a purpose other than analysis. possible.

  The data processing system provides a virtual volume associated with one or more second type-1 metadata. Metadata including content information representing one or more content attributes of the unstructured data in the first type metadata of at least one unstructured data in the unstructured data source including the plurality of unstructured data Is associated with the second type metadata. For each of the one or more unstructured data, the unstructured data includes, in addition to the first type 1 metadata which is the original metadata of the unstructured data, the first type 1 metadata The second type-1 metadata, which is the metadata based on the copy, is associated. The data processing system is configured to store one or more second type metadata that meets one or more search conditions at a specified time after the change and one or more second first type metadata associated with the virtual volume. Based on the association, the reference destination of the one or more second type 1 metadata associated with the virtual volume is changed to the one or more unstructured data corresponding to the one or more search conditions at the designated time after the change. maintain.

  Each of the one or more second type-1 metadata associated with the virtual volume is metadata based on a copy of the first type-1 metadata (original metadata) of the unstructured data; Metadata that matches the search conditions. The data that can be referred to from the virtual volume is unstructured data referred to by the second type 1 metadata based on the copy of the first type 1 metadata, and the unstructured data is unstructured. Exists in the data source. That is, the virtual volume is a virtual data set. To provide a data set, it is not necessary to search unstructured data sources for unstructured data that matches the search conditions, or to duplicate the unstructured data itself in the unstructured data source. . For this reason, a data set that meets the search condition can be generated in a short time while suppressing an increase in consumed storage capacity.

  Also, based on the association between the one or more second type metadata that is compatible with the one or more search conditions at the designated time after the change and the one or more second first type metadata associated with the virtual volume. The reference destination of one or more second type 1 metadata associated with the virtual volume is maintained in one or more unstructured data corresponding to one or more search conditions at a designated time after the change. . Thus, there is no need to create a virtual volume every time a designated time point (for example, an analysis time point) is set, and therefore there is no need to make settings for using a virtual volume. Regardless of the designated time, unstructured data corresponding to the search condition at the designated time can be referred to from the same virtual volume.

1 shows a logical configuration of an IT system which is an example of a data processing system according to an embodiment. 1 shows a physical configuration of an IT system. It is a block diagram of a 1st S meta. It is a block diagram of C meta. FIG. 3 is a configuration diagram of object data. It is a block diagram of a 2nd S meta. It is a flowchart which shows the processing procedure of C meta management program. 9 is a flowchart illustrating a processing procedure of a storage program. Shows the request reception GUI. It is a schematic diagram of a state without C meta. It is a schematic diagram of C meta creation processing (first search). It is a schematic diagram of C meta creation processing (there is a corresponding C meta in the second search). It is a schematic diagram of a C meta creation process (there is no corresponding C meta in the second search). It is a schematic diagram of a snapshot operation process (processing when there is no corresponding second S meta). It is a schematic diagram of a snapshot operation process (a state in which a second S meta corresponding to target data has been created). It is a schematic diagram of a snapshot operation process (a process when there is a corresponding second S meta).

  The embodiments described below do not limit the invention according to the claims, and all the elements and combinations thereof described in the embodiments are indispensable for solving the invention. Not exclusively.

  In the following description, the “interface unit” includes one or more interfaces. The one or more interfaces may be one or more same type interface devices (eg, one or more NICs (Network Interface Card)) or two or more different types of interface devices (eg, NIC and HBA (Host Bus Adapter)). There may be.

  In the following description, the “storage unit” includes one or more memories. At least one memory may be a volatile memory or a non-volatile memory. The storage unit may include one or more PDEVs in addition to one or more memories. “PDEV” means a physical storage device, which may typically be a non-volatile storage device (eg, an auxiliary storage device). The PDEV may be, for example, a hard disk drive (HDD) or a solid state drive (SSD).

  In the following description, the “processor unit” includes one or more processors. At least one processor is typically a CPU (Central Processing Unit). The processor may include a hardware circuit that performs some or all of the processing.

  Further, in the following description, processing may be described with “program” as the subject, but the program is executed by the processor unit, and the determined processing is appropriately performed by the storage unit and the interface unit. Since the processing is performed while using at least one, the subject of the processing may be a processor unit (or a computer or a computer system having the processor unit). The program may be installed on the computer from a program source. The program source may be, for example, a program distribution server or a computer-readable recording medium. Further, in the following description, two or more programs may be realized as one program, or one program may be realized as two or more programs.

  Further, in the following description, information may be described in an expression such as “xxx table”, but the information may be expressed in any data structure. That is, "xxx table" can be referred to as "xxx information" to indicate that the information does not depend on the data structure. Further, in the following description, the configuration of each table is an example, and one table may be divided into two or more tables, or even if all or some of the two or more tables are one table. Good.

  In the following description, reference numerals (or common parts in reference numerals) are used when describing the same kind of elements without distinguishing them, and when discriminating and describing the same kind of elements, the element IDs (or Element reference number).

  In the following description, the “host system” may be one or more physical host computers (for example, a cluster of host computers), or at least one virtual host computer (for example, a VM (Virtual Machine)). ) May be included.

  In the following description, the “management system” may be configured by one or more computers. Specifically, for example, when the management computer has a display device and the management computer displays information on its own display device, the management computer may be a management system. Further, for example, when a management computer (for example, a server) transmits display information to a remote display computer (for example, a client) and the display computer displays the information (when the management computer displays information on the display computer) ), A system including at least the management computer of the management computer and the display computer may be the management system.

  In the following description, the “storage system” may be one or more physical storage devices, or at least one virtual storage device (for example, LPAR (Logical Partition) or SDS (Software Defined Storage)). ) May be included.

  In the following description, “RAID” is an abbreviation for Redundant Array of Independent (or Inexpensive) Disks. The RAID group is composed of a plurality of PDEVs (typically the same type of PDEV), and stores data according to the RAID level associated with the RAID group. The RAID group may be called a parity group. The parity group may be, for example, a RAID group that stores parity.

  In the following description, “VOL” is an abbreviation for logical volume, and may be a logical storage device. The VOL may be a substantial VOL (RVOL) or a virtual VOL (VVOL). “RVOL” may be a VOL based on physical storage resources (for example, one or more RAID groups) of the storage system that provides the RVOL. “VVOL” may be any of an external connection VOL (EVOL), a capacity expansion VOL (TPVOL), and a snapshot VOL. The EVOL is based on a storage space (for example, VOL) of an external storage system, and may be a VOL that follows storage virtualization technology. The TPVOL is composed of a plurality of virtual areas (virtual storage areas), and may be a VOL that conforms to a capacity virtualization technology (typically, Thin Provisioning). The snapshot VOL may be a VOL provided as a snapshot of the original VOL. The snapshot VOL may be an RVOL. The “pool” may be a logical storage area (for example, a set of a plurality of pool VOLs). For example, the pool may be at least one of a TP pool and a snapshot pool. The TP pool may be a storage area composed of a plurality of real areas (substantial storage areas). If the storage system (for example, a storage controller to be described later) has not assigned a real area to the virtual area (virtual area of TPVOL) to which the address specified by the write request received from the host system belongs, the virtual area (write destination virtual area) ) May be assigned a real area from the TP pool (even if another real area is already assigned to the write destination virtual area, the real area may be newly assigned to the write destination virtual area). The storage system may write the write target data accompanying the write request to the allocated real area. The snapshot pool may be a storage area for storing data saved from the original VOL. One pool may be used as both a TP pool and a snapshot pool. “Pool VOL” may be a VOL that is a component of a pool. The pool VOL may be an RVOL or an EVOL.

  Hereinafter, an embodiment will be described with reference to the drawings.

  FIG. 1 is a logical configuration diagram of an IT system 1000 which is an example of a data processing system according to an embodiment.

  The IT system 1000 may include, for example, one or more computer systems. Each of the one or more computer systems includes at least a storage system of a storage system, a host system connected to the storage system, and a management system connected to at least one of the storage system and the host system. System is good. The IT system 1000 has a plurality of programs, a plurality of tables, and a data area 1500. One example of the plurality of programs is an information collection program 1100, a C meta management program 1200, an analysis program 1300, and a storage program 1400. Each of the information collection program 1100, the C meta management program 1200, the analysis program 1300, and the storage program 1400 may be executed by at least one processor unit among a storage system, a host system, and a management system.

  The information collection program 1100 is a program that collects data such as temperature, sunshine, and rainfall at each point, and writes the collected data to the data area 1500 as object data 5000. At this time, the information collection program 1100 creates a first S meta 82S, which is original metadata of the object data 5000, and stores the created first S meta 82S in the first S meta table 3000. At least a part of the first S meta table 3000 may be stored in a storage unit (for example, a storage unit of a storage system). Object data 5000 is an example of unstructured data. The first S meta 82S is an example of first type 1 metadata. The data area 1500 is, for example, a VOL. In this embodiment, each of the information collection program 1100 and the analysis program 1300 is one, but two or more may be present. Further, in the present embodiment, the data stored in the data area 1500 is the object data 5000, but is not limited thereto, and is not limited to the object data 5000, such as file data (file metadata constituting the file and file data of the file data). Other unstructured data may be used. Further, in the present embodiment, the relationship between the first S meta 82S and the object data 5000 is one-to-one, but the relationship may be one-to-many, many-to-many, or many-to-one.

  The storage program 1400 is a program that provides a function as a storage system in the IT system 1000. Specifically, for example, the storage program 1400 provides a data area (for example, a VOL) 1500 for storing data as object data 5000 as an area based on one or more PDEVs, or stores one or more first S metas 82S. The first S meta table 3000 may be managed as the first S meta table 3000 (the first S meta 82S may be stored in the first S meta table 300 instead of the information collection program 1100), and one or more second S meta data associated with the SSVOL (snapshot VOL). 82T is stored in the second S meta table 6000. SSVOL is an example of VDM (virtual DM). VDM is an example of a virtual data set. A virtual data set is an example of a virtual volume. The second S meta 82T is an example of the second type 1 metadata. Note that the second S-meta 82T is data holding information relating to snapshot data (actually, the object data 5000 in the data area 1500), which is object data 5000 that can be referred to via SSVOL, and thus is not necessarily convenient data such as metadata. The name may not be used, and may be referred to by another name, for example, snapshot management data (in this case, the first S meta is simply “S meta” or “ Data). The second S meta-table 6000 (one or more second S metas 82T) may be associated with the VOL_ID of the SSVOL (which may be read as the root ID), and as a result, the request source such as the analysis program 1300 may be configured by the SSVOL. By transmitting a read request specifying the VOL_ID of (1), one or more object data 5000 (snapshot data) respectively referred to by one or more second S metas 82T held in the second S meta table 6000 is referred to from SSVOL ( Read out). Note that the storage program 1400 is implemented as a resident type program, performs an appropriate process according to the type of the arrived event after waiting for the arrival of the event, but may have another form. The range indicated by reference numeral 100 in FIG. 1 is an example of the range affected by the storage program 1400.

  The C meta management program 1200 searches the first S meta 82S and the object data 5000 based on an instruction from the user (typically, an instruction in which a search condition is specified), and stores the search condition and the search condition as a key. This is a program for creating a C-meta 83 holding information related to the search result and storing the C-meta 83 in the C-meta table 4000. The C meta-management program 1200 may be implemented as a resident-type program, wait for an event to arrive, and perform appropriate processing according to the type of the event that has arrived. However, another form may be used. Further, the C meta management program 1200 may be a user program which is a program created by a user. On the other hand, the storage program 1400 described above may be a program that cannot be created or customized by a user (for example, a program provided by a vendor). Since the storage program 1400 has a snapshot function, the IT system 1000 may be constructed by an additional operation of adding a user program such as the C meta management program 1200.

  The analysis program 1300 is a program that performs analysis with reference to the snapshot data in the SSVOL (the object data 5000 in the data area 1500 referred to by the second S meta 82T associated with the SSVOL).

  This embodiment is, for example, an embodiment to which the following use case is applied, that is, while data is written to the data area 1500, some analysis work is performed using a part of the data written to the data area 1500. This is an embodiment to which a use case to be implemented is applied. Specifically, for example, the IT system 1000 is a weather information system. The weather information system collects data such as temperature, sunshine, and rainfall at each point by the information collection program 1100, writes the collected data to the data area 1500 as object data 5000, and stores the data in the data area 1500 by the analysis program 1300. A weather forecast using the weather data of the last three days among the written object data 5000 is performed every day at 23:00. According to the present embodiment, the weather forecast (an example of analysis) performed by the analysis program 1300 of such a weather information system is made more efficient.

  FIG. 2 is a physical configuration diagram of the IT system 1000.

  The IT system 1000 includes one or more computer systems 2000. One or more computer systems 2000 may be able to communicate via at least one of a data network (eg, SAN (Storage Area Network)) 1050 and a management network (eg, LAN (Local Area Network)) 1070. In the present embodiment, the IT system 1000 is composed of two computer systems 2000, but the number of computer systems 2000 may be one or three or more.

  The computer system 2000 has an interface unit, a storage unit, and a processor unit connected thereto. An example of the interface unit is a network I / F (interface) 2010 and a management I / F 2060. An example of the storage unit is the memory 2040 and the PDEV group 2050. An example of the processor unit is the processor 2020. The computer system 2000 further has an input / output device 2030. A network I / F 2010, a management I / F 2060, a memory 2040, a PDEV group 2050, a processor 2020, and an input / output device 2030 are connected to an internal network 2080.

  The network I / F 2010 is an I / F with the data network 1050. The input / output device 2030 is a device that receives user input / output, such as a keyboard, a pointing device, and a display device. The management I / F 2060 is an I / F with the management network 1070. The internal network 2080 is a network for interconnecting the components in the computer system 2000.

  In this embodiment, the programs 1400, 1100, 1300, and 1200 described above and the tables 3000, 4000, and 6000 described above are stored in a PDEV group 2050 that is one or more PDEVs, and are loaded into a memory by the processor 2020 and executed at the time of execution. However, the present invention is not limited thereto, and some or all of them may be executed on the PDEV group 2050. In the present embodiment, the PDEV group 2050 is a nonvolatile storage device such as an HDD or an SSD, and the memory 2040 is a volatile memory such as a DRAM (Dynamic Random Access Memory). However, the memory 2040 may not be provided, and all programs may be executed on the PDEV group 2050 and a table may be read and written. In the present embodiment, the object data 5000, which is data directly read and written by a user (strictly, for example, a host system), is stored in another program or table and the PDEV group 2050. However, the object data 5000 may be stored in a logically or physically divided area. Further, a mode in which some or all of the tables are stored in logically or physically divided areas may be used.

  The data network 1050 is a network for transmitting and receiving data. The management network 1070 is a network for transmitting and receiving management data. In this embodiment, the data network 1050 and the management network 1070 are separate networks, but may be the same network. Further, these networks may be Ethernet (registered trademark), but are not limited thereto, and may have other forms.

  The IT system 1000 is composed of two computer systems 2000, and the storage program 1400 operates in the computer system 2000. However, the present invention is not limited to this configuration, and may have another form. For example, a computer system dedicated to a storage system may exist separately from the computer system on which the analysis program 1300 and the information collection program 1100 operate. In this case, the number of computer systems dedicated to the storage system may be one or more.

  FIG. 3 is a configuration diagram of the first S meta 82S.

  The first S meta table 3000 stores a first S meta 82S. In the present embodiment, the first S meta-table 3000 is in a list format, but is not limited thereto, and may be in a tree format including a binary tree or the like, or may be in a hash table format.

  The first S meta 82S includes a plurality of information elements and is metadata of the object data 5000 stored in the data area 1500. The plurality of information elements include an S-meta ID 3010, an access status 3020, an object ID 3030, a computer ID 3040, a start address 3050, an end address 3060, a last update time 3100, and an attribute information element 3110.

  The S meta ID 3010 is an ID of the first S meta 82S.

  The access state 3020 is information on the data type and access control of the object data 5000 indicated by the first S meta 82S. For example, the information on the data type is, for example, “Object” or “File”. Information on access control includes, for example, “R / W possible” (both read and write are possible), “RO” (read only (read only is possible)), and “R / W impossible” (read and write disabled). Neither is possible). Access state 3020 may further include information such as which users can access.

  The object ID 3030 is an ID of an object including the first S meta 82S. In the present embodiment, the format of the object ID may be a format of a URI (Uniform Resource Identifier), but is not limited thereto, and may be another format.

  There is a position set, which is a set of information elements 3040, 3050 and 3060. One or more position sets represent the locations of the object data 5000 associated with the first S meta 82S. One position set represents a part (or all) of the object data 5000. Hereinafter, a part (or all) of the object data 5000 corresponding to one position set is referred to as “target data”. The computer ID 3040 is a computer ID of the computer system 2000 in which the target data is stored. The start address 3050 indicates a start address of an area (an area storing target data) based on the PDEV group 2050 in the computer system 2000. The end address 3060 indicates an end address of an area (an area storing target data) based on the PDEV group 2050 in the computer system 2000. According to the example of FIG. 3, the object data 5000 is stored in a distributed manner in two areas. The number of position sets may be one or three or more.

  The last update time 3100 indicates the last update time of the object data 5000. The attribute information element 3110 is an attribute information element of the object data 5000. The attribute information element 3110 is composed of, for example, a key and a value. In the example of FIG. 3, the key is “Data Type” and the value is “Weather Information”. In the present embodiment, the number of the attribute information elements 3110 for the object data 5000 is one, but any number may be used.

  FIG. 4 is a configuration diagram of the C meta 83.

  The C meta table 4000 stores the C meta 83. The C meta table 4000 is in a list format, but is not limited thereto. The C meta table 4000 may be in a tree format including a binary tree or the like, or may be in a hash table format.

  The C meta 83 is created by the C meta management program 1200. The C meta 83 holds a search result for the object data 5000 stored in the data area 1500. The search target does not need to be the object data 5000, and any one of the first S meta 82S and the second S meta 82T may be the search target.

  The C meta 83 includes a plurality of information elements. The plurality of information elements include a C meta ID 4010, an access path 4020, a search condition 4030, and a target 4110.

  The C meta ID 4010 is the ID of the C meta 83.

  The access path 4020 is a path for the analysis program 1300 to access the object data 5000 found as a result of the search. In the present embodiment, the format of the access path 4020 may be a URI format, but is not limited thereto, and may be another format.

  The search condition 4030 indicates a corresponding search condition. According to the example of FIG. 4, the search condition 4030A includes, for example, a key and a value. Key is “Data Type”, and Value is “Weather Information”. The search condition 4030A is a search condition for the object data 5000 (or the first S meta 82S) having the key and the value. Also, according to the example of FIG. 4, the search condition 4030B is such that the key is “GPS” and the value is “130 to 140 degrees east longitude, 30 to 40 degrees north latitude”. The search condition 4030B is satisfied, for example, by the object data 5000 of GPS = 135 ° 20: 00′E longitude 32 ° 42′50′N. The search condition 4030 may be any number as long as it is one or more. In the present embodiment, the search condition 4030 takes the form of the attribute information element 3110, but is not limited thereto. For example, the search condition 4030 may be the last update time of the object data 5000 or an object ID.

  The search result 4060 indicates the result of the search. “OK” means that the search target was found (search hit), and “NG” means that the search target was not found (search mistake).

  The target 4110 indicates a target found as a result of the search. For example, an S-meta ID (for example, “Smeta_001”) may be adopted as the value of the target 4110. That means that the first S meta 82S including the S meta ID 3010 has been found as a result of the search. Further, a snapshot ID (second S meta ID) described later may be adopted as the value of the target 4110. That means that the second S meta 82T including the snapshot ID has been found as a result of the search.

  The configuration of the C meta 83 is not limited to the example of FIG. For example, the C-meta 83 may hold a plurality of search results (target 4110) or may hold one search result (target 4110). As the value adopted as the target 4110, an object ID may be adopted instead of or in addition to the S meta ID and the snapshot ID. In addition, the C meta 83 may hold a copy of Data Type 5030 or may hold information input by the user as a content attribute of the object data 5000 corresponding to the C meta 83.

  FIG. 5 is a configuration diagram of the object data 5000.

  Object data 5000 includes a plurality of information elements. The plurality of information elements include an object ID 5010, a last update time 5020, a Data Type 5030, a GPS 5040, a Time 5050, a Rainfall 5060, a Temperature 5070, a Temperature High 5080, a Temperature Low 5090, and a Weather Map 5100.

  The object ID 5010 is the ID of the object. The last update time 5020 is the time when the object data 5000 was last updated. In the present embodiment, instead of the last update time 5020, another type of time (for example, information indicating the creation time of the object data 5000) may be included in the object data 5000. This is the same for the first S meta 82S.

  Information elements 5040 to 5100 are examples of content included in the object data 5000, and at least one information element is stored in the form of a key and a value. In the present embodiment, the object data 5000 is weather data. Data Type 5030 represents the type of the data content (for example, “Weather Information” that means weather data). The GPS 5040 indicates the acquisition position of the weather data (for example, “139 degrees 50 minutes east longitude 35 degrees 40 minutes north latitude”). Time 5050 represents the time of acquisition of the weather data (for example, “8:00 JST on December 20, 2015”). As the time, any of year, month, day, hour, minute, and second may be used, or a count value may be used. Rainfall 5060 represents the amount of rainfall (for example, “20 mm”). Temperture 5070 indicates a storage location of data indicating the temperature (for example, “obj: //WeatherInfo/20131220/0800/13950-3540/Temp.csv”). Temperature High 5080 indicates the maximum temperature (for example, “5.7 ° C.”). Temperature Low 5090 indicates the lowest temperature (for example, “4.3 ° C.”). The Weather Map 5100 indicates a storage location of a weather map (for example, “obj: //weatherinfo/20151220/0800/13950-3540/map.jpg”). In the present embodiment, a case where Value is a pointer indicating another data area in the form of a URI as in Temperature 5070 and a Weather Map 5100, and a case where a value is directly stored in Value as in other information elements. In some cases, either one of them may be used, or they may be mixed as in this embodiment. Further, in the present embodiment, the information element included in the content in the object data 5000 is configured by a set of Key and Value, but may be in another form. Further, the configuration of the object data 5000 is not limited to the example of FIG.

  FIG. 6 is a configuration diagram of the second S meta 82T.

  An SSVOL (snapshot) is an image of at least a part of the data area 1500, in this embodiment, a set of object data 5000 at an arbitrary point in time. The second S meta 82T is stored in the second S meta table 6000. In the present embodiment, the second S meta table 6000 is in a list format, but is not limited thereto, and may be a tree format including a binary tree or the like, or may be a hash table format.

  The second S meta 82T includes a plurality of information elements. The plurality of information elements include a snapshot ID 6010, access status 6020, access path 6030, object ID 6040, computer ID 6050, start address 6060, end address 6070, last update time 6110, and attribute information element 6120.

  The snapshot ID 6010 is an ID of the second S meta 82T. The access status 6020, object ID 6040, computer ID 6050, start address 6060, end address 6070, last update time 6110, and attribute information element 6120 are the access status 3020, object ID 3030, computer ID 3040, start address 3050, and end address of the first S meta 82S. 3060, the last update time 3100, and the attribute information element 3110. The access path 6030 is a copy of the access path 4020 in the C meta 83 associated with the second S meta 82T.

  As described above, in the present embodiment, the second S meta 82T is a copy of the information element (for example, all information elements other than the S meta ID 3010) of the first S meta 82S, and a copy of the access path 4020 in the C meta 83. including. The configuration of the second S meta 82T is not limited to the configuration of FIG. For example, fewer information elements may be copied to the second S meta 82T of the first S meta 82S, more information elements may be copied to the second S meta 82T of the C meta 83, An information element having neither the 1S meta 82S nor the C meta 83 may be stored in the second S meta 82T.

  FIG. 7 is a flowchart illustrating a processing procedure of the C meta management program 1200.

  After starting the program (S7010), the C meta management program 1200 waits for the user to set search conditions (S7020). The search condition setting of the user is performed using, for example, a request reception GUI 9000 described later.

  When the search condition is set by the user (S7020: Yes), the C meta-management program 1200 checks the interval of the search condition (S7030). If any interval has been set (S7030: Yes), the C meta-management program 1200 waits until the next start time (S7050). When the interval is not set and the on-demand is selected (S7030: No), the C meta management program 1200 waits for a user's instruction (S7040). The time at the next start time or the time at which the user's instruction is received is an example of the “designated time”.

  When the waiting is released in S7040 or S7050, the C meta management program 1200 creates the second S meta 82T (S7060). Details of S7060 will be described later with reference to FIGS. Thereafter, the C meta management program 1200 issues a snapshot operation to the storage program 1400 (S7070).

  The C meta management program 1200 checks whether or not there is a termination instruction from the user (S7080). If there is no end instruction (S7080: No), the process returns to S7030, and if there is an end instruction (S7080: Yes), the process ends (S7100).

  FIG. 8 is a flowchart showing the processing procedure of the storage program 1400.

  After the start of the program (S8010), the storage program 1400 checks for the occurrence of an event (S8020). If no event has occurred (S8020: No), the storage program 1400 waits for a certain time (S8030) and returns to S8020.

  If an event has occurred (S8020: Yes), the storage program 1400 checks whether the event is data read / write (for example, reception of an I / O request from the host system) (S8040).

  If the event is reading / writing data (S8040: Yes), the storage program 1400 reads / writes data from / to the data area 1500 (or SSVOL). At this time, the storage program 1400 creates and updates the first S meta 82S as necessary.

  If the event is not data read / write (S8040: No), the storage program 1400 checks whether the event is a storage operation instruction (S8060).

  If the event is a storage operation instruction (S8060: Yes), the storage program 1400 performs storage operation processing (S8070). Details of S8070 will be described later with reference to FIGS.

  If the event is not a storage operation instruction (S8060: No), the storage program 1400 performs processing (for example, troubleshooting) according to the event (S8080).

  After the processing according to the event (S8050, S8070 or S8080), the storage program 1400 checks whether or not there is a termination instruction from the user (S8090). If there is no end instruction (S8090: No), the process returns to S8020, and if there is an end instruction (S8090: Yes), the process ends (S8100).

  FIG. 9 shows a request reception GUI 9000.

  A search condition can be input (set) via a request reception GUI (Graphical User Interface) 9000. The request reception GUI 9000 is displayed by the C meta management program 1200, for example.

  The request reception GUI 9000 has a plurality of fields and a plurality of buttons.

  In an interval field 9010, an interval at which a search process is performed is input. The interval may be two or more of monthly, weekly, daily, hourly, and on demand.

  In the time field 9020, the time at which the search processing is performed is input. The configuration of the value input in this field changes depending on what interval is selected in the interval field 9010. For example, when “weekly” is selected in the interval field 9010, the value input in the time field 9020 may be what day of the week and at what time the search process is performed. Further, for example, when “on demand” is selected in the interval field 9010, the time field 9020 may be hidden or may be in a disabled state.

  In the common search condition field 9110, a search condition common to all target data (data to be searched) is input. In the example of FIG. 9, there are three target data, but the common search condition is a condition common to all of them. In the present embodiment, the common search condition is specified in the format of Key = Value. According to the condition “Data Type = Weather Information” input to the common search condition field 9110A, all object data corresponding to the condition are searched. Also, according to “GPS = 130 degrees east-140 degrees east, 30 degrees-40 degrees north latitude” input to the common search condition field 9110B, the object data (or the C meta 83 Alternatively, the first S meta 82S) is a search target. The common search condition can be increased to an arbitrary number by pressing (for example, clicking) the add button 9150. In the present embodiment, the common search condition may be 0 or more. When a plurality of common search conditions are input, they may be AND, OR, or a combination thereof.

  The target data field set 9200 exists for each target data. The target data field set 9200 has one or more fields such as a search condition field 9210 and an access path field 9230.

  In the search condition field 9210, a search condition of the target data is input. Here, the input search condition is a general-purpose search condition at a plurality of designated time points, in other words, the search condition itself is the same even when the designated time points are different. The search condition has, for example, a format of Key = Value. “Time = today” is the day to which the designated time point belongs. The data to be found is specifically determined according to the search condition and the designated time. For example, when the search condition is “Time = today”, if the designated time is 23:00 on December 7, the data to be found is data of 12/7 (December 7), and the designated time is 12 At 23:00 on March 8, the data to be found is 12/8 data.

  In the access path field 9230, a path (path name) for accessing the object data found as a result of the search from another program is input. The format of the access path may be, for example, a URI format, as described above.

  The user can add a search condition field 9210 by pressing an add button 9220 for desired target data. That is, one or more search conditions can be specified for the search target. The user can also add the target data field set 9200 by pressing the add button 9500. According to the example of FIG. 9 and the use case in the present embodiment, since the data for the last three days is used in the analysis, three target data, specifically, the data for today (the search condition “ Time = today "), data one day ago (search condition" Time = yesterday "), and data two days ago (search condition" Time = two days ago ").

  When the OK button 9610 is pressed, the processing is executed by the C meta management program 1200 according to the information input to the request reception GUI 9000. When the Cancel button 9620 is pressed, the information input to the request reception GUI 9000 is canceled.

  Hereinafter, an example of the C meta creation process (S7060 in FIG. 7) and the snapshot operation process (S8070 in FIG. 8) will be described in detail. At that time, as in the use case described above, it is assumed that data for the last three days (today, yesterday, and yesterday) is used. 10 to 16, the illustration of the first S meta table 3000, the second S meta table 6000, and the C meta table 4000 is omitted.

  <1. C Meta Creation Processing (S7060 in FIG. 7)>

  The C meta creating process will be described with reference to FIGS. Further, in the following description, the time is represented only by month and day (the year is, for example, the same as 2015).

  FIG. 10 shows a state where the C meta 83 does not exist. For each object data 5000, there is a first S meta 82S referring to the object data 5000, but there is no second S meta 82T.

  In this state, it is assumed that the above three search conditions (data search conditions for the last three days) have been set via the request reception GUI 9000. After that, for each of the designated times, the C meta management program 1200 searches for the C meta 83 that meets the search conditions for each of the three search conditions.

  <1-1. First search>

  In the case of the first search, the C meta 83 does not exist. It is assumed that the date of the first search, that is, today for the first search (the day to which the designated time point before the change belongs) is 12/8. When the C meta 83 does not exist, the search range is at least one of the first S meta table 3000 (existing first S meta 82S) and the data area 1500 (existing object data 5000). When a search target (at least one of the first S meta 82S and the object data 5000) is found as a result of the search, the C meta management program 1200 sets the target first S meta 82S (the found first S meta 82S or Then, a C meta 83 including the S meta ID of the first S meta 82S of the found object data 5000 as one target 4110 is created. For example, as shown in FIG. 11, for the access with the access path “obj: // WeatherInfo / Day2”, the first S meta 82S (or the object data 5000) that matches the search condition “Two days ago” (that is, one day before yesterday) Since today is 12/8, this is the first S-meta (Sm_006) (or object data # 6) including "12/6" as the last update time (or Time 5050). Therefore, the C meta management program 1200 finds the first S meta (Sm_006) and creates a C meta (Cm_001) including the S meta ID “Sm_006” of the first S meta as the target 4110. As a result, as shown in FIG. 11, a C meta (Cm_001) associated with the first S meta (Sm_006) suitable for the day before is created. Similarly, a C-meta (Cm_002) associated with the first S-meta (Sm_007) adapted yesterday and a C-meta (Cm_003) associated with the first S-meta (Sm_008) adapted today are also created. If two or more first S metas are found for one search condition, the C meta management program 1200 includes the S meta ID of each found first S meta as a target 4110 in the C meta corresponding to the search condition. .

  <1-2. Search after the second time>

  As the second and subsequent searches, the second search will be described as an example.

  In the case of the second search, C meta (Cm_001) to (Cm_003) already exist. In this case, the search range is first C meta (Cm_001) to (Cm_003). In the following, a description will be given of a case where the C-meta 83 corresponding to the search condition is found (FIG. 12) and a case where such a C-meta 83 is not found (FIG. 13) in the second search. At the time of the second search, as shown in FIGS. 12 and 13, a snapshot of data for the last three days (today, yesterday, and yesterday), specifically, the second S meta (SS_005) corresponding to today ), The second S meta (SS_004) corresponding to yesterday, and the second S meta (SS_003) corresponding to yesterday are associated with one SSVOL. This is a result of the creation of C meta (Cm_001) to (Cm_003) in the first search, and the execution of the snapshot creation processing (details will be described later) for each of the C meta (Cm_001) to (Cm_003).

  <1-2-1. When C Meta 83 that meets the search condition is found >>

  Referring to FIG. It is assumed that the date of the second search, that is, today (the day to which the designated time point after the change belongs) for the second search is 12/9.

  The C meta management program 1200 creates a C meta (Cm_004) corresponding to the day before (12/7) (S11).

  The C meta management program 1200 searches the C meta table 4000 (for example, existing C meta (Cm_001) to (Cm_003)) using “12/7” as a key when searching for data of 12/7, which is the day before yesterday ( S12). As a result, a C meta (Cm_002) including the search condition 4030C “Time = 2015/12/7” and the search result 4060 “OK” is found. Note that “Time = 2015/12/7” is an example of a specific search condition uniquely determined according to the general-purpose search condition “Two days ago” and the designated time point (12/9). That is, in the present embodiment, the search conditions include general-purpose search conditions and specific search conditions. For example, the search conditions specified in the search request received by the C meta management program 1200 and the search conditions stored in the C meta may be either general-purpose search conditions or specific search conditions. When a general-purpose search condition is specified, the C-meta management program 1200 specifies a specific search condition (for example, a value to be searched) from the specified time and the general-purpose search condition, and a C , The first S-meta, the object data, or the like. When a general-purpose search condition is stored in the C-meta, in order to avoid confusion, the C-meta also stores a designated time point (for example, a reference such as a date on which the general-purpose search condition is used). May be.

  The C meta management program 1200 copies the target 4110 “SS_004” included in the found C meta (Cm_002) to the above-mentioned C meta (Cm_004) newly created in the current search (S13). The C meta (Cm_004) is a C meta (Cm_004) corresponding to the search condition of the day before yesterday and including the access path “obj: // WeatherInfo / Day1”, that is, a new C meta (Cm_004) corresponding to the day before yesterday. For this reason, the old C meta (Cm_001) corresponding to the day before yesterday becomes unnecessary.

  In a similar flow, a new C meta (Cm_005) corresponding to yesterday is created. The C meta (Cm_005) has the target 4110 “SS_005” in the old C meta (Cm_003) corresponding to today as the target 4110.

  <1-2-2. When the C-meta 83 corresponding to the search condition is not found >>

  As described above, in the second search, the old C meta (Cm_002) corresponding to yesterday (12/7) and the old C meta (Cm_003) corresponding to yesterday (12/8) are found as a result of the search.

  However, no C-meta corresponding to (12/9) is found today. Because it does not exist.

  Therefore, a C meta corresponding to today (12/9) is newly created. Specifically, it is as shown in FIG.

  That is, the C meta management program 1200 creates a C meta (Cm_006) of the access path “obj: // WeatherInfo / Day0” corresponding to today (12/9) (S21).

  The C meta management program 1200 searches the C meta table 4000 using “12/9” as a key (S22), but finds no C meta matching the key.

  In this case, the C meta management program 1200 searches the first S meta table 3000 using “12/9” as a key today (S23). In this search, the object data 5000 associated with the searched first S meta may also be checked. As a result, the first S meta (Sm_009) is found. The C meta management program 1200 copies the S meta ID “Sm — 009” of the found first S meta (Sm — 009) to the above-mentioned C meta (Cm — 006) newly created in the current search (S24).

  In this way, C meta (Cm_004) to (Cm_006) for the last three days corresponding to the second search (today, December 9) are created. Note that the C meta management program 1200 may delete the old C meta (Cm_001) to (Cm_003) that are no longer needed. The deletion may be performed at another timing, for example, when the total capacity of the C meta 83 reaches a predetermined upper limit, instead of when a corresponding new C meta is created.

  <2. Snapshot Operation Processing (S8070 in FIG. 8)>

  The snapshot operation processing will be described with reference to FIGS. The following example is a snap operation process corresponding to the first search.

  The storage program 1400 executes a snap operation process in response to a snapshot operation instruction from the C meta management program 1200. The instruction includes information about the C meta (for example, a pointer to the C meta table 4000). That is, the storage program 1400 receives information about the C meta.

  <2-1. Snapshot operation processing corresponding to initial search>

  As described above, C meta (Cm_001) to (Cm_003) exist as a result of the first search. However, in the first search, no second S meta has been created yet.

  The storage program 1400 refers to the access paths 4020 of the C meta (Cm_001) to (Cm_003) (S31). For example, “obj: // WeatherInfo / Day2” is referenced from the C meta (Cm_001).

  The storage program 1400 checks whether there is a second S meta having the access path “obj: // WeatherInfo / Day2”.

  Here, such a second S meta does not exist (is not found). For this reason, the storage program 1400 generates the snapshot ID “SS_003” (S32), and generates the second S meta (SS_003) including the snapshot ID “SS_003” and the access path “obj: // WeatherInfo / Day2”. create.

  The storage program 1400 searches the first S meta table 3000 using “Sm_006”, which is the target 4110 of the reference source C meta (Cm_001) of the access path “obj: // WeatherInfo / Day2” as a key (S33). As a result, the first S meta (Sm_006) is found. The storage program 1400 copies a predetermined information element (all information elements other than the S meta ID in the present embodiment) in the found first S meta (Sm_006) to the created second S meta (SS_003) ( S34). As a result, the reference destination of the second S meta (SS_003) is the same as the reference destination of the first S meta (Sm_006) (that is, the object data # 6).

  The storage program 1400 changes the target 4110 in the reference source C meta (Cm_001) from the S meta ID “Sm_006” to the snapshot IDSS_003 (S35). The second S meta (SS_003) corresponding to the C meta (Cm_001) can be specified using “SS_003” as a key.

  Similar processing is performed for each of the C meta (Cm_002) and (Cm_003). As a result, as shown in FIG. 15, the C meta (Cm_002) is associated with the second S meta (SS_004) corresponding to yesterday, and the C meta (Cm_003) is associated with the second S meta (SS_005) corresponding to today. ) Is associated. The SSVOL associated with these second S metas (SS_003) to (SS_005) is provided by the storage program 1400. As a result, it is possible to refer to the latest three days of data at the latest designated point in time through the SSVOL. Note that the second S meta is stored in the second S meta table 6000.

  <2-2. Snapshot operation processing corresponding to second and subsequent searches>

  As the second and subsequent searches, the second search will be described as an example. In the second search, C meta (Cm_004) to (Cm_006) exist instead of C meta (Cm_001) to (Cm_003) (see FIG. 11) in the first search (see FIG. 13). For example, the C meta (Cm_004) includes the target 4110 “SS_004” as shown in FIG.

  Please refer to FIG. The storage program 1400 refers to the access path “obj: // WeatherInfo / Day2” from the existing C meta (Cm_004) and determines whether there is a second S meta having such an access path “obj: // WeatherInfo / Day2”. Is checked (S41). When such a second S meta (SS_003) is found, the following processing is performed.

  The storage program 1400 acquires the ID “SS_003” from the found second S meta (SS_003) (S42).

  The storage program 1400 refers to the reference destination of the second S meta (SS_003) that includes “SS_003” acquired in S42 as an ID, and the second S meta (SS_004) that includes “SS_004” in the reference source C meta (Cm_004) as an ID. ) Is changed to the reference destination (S43). Specifically, the storage program 1400 duplicates the information elements 6050 to 6070 (all position sets) representing the reference destination of the second S meta (SS_004) into the information element representing the reference destination of the second S meta (SS_003) ( Overwrite. Thereby, even if the designated time is changed (even if the designated time is changed from 12/8 to 12/9), it is maintained that the second S meta (SS_003) corresponding to the day before yesterday refers to the object data of the day before yesterday. . That is, in the first search, since the day before yesterday was 12/6, the second S meta (SS_003) referred to the object data # 6 of 12/6, but in the second search, since the day before yesterday was 12/7, The second S meta (SS_003) refers to 12/7 object data # 7 (a reference destination of the second S meta (SS_004) corresponding to yesterday) instead of the object data # 6. 12/7 is yesterday in the first search (today = 12/8), but is the day before yesterday in the second search (today = 12/9).

  The storage program 1400 changes the target 4110 in the access source reference C meta (Cm_004) from “SS_004” to “SS_003” acquired in S42. Accordingly, the C meta (Cm_004) including the access path corresponding to the day before yesterday is associated with the second S meta (SS_003) corresponding to the day before yesterday, instead of the second S meta (SS_004) corresponding to the day before yesterday. That is, the association between the C meta and the second S meta is also correctly maintained.

In the above, the C meta (Cm_004) and the second S meta (SS_003) have been described as examples, but the same processing is performed for other C meta and another second S meta. Specifically, it is as follows.
(*) The second S meta (SS_004) corresponding to yesterday is specified using the access path (access path corresponding to yesterday) in the C meta (Cm_005). This is because the second S meta (SS_004) also includes the access path corresponding to yesterday. The reference destination of the second S meta (SS_004) is the reference destination of the second S meta (SS_005) corresponding to the old ID “SS_005” in the C meta (Cm_005) from the object data # 7) of 12/7. / 8 object data # 8. 12/8 is today in the first search (today = 12/8), but yesterday in the second search (today = 12/9). The old ID “SS_005” in the C meta (Cm_005) is changed to the ID “SS_004” in the second S meta (SS_004) corresponding to the access path in the C meta (Cm_005). As a result, the second S meta (SS_004) corresponding to yesterday is associated with the C meta (Cm_005) corresponding to yesterday, instead of the second S meta (SS_005) corresponding to today.
(*) The second S meta (SS_005) corresponding to today is specified using the access path (access path corresponding to today) in the C meta (Cm_006). This is because the second S meta (SS_005) also includes an access path corresponding to today. The reference destination of the second S meta (SS_005) is the reference destination of the first S meta (Sm_009) corresponding to the old ID “Sm_009” in the C meta (Cm_006) from the object data # 8 of 12/8. / 9 object data # 9. 12/9 is today in the second search. The old ID “Sm_009” in the C meta (Cm_006) is changed to the ID “SS_005” in the second S meta (SS_005) corresponding to the access path in the C meta (Cm_006). As a result, the second S meta (SS_005) corresponding to today is associated with the C meta (Cm_006) corresponding to today.

  As described above, the storage program 1400 is based on the association between the one or more C-meta that satisfies the one or more search conditions at the designated point in time after the change and the one or more second S-meta associated with the SSVOL. , The reference destination of the one or more second S metas associated with the SSVOL is maintained in one or more object data corresponding to one or more search conditions at the designated time after the change. Also, the correspondence between one or more C metas and one or more second S metas is correctly maintained. That is, the association destination of the C meta corresponding to the search condition at the specified time after the change is changed to the second S meta that refers to the object data corresponding to the same search condition at the specified time after the change (maintained). ).

  As a result, for example, today's data can always be accessed using the same access path “obj: // WeatherInfo / Day0”, and yesterday's data can always be accessed using the same access path “obj: // WeatherInfo / Day1”. it can. Therefore, the analysis program 1300 does not need to re-recognize a new SSVOL (an example of a VDM) every time the designated time point is changed.

  Although one embodiment has been described above, the present invention is not limited to the embodiment, and it goes without saying that various changes can be made without departing from the spirit of the invention.

  For example, a direct-on-write method is adopted as a snapshot method. That is, when writing occurs to object data through the data area 1500 (or SSVOL), the writing is performed in a new area inside (or outside) the data area, and the first S meta 82S and the second S meta 82T The pointed position may be rewritten. According to this method, even if writing occurs from both the information collection program 1100 and the analysis program 1300, they are not affected by each other. As described above, in the present embodiment, the snapshot of the redirect-on-write scheme is adopted, but another scheme such as the copy-on-write scheme may be adopted instead.

  For example, the data processing system may correspond to at least one of a storage system, a host system, and a management system. For example, when the host system corresponds to the data processing system, the request source that transmits the search request specifying the search key to the host system may be a client system (one or more client computers). Also, the storage system has one or more PDEVs and a storage controller connected to the one or more PDEVs, and the storage controller has a processor unit, and at least one of the one or more programs has a storage program. 1400 may be performed.

  Further, the C meta 83 may exist in the host system or the management system instead of or in addition to the storage system. Specifically, for example, for the same object (same object data 5000), a C meta 83 is created for each user (for example, for each host system or for each management system), and the C meta 83 is stored in the C meta 83. It may be provided to the corresponding user's host system or management system. When the host system or the management system receives the specification of the search condition from the user, the processor unit in the host system or the management system stores the C meta 83 that matches the search condition among the C meta 83 corresponding to the user in the host system. Alternatively, it may be searched from the management system. When the C-meta 83 is found, the host system or the management system may request the storage system to create an SSVOL to which the S-meta 82 referred to by the C-meta 83 belongs. In response to the request, the storage system may execute the C snap processing.

  Further, the C meta 83 may exist for each user. For example, for the same object data 5000, the C meta 83 created by the C meta management program 1200 of the user A is stored as the C meta 83 for the user A, and the C meta 83 created by the C meta management program 1200 of the user B is created. The meta 83 may be stored as the C meta 83 for the user B. When a search request is received from the user A, the storage program 1400 (for example, a storage controller executing the program 1400) searches for a C-meta 83 that matches the search key specified in the search request and the requesting user A. May be.

  Further, the user program (for example, the C meta management program 1200) may be executed by any of the management system, the host system, and the storage system.

  A file may be adopted as an example of the object. The data of the file may be an example of the object data in the object, and the metadata of the file may be an example of the S meta of the object.

1000: IT system

Claims (15)

An interface unit that is one or more interfaces including an interface for accessing an unstructured data source including a plurality of unstructured data;
A processor unit that is one or more processors connected to the interface unit,
The first type metadata of the at least one unstructured data is associated with the second type metadata, which is metadata including content information representing one or more content attributes of the unstructured data,
For each of the one or more unstructured data, the unstructured data includes, in addition to the first type 1 metadata which is the original metadata of the unstructured data, the first type 1 metadata A second type 1 metadata, which is a metadata based on the copy,
The processor unit provides a virtual volume associated with one or more second type-1 metadata,
The processor unit may include one or more second type metadata that match one or more search conditions at a specified time after the change, and one or more second first type metadata associated with the virtual volume. The reference destination of one or more second type 1 metadata associated with the virtual volume is changed to one or more non- Maintain structured data,
Data processing system. In a case where the one or more second type-1 metadata associated with the virtual volume includes the changed second type-1 metadata, the maintenance of the reference destination is defined as the second Changing the reference destination of the second type 1 metadata to the reference destination of the second type 1 metadata before the change,
The second type-1 metadata after the change is the second type-1 metadata associated with the first type-2 metadata,
The first second type metadata is a second type metadata that matches any one of the one or more search conditions at the designated time after the change among the one or more second type metadata. Species metadata,
The second type 1 metadata before the change is the second type 1 metadata with which the matching search condition is associated.
The data processing system according to claim 1. The second type metadata that matches the search condition at the specified time specifies an access path that is a path for accessing unstructured data corresponding to the search condition at the specified time, and the ID of the first type metadata. Including
Each of the one or more second type 1 metadata associated with the virtual volume is the same access path as the access path in any of the second type metadata, and the second type 1 metadata And the ID of
The processor unit changes an ID of the first type metadata for each of the one or more second type metadata that meets the one or more search conditions at the designated time after the change in maintaining the reference destination. By maintaining the association between the second type metadata including the same object path and the second first type metadata,
The data processing system according to claim 2. In a case where one or more second type 1 metadata associated with the virtual volume does not include the changed second type 1 metadata, maintaining the reference destination is referred to as a second second type metadata. Based on the copy of the first type 1 metadata associated with the type 2 metadata, the post-change associated with the virtual volume with reference to the unstructured data referred to by the first type 1 metadata Creating a second type 1 metadata of
The second second type metadata matches any one of the one or more search conditions at the designated time after the change among the one or more second type metadata. A second type metadata that is not associated with the second first type metadata;
The data processing system according to claim 3. At least one of the one or more second-type metadata satisfies one of the one or more search conditions at the designated time after the change, and the designated time after the change Is the second type metadata based on the existing second type metadata already existing in
The data processing system according to claim 4. The second type metadata based on the existing second type metadata matches the search condition to which the existing second type metadata matches, and is associated with the search condition at the specified time after the change corresponding to the search condition. And the second type metadata associated with the first type metadata with which the existing second type metadata is associated.
The data processing system according to claim 5. When the existing second type metadata is not present, the processor unit includes:
At least one of the first type-one metadata and the unstructured data that match the search condition that does not match any of the second-type metadata among the one or more search conditions at the designated time after the change search,
Referring to the found first type 1 metadata or the first type 1 metadata referring to the found unstructured data, and creating the type 2 metadata associated with the search condition,
The data processing system according to claim 5. The second type metadata that matches the search condition at the specified time specifies an access path that is a path for accessing unstructured data corresponding to the search condition at the specified time, and the ID of the first type metadata. Including
Each of the one or more second type 1 metadata associated with the virtual volume is the same access path as the access path in any of the second type metadata, and the second type 1 metadata And the ID of
The processor unit changes an ID of the first type metadata for each of the one or more second type metadata that meets the one or more search conditions at the designated time after the change in maintaining the reference destination. By maintaining the association between the second type metadata including the same object path and the second first type metadata,
The data processing system according to claim 1. In a case where one or more second type 1 metadata associated with the virtual volume does not include the changed second type 1 metadata, maintaining the reference destination is referred to as a second second type metadata. Based on the copy of the first type 1 metadata associated with the type 2 metadata, the post-change associated with the virtual volume with reference to the unstructured data referred to by the first type 1 metadata Creating a second type 1 metadata of
The second second type metadata matches any one of the one or more search conditions at the designated time after the change among the one or more second type metadata. A second type metadata that is not associated with the second first type metadata;
The data processing system according to claim 1. At least one of the one or more second-type metadata satisfies one of the one or more search conditions at the designated time after the change, and the designated time after the change Is the second type metadata based on the existing second type metadata already existing in
The data processing system according to claim 1. Two or more search conditions corresponding to two or more designated times of the plurality of designated times partially overlap;
The data processing system according to claim 1. The plurality of unstructured data is time-series data,
Each of the two or more search conditions is a condition relating to a time based on a certain time,
The data processing system according to claim 11. The plurality of designated times are a plurality of times according to a cycle designated in advance,
The data processing system according to claim 11. (A) providing a virtual volume associated with one or more second type-1 metadata;
Metadata including content information representing one or more content attributes of the unstructured data in the first type metadata of at least one unstructured data in the unstructured data source including the plurality of unstructured data Is associated with the second type metadata,
For each of the one or more unstructured data, the unstructured data includes, in addition to the first type 1 metadata which is the original metadata of the unstructured data, the first type 1 metadata A second type 1 metadata, which is a metadata based on the copy,
(B) associating one or more second type metadata that meets one or more search conditions at a designated time after the change with one or more second type first metadata associated with the virtual volume; A reference destination of one or more second type 1 metadata associated with the virtual volume is changed to one or more unstructured data items corresponding to the one or more search conditions at a specified time after the change. Keep in data,
Data processing method. A computer program for causing a computer to execute the following (a) and (b):
(A) providing a virtual volume associated with one or more second type-1 metadata;
Metadata including content information representing one or more content attributes of the unstructured data in the first type metadata of at least one unstructured data in the unstructured data source including the plurality of unstructured data Is associated with the second type metadata,
For each of the one or more unstructured data, the unstructured data includes, in addition to the first type 1 metadata which is the original metadata of the unstructured data, the first type 1 metadata A second type 1 metadata, which is a metadata based on the copy,
(B) associating one or more second type metadata that meets one or more search conditions at a designated time after the change with one or more second type first metadata associated with the virtual volume; A reference destination of one or more second type 1 metadata associated with the virtual volume is changed to one or more unstructured data items corresponding to the one or more search conditions at a specified time after the change. Keep in data,
Computer-readable recording medium on which is recorded.