KR20160060357A - Apparatus for data storage and operatimg method thereof - Google Patents

Abstract

Disclosed are a data storage apparatus and an operating method thereof. According to the present invention, a data identifier is designated as a search keyword, wherein the data identifier configured to represent data required by a target program, and a program identifier, configured to represent the target program, is mapped and saved with regard to the designated search keyword. Accordingly, by only inputting a data identifier composed of a string of characters, it is possible to extract a target program which can be executed or generated. The data storage apparatus comprises: a confirming unit; and a designating unit.

Description

[0001] APPARATUS FOR DATA STORAGE AND OPERATING METHOD THEREOF [0002]

The present invention relates to a data storage method capable of easily extracting a target program that can be executed or generated by using a data identifier consisting of a string as a search keyword.

Until now, the way to store vast amounts of data has been very diverse and efficient.

However, in the course of development of various programs such as the web, it often happens that a large amount of data as well as simple (small amount) data are stored, retrieved or extracted.

Unlike the vast amounts of data mentioned above, it is common to store simple data in accordance with simple rules, or simply store it without additional rules.

However, if it is assumed that simple data is formed but a complex relationship is formed between the data or the programs requiring the data, the simple storage method may seriously hinder the efficiency in searching and extracting the stored data .

SUMMARY OF THE INVENTION The present invention has been made in view of the above circumstances, and an object to be achieved by the present invention is to provide a data search method, a data search method, And storing the identifiers in a mapping table so that a target program capable of being executed or generated can be easily extracted using a string corresponding to the data identifier as a search keyword.

According to a first aspect of the present invention, there is provided a data storage device for storing a plurality of data required in connection with generation or execution of a program, the data storage device including a target program requesting at least a part of the data, A confirmation unit for confirming; And a designation unit for designating a search keyword including a data identifier indicating at least a part of the data and mapping the program identifier of the identified target program to the designated search keyword.

More specifically, an additional identifier is assigned to the search keyword, and the additional identifier includes the number of data identifiers included in the search keyword.

More specifically, the target program includes a first target program in which a first search keyword is designated and a second target program in which a second search keyword is designated, and when the second search keyword is overlapped with the first search keyword , A data identifier included in the first search keyword is designated by the search keyword, and a search keyword designated by a data identifier included in the first search keyword includes data overlapping between the first search keyword and the second search keyword And the number of identifiers is given as the additional identifier.

More specifically, when the data identifier partially overlaps between the first search keyword and the second search keyword, only the program identifier of the second target program is stored in the search keyword designated by the data identifier included in the first search keyword Mapped and stored.

According to a second aspect of the present invention, there is provided a method of operating a data storage device for storing a plurality of data required for generating or executing a program, A confirmation step of confirming the target program; And a designation step of designating a search keyword including a data identifier indicating the at least a part of the data so that the program identifier of the identified target program is mapped to the designated search keyword and stored.

More specifically, an additional identifier is assigned to the search keyword, and the additional identifier includes the number of data identifiers included in the search keyword.

More specifically, the target program includes a first target program in which a first search keyword is designated and a second target program in which a second search keyword is designated, and when the second search keyword is overlapped with the first search keyword , A data identifier included in the first search keyword is designated by the search keyword, and a search keyword designated by a data identifier included in the first search keyword includes data overlapping between the first search keyword and the second search keyword And the number of identifiers is given as the additional identifier.

According to the data storage device and the operation method thereof, a data identifier indicating data requested by the target program is designated as a search keyword, and a program identifier indicating the target program is mapped and stored to the specified search keyword, It is possible to easily extract the target program that can be executed or generated only by inputting the data identifier.

1 is a schematic configuration diagram of a data storage device according to an embodiment of the present invention;
2 to 4 are diagrams for explaining a data storage method in a data storage device according to an embodiment of the present invention;
5 is a diagram for explaining an operational flow in a data storage device according to an embodiment of the present invention;

Hereinafter, an embodiment of the present invention will be described with reference to the accompanying drawings.

FIG. 1 illustrates a data storage device according to an embodiment of the present invention. Referring to FIG.

As shown in FIG. 1, the data storage device according to an embodiment of the present invention includes a confirmation unit 100 for confirming a target program that requests data for creating or executing a program, and a search keyword And a designation unit 200 that designates a designation of the designation of the designation.

In addition, in the case of the data storage device according to an embodiment of the present invention, in addition to the above-described configuration, a storage unit 300 for mapping and storing a search keyword and an object program, and an extracting unit 400). ≪ / RTI >

All or a part of the configuration of the data storage device including the above-described confirmation unit 100, the specification unit 200, the storage unit 300, and the extraction unit 400 may be implemented as a hardware module or a software module, Or a combination of a hardware module and a software module.

Meanwhile, according to an embodiment of the present invention, a plurality of data required for generation (development) or execution of a program is stored, and stored data is searched and extracted.

Here, the data stored in the data storage device refers to a simple (small amount) data rather than a vast amount of data, and it is premised that a complicated relationship can be formed between data or programs requiring the data.

Generally, a large amount of data occupies a large amount of storage space, and the search time is also stored for example in a database or in a local storage for a long period of time.

However, using simple databases or using local storage is inefficient because simple data does not take up a lot of storage space and search time is not so important.

For this reason, it has been common to use a simple storage method in which simple data is stored in accordance with JSON (Javascript Object Notation) format or stored without extra rules.

However, despite the simple data mentioned above, there is a complicated relationship between the stored data and the programs requiring the data. If the data is stored using the conventional simple storage method, the stored data is searched and extracted It can be expected that great difficulties will follow.

Accordingly, in one embodiment of the present invention, a method for enabling a more intuitive and quick search and extraction of stored data in storing a plurality of data is proposed, which will be described in detail below.

For convenience of explanation, it is assumed that there exists a target program A, a target program B, and a target program C that request data stored in the data storage device.

That is, as shown in FIG. 2, the 'target program A' exists. In order to generate or execute the 'target program A', among the plurality of data stored in the data storage device, 'Data # 1' Data # 2 (Name) ', and' Data # 3 (Description) 'are required.

As shown in FIG. 3, 'target program B' exists in addition to 'target program A'. To generate or execute the target program B, 'data # 1 (Price)', which overlaps with 'target program A' Data # 4 (Image) 'is required in addition to' Data # 2 (Name) 'and' Data # 2 (Name) '.

Finally, as shown in FIG. 4, a 'target program C' may additionally exist. In the case of the target program C, the target program A and the target program B are overlapped , 'Data # 1 (Price)' and 'Data # 2 (Name)' are required.

The confirmation unit 100 performs a function of confirming the target program.

More specifically, the verification unit 100 confirms a target program that requests data of at least a part of a plurality of pieces of data stored in association with the generation or execution of the program.

For example, according to the premise of the foregoing, the confirmation unit 100 may include a 'target program A' requesting 'Data # 1 (Price)', 'Data # 2 (Name)', and 'Data # 3 ; 'Target program B' requesting 'Data # 1 (Price)', 'Data # 2 (Name)', and 'Data # 4 (Image)'; And the 'target program C' requesting 'data # 1 (price)' and 'data # 2 (name)'.

The designation unit 200 performs a function of designating a search keyword for a target program.

More specifically, when the target program requesting data for creation or execution is identified, the designation unit 200 designates a search keyword for the confirmed target program, thereby causing the storage unit 300 to designate The program identifier (e.g., name) of the identified target program can be mapped and stored.

Here, the search keyword may be specified to include a data identifier (e.g., data name) of data requested by the target program as information for searching and extracting a target program later.

The controller 200 extracts a data identifier (e.g., a name) of data requested by the identified target program and identifies the extracted data identifiers using a delimiter (e.g., '_') A search keyword for each target program is specified.

For example, 'Data # 1 (Price)', 'Data # 2', and 'Data # 3' are required for the 'target program A' Quot; Price_Name_Description " may be designated as a search keyword.

In addition, since 'Data # 1', 'Data # 2', and 'Data # 4' are required for the 'target program B' The listed 'Price_Name_Image' may be designated as a search keyword.

Finally, since 'Data # 1 (Price)' and 'Data # 2 (Name)' are required for the target program C ',' Price_Name 'in which data identifiers of the respective data are listed using delimiters is used as a search keyword Can be specified.

On the other hand, according to the premise of the foregoing, among the data requested by 'target program A', 'target program B', and 'target program C', 'data # 1 (price)' and 'data # I have mentioned duplication.

In this regard, when 'Price_Name' is designated as the search keyword of the 'target program C', 'Data # 1 (Price)' and 'Data # 2 (Name)' are stored in the target program extraction step There is a problem that the target program A and the target program B that are needed together are not extracted.

Accordingly, the designation unit 200 solves the problem of data redundancy required in each of the above-mentioned target programs by giving an additional identifier to the designated search keyword.

At this time, the designation unit 200 first counts the number of data identifiers included in the search keyword designated to each target program, and gives the number of the counted data identifiers as an additional identifier for the search keyword.

According to the previous example, since three data identifiers are included in the 'Price_Name_Description' which is the search keyword designated for the 'target program A', '[3]' is given as an additional identifier to the search keyword designated for the 'target program A' , And finally 'Price_Name_Description [3]' may be designated as a search keyword for 'target program A'.

Also, since 'Price_Name_Image', which is a search keyword specified for 'target program B', also includes three data identifiers, '[3]' is given as an additional identifier to the search keyword designated for 'target program B' 'Price_Name_Image [3]' may be designated as a search keyword for 'target program B'.

Lastly, in the case of the 'Price_Name' which is the search keyword specified for the 'target program C', since two data identifiers are included, '[2]' is given as an additional identifier to the search keyword designated for the 'target program C' , And finally 'Price_Name [2]' may be designated as a search keyword for 'target program C'.

In order to consider data overlapping among the target programs, the designation unit 200 additionally specifies a search keyword having a hierarchical structure in which the number of duplicated data is added as an additional identifier to the finally specified search keyword for each target program .

In the preceding premise, it is assumed that two pieces of data of 'Data # 1 (Price)' and 'Data # 2 (Name)' among the data required by 'Target program A' overlap with 'Target program B' and 'Target program C' I have mentioned.

Accordingly, when the search keyword of the hierarchical structure for the 'target program A' is additionally designated, the designation unit 200 determines whether the target keyword 'Price_Name_Description' is duplicated with the 'target program B' and the 'target program C' 'Price_Name_Description [2]' to which the number of data identifiers is added as an additional identifier is additionally designated as a search keyword for 'target program A'.

Here, 'Target Program A', 'Target Program B', and 'Target Program C' can be mapped and stored in 'Price_Name_Description [2]' which is a search keyword added to 'Target Program A' 'Price_Name_Description [3]' is designated as a search keyword. Therefore, only 'target program B' and 'target program C' can be mapped and stored in the additional designated search keyword 'Price_Name_Description [2]'.

As a result, 'Price_Name_Description [3]' and 'Price_Name_Description [2]' are designated as search keywords assigned to 'target program A', and each search keyword is hierarchically structured according to the size priority of numerals .

Likewise, when the search keyword of the hierarchical structure for the 'target program B' is additionally designated, the designation unit 200 determines whether the target program A and the target program C overlap with the initially specified search keyword 'Price_Name_Image' 'Price_Name_Image [2]', to which the number of data identifiers is added as an additional identifier, is additionally designated as a search keyword for 'target program B'.

Here, 'Target Program A', 'Target Program B', and 'Target Program C' can be mapped and stored in 'Price_Name_Image [2]' which is a search keyword additionally assigned to 'Target Program B' 'Price_Name_Image [3]' is designated as a search keyword, only 'Target Program A' and 'Target Program C' can be mapped and stored in the additional designated search keyword 'Price_Name_Image [2]'.

As a result, 'Price_Name_Image [3]' and 'Price_Name_Image [2]' can be designated as the search keywords designated to the 'target program B' Can be arranged in a hierarchical structure.

For reference, the search keywords designated for each target program and the target programs mapped to the respective keywords are summarized in Table 1 below.

Target program Search Keywords Mapped to Target Program A Price_Name_Description [3] Target Program A Price_Name_Description [2] Target program B, target program C Target program B Price_Name_Image [3] Target program B Price_Name_Image [2] Target program A, target program C Target program C Price_Name [2] Target program C

The extracting unit 400 performs a function of extracting a target program.

More specifically, if the input character string is received as a search keyword after the mapping between the search keyword and the target program is completed, the extracting unit 400 checks the search keywords included in the received character string, The program identification information of the target program mapped and stored in the keyword is extracted and provided.

For example, referring to Table 1, when a string corresponding to 'Price_Name' is received as a search keyword input from a user, it is classified into 'Price_Name_Description [3]', 'Price_Name_Description [2]', 'Price_Name_Image [3] Target program A ',' target program B ', and' target program C 'is extracted and provided since it is a character string included in all of' Price_Name_Image [2] ',' Price_Name_Image [ can do.

As another example, when a string corresponding to 'Price_Name_Description' is received as a search keyword input from a user, since it is a string contained only in Price_Name_Description [3], it is possible to extract and provide program identification information for 'target program A' have.

As described above, according to the data storage device according to the embodiment of the present invention, since the database is constructed in a simple string form, the storage space is very small, and when searching the stored data, fast. In addition, since data of complex relations are stored intuitively, it is easy to access, re-processing after data access is unnecessary, and data is stored not in a simple list but in a hierarchical structure in accordance with the priority. The enemy does not require a sorting process.

Hereinafter, an operation flow in the data storage device according to an embodiment of the present invention will be described with reference to FIG.

Here, for convenience of description, the configurations shown in FIGS. 1 to 4 will be described with reference to corresponding reference numerals.

First, the confirmation unit 100 confirms a target program that requests at least a part of data stored in association with the creation or execution of the program (S100).

At this time, the confirmation unit 100 includes an 'object program A' requesting 'Data # 1 (Price)', 'Data # 2 (Name)' and 'Data # 3' 'Target program B' requesting 'Data # 1 (Price)', 'Data # 2 (Name)', and 'Data # 4 (Image)'; And the 'target program C' requesting 'data # 1 (price)' and 'data # 2 (name)'.

Then, when the target program requesting data for creation or execution is identified, the designation unit 200 designates a search keyword for the confirmed target program so that the storage unit 300 confirms (E.g., name) of the target program to be stored (S200).

At this time, the designation unit 200 extracts a data identifier (e.g., name) of the data requested by the identified target program and identifies the extracted data identifiers by using a delimiter (e.g., '_') A search keyword for each target program is specified.

For example, since the designation unit 200 is required to receive the data # 1, the data # 2, and the data # 3 for the target program A, Quot; Price_Name_Description ", which is a list of data identifiers of " Price_Name_Description "

Also, since the designation unit 200 is required to receive data # 1 (Price), Data # 2 (Name), and Data # 4 (Image) for the target program B, &Quot; Price_Name_Image " in which identifiers are arranged using delimiters may be designated as a search keyword.

Lastly, the controller 200 requests' Data # 1 (Price) 'and' Data # 2 (Name) 'for the' target program C ', so that the data identifier of each data is' Price_Name 'may be designated as a search keyword.

Then, the assigning unit 200 assigns an additional identifier to the designated search keyword to solve the problem due to the duplication of data required in each target program (S300).

At this time, the designation unit 200 first counts the number of data identifiers included in the search keyword designated to each target program, and gives the number of the counted data identifiers as an additional identifier for the search keyword.

According to the previous example, since three data identifiers are included in the 'Price_Name_Description' which is the search keyword designated for the 'target program A', '[3]' is given as an additional identifier to the search keyword designated for the 'target program A' , And finally 'Price_Name_Description [3]' may be designated as a search keyword for 'target program A'.

Also, since 'Price_Name_Image', which is a search keyword specified for 'target program B', also includes three data identifiers, '[3]' is given as an additional identifier to the search keyword designated for 'target program B' 'Price_Name_Image [3]' may be designated as a search keyword for 'target program B'.

Lastly, in the case of the 'Price_Name' which is the search keyword specified for the 'target program C', since two data identifiers are included, '[2]' is given as an additional identifier to the search keyword designated for the 'target program C' , And finally 'Price_Name [2]' may be designated as a search keyword for 'target program C'.

Further, in order to consider data overlapping among the target programs, the designation unit 200 additionally specifies a search keyword of a hierarchical structure in which the number of redundant data is added as an additional identifier to the finally specified search keyword for each target program (S400).

At this time, when the search keyword of the hierarchical structure for the 'target program A' is additionally designated, the designation unit 200 determines whether the target program B and the target program C are overlapped with the initially specified search keyword 'Price_Name_Description' 'Price_Name_Description [2]' to which the number of data identifiers is added as an additional identifier is additionally designated as a search keyword for 'target program A'.

Here, 'Target Program A', 'Target Program B', and 'Target Program C' can be mapped and stored in 'Price_Name_Description [2]' which is a search keyword added to 'Target Program A' 'Price_Name_Description [3]' is designated as a search keyword. Therefore, only 'target program B' and 'target program C' can be mapped and stored in the additional designated search keyword 'Price_Name_Description [2]'.

As a result, 'Price_Name_Description [3]' and 'Price_Name_Description [2]' can be designated as the search keywords assigned to 'target program A'.

Likewise, when the search keyword of the hierarchical structure for the 'target program B' is additionally designated, the designation unit 200 determines whether the target program A and the target program C overlap with the initially specified search keyword 'Price_Name_Image' 'Price_Name_Image [2]', to which the number of data identifiers is added as an additional identifier, is additionally designated as a search keyword for 'target program B'.

Here, 'Target Program A', 'Target Program B', and 'Target Program C' can be mapped and stored in 'Price_Name_Image [2]' which is a search keyword additionally assigned to 'Target Program B' 'Price_Name_Image [3]' is designated as a search keyword, only 'Target Program A' and 'Target Program C' can be mapped and stored in the additional designated search keyword 'Price_Name_Image [2]'.

As a result, 'Price_Name_Image [3]' and 'Price_Name_Image [2]' can be designated as the search keywords designated to the 'target program B'.

Thereafter, the extraction unit 400 checks the search keywords included in the received character string when the character string input by the user is received as the search keyword after the mapping between the search keyword and the target program is completed, And extracts and provides the program identification information of the target program that is mapped and stored (S500 - S700).

In this case, when a string corresponding to 'Price_Name' is received as a search keyword inputted from a user, 'Price_Name_Description [3]', 'Price_Name_Description [2]', 'Price_Name_Image [3]', 'Price_Name_Image [ The target program A ', the target program B', and the 'target program C' because the program is a string included in 'Price_Name [2]'.

If a string corresponding to 'Price_Name_Description' is received as a search keyword inputted from a user, it is a string contained only in Price_Name_Description [3], so that program identification information for 'target program A' can be extracted and provided.

As described above, according to the method of operating the data storage device according to the embodiment of the present invention, since the database is constructed in the form of a simple string, the storage space is very small, and when searching the stored data, The speed is fast. In addition, since data of complex relations are stored intuitively, it is easy to access, re-processing after data access is unnecessary, and data is stored not in a simple list but in a hierarchical structure in accordance with the priority. The enemy does not require a sorting process.

Meanwhile, the steps of a method or algorithm described in connection with the embodiments disclosed herein may be embodied directly in hardware, or may be embodied in a computer readable medium, in the form of a program instruction, which may be carried out through various computer means. The computer-readable medium may include program instructions, data files, data structures, and the like, alone or in combination. The program instructions recorded on the medium may be those specially designed and constructed for the present invention or may be available to those skilled in the art of computer software. Examples of computer-readable media include magnetic media such as hard disks, floppy disks and magnetic tape; optical media such as CD-ROMs and DVDs; magnetic media such as floppy disks; Magneto-optical media, and hardware devices specifically configured to store and execute program instructions such as ROM, RAM, flash memory, and the like. Examples of program instructions include machine language code such as those produced by a compiler, as well as high-level language code that can be executed by a computer using an interpreter or the like. The hardware devices described above may be configured to operate as one or more software modules to perform the operations of the present invention, and vice versa.

While the present invention has been particularly shown and described with reference to exemplary embodiments thereof, it is to be understood that the invention is not limited to the disclosed exemplary embodiments, but, on the contrary, It will be understood by those skilled in the art that various changes in form and details may be made therein without departing from the spirit and scope of the invention as defined by the appended claims.

According to the data storage device and the operation method thereof of the present invention, it is possible to easily extract a target program that can be executed or generated by using a data identifier composed of a string as a search keyword, The present invention is not limited to the use of the present invention, but merely has a possibility of commercialization or operation of the applied device, and is practically usable since it is practically possible to carry out clearly.

100:
200: Government
300:
400:

Claims (9)

1. A data storage device for storing a plurality of data required in connection with generation or execution of a program,
A confirmation unit for confirming a target program requesting data of at least a part of the plurality of data; And
And a designation unit for designating a search keyword including a data identifier indicating the at least a part of the data so that the program identifier of the identified target program is mapped and stored for the designated search keyword. The method according to claim 1,
In the search keyword,
Additional identifiers are given,
Wherein the additional identifier comprises:
And the number of data identifiers included in the search keyword is included. 3. The method of claim 2,
Wherein the target program comprises:
A first target program in which a first search keyword is designated and a second target program in which a second search keyword is designated,
A data identifier included in the first search keyword is designated as the search keyword when the second search keyword is overlapped with the first search keyword,
The search keyword designated by the data identifier included in the first search keyword,
Wherein the number of data identifiers overlapping between the first search keyword and the second search keyword is given as the additional identifier. The method of claim 3,
If the data identifier partially overlaps between the first search keyword and the second search keyword,
Wherein only the program identifier of the second target program is mapped and stored in the search keyword designated by the data identifier included in the first search keyword. A method of operating a data storage device that stores a plurality of data required in connection with the creation or execution of a program,
A confirming step of confirming a target program requesting data of at least a part of the plurality of data; And
And a designation step of designating a search keyword including a data identifier indicating at least a part of the data so that the program identifier of the identified target program is mapped to the designated search keyword and stored. Lt; / RTI > 6. The method of claim 5,
In the search keyword,
Additional identifiers are given,
Wherein the additional identifier comprises:
And the number of data identifiers included in the search keyword is included. The method according to claim 6,
Wherein the target program comprises:
A first target program in which a first search keyword is designated and a second target program in which a second search keyword is designated,
When the second search keyword is overlapped with the first search keyword,
The data identifier included in the first search keyword is designated as the search keyword,
The search keyword designated by the data identifier included in the first search keyword,
Wherein the number of data identifiers overlapping between the first search keyword and the second search keyword is given as the additional identifier. 8. The method of claim 7,
If the data identifier partially overlaps between the first search keyword and the second search keyword,
Wherein only the program identifier of the second target program is mapped and stored in the search keyword designated by the data identifier included in the first search keyword. A program stored on a medium for carrying out each step of the method of any one of claims 5 to 8.

Images