KR101361421B1 - Method for managing address of information in network and apparatus using the same - Google Patents

Abstract

Provided are a method and apparatus for managing information addresses on a network. The information address management method on the network generates and assigns an information address on the network to the information based on the characteristics of the information existing on the network. The information address functions as an address for the information and indicates the characteristics of the information. This makes it possible to express the characteristics of the information through the information address, so that the contents can be grasped and retrieved by the information address.

Description

Method for managing address of information in network and apparatus using the same}

The present invention relates to a method and apparatus for address management, and more particularly, to a method and apparatus for managing addresses of information existing on a network.

Due to the development of the Internet and network terminals due to the arrival of the information age, a lot of information is generated / used on the network. To access information that exists on the network, you must refer to the address of the information.

Since the address system for the information existing on the network includes only the information about the address itself, it is impossible to predict what information is using the address. It is also impossible to search for the desired information using the address.

Accordingly, in order to search for network information, relational search or semantic search using a search engine should be used, which is inconvenient to manage indexes and tags of information and difficulty in creating an information map.

In addition, a search by a search word has a problem in that all desired information cannot be searched correctly.

Korean Patent Publication No. 10-2010-0108053 (2010.10.6.): Distributed control method and apparatus using a URL Korean Patent Laid-Open Publication No. 10-2003-0033338 (2003.05.01): Method for retrieving a URL address on a network Korean Patent Laid-Open No. 10-2001-0036839 (2001.05.07): A method of allocating an Internet address to an Internet access number and an internet access method using the same

The present invention has been made to solve the above problems, an object of the present invention, based on the characteristics of the information existing on the network to function as an address for the information and to represent an address that can also represent the characteristics of the information It provides a method and apparatus for creating / granting and managing.

According to an embodiment of the present invention for achieving the above object, an information address management method on a network, the method comprising: generating an information address on a network based on characteristics of information existing on a network; And assigning the information address to the information, wherein the information address functions as an address for the information and indicates a characteristic of the information.

The information address may include classification of information by a plurality of steps.

In addition, the classification by the preceding step is a higher classification than the classification by the later step, and the classification by the plurality of steps may be separated by "/" as a separator.

The information address may include a location hierarchy of the information by a plurality of steps.

In addition, the position hieraki of the information may be converted into a code corresponding to the hieraki and displayed.

The information address may include a physical address of a server in which the information exists or an information provider server providing the information, and a unique identifier of the information.

The information address management method on the network according to the present embodiment may further include retrieving the information by using an information query generated by using the address of the information. It may include at least one of addressing, domain definition of the information, and location limitation of the information.

In addition, the method for managing information addresses on a network according to the present embodiment may further include retrieving linkage information using a linkage information query generated by using addresses of the information. The linkage information query may include a linkage word. It may include the address of the subject of the association word and the address of the subject of the association word.

As described above, according to the present invention, since the information address is generated based on the characteristics of the information existing on the network, the characteristics of the information can be indicated through the information address.

Accordingly, the domain hierarchy of the information and the position hierarchy of the information can be simultaneously provided only by the address of the information, and the contents of the information can be grasped by the information address.

In addition, it is possible to search not only desired information but also related information by using the address of the information, thereby facilitating information provision / use.

1 is a diagram showing an information address system on a network applicable to the present invention;
2 illustrates queries for information retrieval on a network;
3 is a view provided to explain a concept of linkage information search;
4 is a diagram illustrating queries for linkage information;
5 is a diagram provided for explaining the position hierarchy of information and generating a unique identifier of the information, and
6 is a block diagram of a network terminal.

Hereinafter, the present invention will be described in detail with reference to the drawings.

An address system is needed to distinguish two or more pieces of information on the network. Hereinafter, as part of information address management on the network, an address system is assigned based on the location and characteristics of the information, and an address system suitable for searching / providing the addressed information or associated information related to the information will be described. This will be described in detail with respect to the information address generation, information search / provision and linked information search / provision process.

One. On the network  Information addressing system

1 is a diagram illustrating an information address system on a network applicable to the present invention. 1 illustrates an information address, which specifies one information present on the network.

The illustrated information address serves as the address itself for the information, as well as the characteristics of the information. That is, the illustrated information address provides a hint about the object of the information present in the address, which is possible because the information address system is composed of four elements, as shown in FIG.

Specifically, an information address system on a network applicable to the present invention includes 1) physical address of information, 2) information domain hierarchy of information, 3) information location hierarchy, and 4) information. It consists of a unique identifier. In the following, it is explained one by one.

1.1 Physical Address of Information

The first place in an information address on the network is the physical address of the information. This corresponds to "10.250.1.130:8088" in the information address illustrated in FIG.

The physical address of the information refers to the physical address of the server where the information exists or the server of the information provider.

1.2 Domain of Information Haieraki

The second position in the information address on the network is the domain hierarchy of the information. In the information address illustrated in FIG. 1, "/ Korea Museum / Animal / Bird / Hummingbird" corresponds to this.

The Domain Hierarchy of Information provides a hint as to what is the subject of the information, indicating the classification of the information in stages. The classifications of information are separated by "/" delimiters.

In domain hierarchies of information, a number of classifications that appear in stages are classified above the classification by the preceding stage. In other words, in the domain hierarchy of information, it is expressed as "/ top level classification / second upper level classification /.. ./ lower level classification".

There is no limit on the number of stages of classification of information. In FIG. 1, it is assumed that the information is classified into four stages. In other words, the information of the address shown in Figure 1, 1) the highest classification is "Korean Museum", 2) the second higher classification is "animal", 3) the third higher classification is "bird", and 4) the fourth The upper classification is "hummingbird".

Therefore, it can be guessed that the information of the address shown in FIG. 1 by the domain Hieraki of the information belongs to the "hummingbird" of the "bird" of the "animal" in the "Korean museum".

Since the domain hierarchy of information is not the location of the information, it is not possible to determine the location where the information is stored through the domain hierarchy of the information. It only helps to identify what the information is about.

1.3 Location of Information Haieraki

The third position in the information address on the network is the location hierarchy of the information. This corresponds to "/ biological research / America" in the information address illustrated in FIG. On the other hand, the domain hierarchies of information and the position hierarchies of information are separated by "? Loc =".

Location of Information A hierarchy indicates where the information is stored, where the logical location of the information appears in stages. Logical locations of information are separated by "/" delimiters.

Location of Information In Hieraki, logical locations that appear in stages are directories (folders) whose logical location by the previous step is higher than the logical location by the later step. That is, in the domain hierarchy of information, it is expressed as "/ top directory / second top directory /.../ bottom directory".

There is no limit on the number of location steps of information. In FIG. 1, it is assumed that the information has two positions. That is, for the information of the address shown in FIG. 1, 1) the upper directory is "biological research", and 2) the lower directory is "America".

Thus, the location of the address shown in FIG. 1 by the location hieraki of the information is designated as the "America" directory subordinate to the "Biological Research" directory.

Since the location hierarchy of information is not information about the object of information, it is not possible to grasp what information is information through the location hierarchy of information. It only knows where the information is stored.

1.4 Unique Identifier of Information

Last in the information address on the network is a unique identifier of the information for specifying the information. This corresponds to "Green Tomtail" in the information address illustrated in FIG. 1. The unique identifier of the information is separated from the information hierarchy by separating the information with "/".

So far, the information addressing system on the network has been described in detail. According to the information address system on the network presented in the present embodiment, the logical location of the information can be identified through the location hierarchy of the information, and the information target (i.e., information classification through the domain hierarchy of the information). How the information is classified).

2. On the network  Search / provide information

If an information address is specified according to the information address system shown in "1.", information search / provision is possible using the information address. Information retrieval existing on the network can be classified into 1) retrieval by address, 2) retrieval by domain limitation of information, and 3) retrieval by domain and location limitation of information.

According to the address system presented in "1.", the queries for the above search are illustrated in FIG. 2 and will be described in detail below one by one.

1) Search by address, as shown in (1) of Figure 2, the actual address "10.250.1.130:8088 / Korean Museum / Animal / Bird / Hummingbird? Loc = / Biological Research / America / Green Tomtail" To search for "Green Tomtail".

2) The search by domain limitation of information, as shown in (2) of FIG. 2, restricts the domain of information to "/ Korea Museum / Animals / Birds / Hummingbirds" and "Animal" in "Korea Museum" Among the "algae", "green houndtail" belonging to the "hummingbird" is to search.

3) Searching by domain and location limitation of information, as shown in (3) of FIG. 2, limits the domain of information to "/ Korea Museum / Animal / Bird / Hummingbird" and the location of information to "/ Bio "Research", the "animal" in the "Animals" of the "birds" of the "birds" and at the same time, the "/ biological research" to search for information located in the directory.

"-" in "? loc = / biology /-" means only that directory. The latter part of the query can be replaced with "? Loc = / biology / *", where "*" is a directive to scope the search to the directory and all its subdirectories.

On the other hand, although not mentioned in the above examples, it is of course also possible to assume a search by location limitation of the information by searching for information existing on the network.

3. On the network  Search / provide related information

If an information address is specified according to the information address system shown in "1.", it is possible to search / provide information associated with the information. The linkage information query for searching / providing linkage information includes a link word, a subject of the link word, and a subject of the link word.

3 is a diagram provided to explain a concept of linkage information retrieval. In the linkage information search illustrated in FIG. 3, 1) the relation name is "eat", and 2) the subject of the association word, that is, the "eater" is "/ Korea Museum / Animal / Bird / Hummingbird family. ? loc = / biological research / America / green tomtail ”, and 3) the subject of the linkage (to), ie 'the eater', is" / Korean museum / animal / arthropod / beetle? loc = / biological research / America / Damaster ".

4 illustrates search query words using the link word, the subject of the link word, and the subject of the link word as shown in FIG. 3.

In the search query shown in (1) of Figure 4,

1) The linker is "eat",

2) "~ Damaster" located after 'to = eat' becomes the subject of the linked word,

3) "to = eat" The "~ Green Tomtail" located before is the subject of the link word.

Therefore, the search query shown in (1) of FIG. 4 is, "Does ~~ Green Tomtail eat ~ Damas?" to be.

The search query word shown in (1) of FIG. 4 can also be expressed as the search query word shown in (2) of FIG.

In the search query shown in (2) of Figure 4,

1) The linker is "eat",

2) "~ Green Tomtail" located after "from = eat" is the subject of the linked word,

3) '~ Damaster' located before '~ Damaster' is the subject of the linked word.

Therefore, the search query shown in (2) of FIG. 4 is, "is it eaten by ~ green tom tail?" In other words, "~ Damaser's natural enemy is ~ green tom tail?"

The related searches shown in FIG. 4 correspond to searches by address, which is an example for convenience of description. Similar to the information retrieval presented in "2.", the related searches are also searched by domain limitation of subject / subject of linked word, search by position limitation of subject / subject of linked word, subject of linked word. Of course, searches by domain and location constraints on the subject are possible.

4. On the network  Information address generation

For information on the network, an information address on the network is generated and assigned based on its location and characteristics, and the address information is generated according to the information address system shown in "1.".

In generating the information address, the physical address of the information is determined by the physical address of the server where the information exists or the information provider server, and the domain hierarchy of the information is determined by the classification of the information.

A method of determining a location hierarchy of information and a unique identifier of the information will be described in detail with reference to FIG. 5. 5 is a diagram provided to explain a method of determining a location hierarchy and a unique identifier of information.

In the upper part of FIG. 5, the address of the information shown in FIG. 1 is shown. Here, the position hierarchies and the information identifiers of the information are indicated by a string indicating the actual meaning of the information.

In the lower part of FIG. 5, the position hierarchies and information identifiers of the information are converted into numeric strings which do not represent actual meanings. Specifically, "biological research" is converted to "13", "America" is "260", and "Green Tomtail" is converted to "413", respectively, the information address is "10.250.1.130:8088 / Korea Museum / Animal / Algae / hummingbird? Loc = / 13/260/413 ".

Location of information Hieraki and unique identifiers of information are preferably converted to numeric strings instead of strings that directly indicate their meaning. It is also possible to convert the location hierarchies and information unique identifiers of information into codes other than numbers, which is a matter of choice.

On the other hand, when it is necessary to newly generate an address of information about something other than "Green Tomtail", it is possible to generate an identification number by adding 1 to the unique identifier of the final information. For example, if you create another piece of information in the "/ 13/260" directory, the address will be "10.250.1.130:8088/Korea Museum / Animals / Birds / Hummingbirds? Loc = / 13/260/414" .

Accordingly, since it does not depend on the type of information (no need to have an internal role to write a specific item of information as an identifier), and user input is not necessary, it can be used as a system for creating an identifier of a lot of information.

5. Network terminal

6 is a block diagram of a network terminal capable of performing networking according to the information address system shown in " 1. " The network terminal 100 shown in FIG. 6 may function as a server, a client, a server & a client on a network.

As shown in FIG. 6, the network terminal 100 includes a communication interface 110, a display 120, a processor 130, a user interface 140, and a storage 150.

The communication interface 110 is a means connected to communicate with other network terminals connected to the network.

The display 120 is a means for displaying a result of execution by the processor 130 and providing the result to the user, and the user interface 140 is a means for transmitting a user command to the processor 130.

The storage unit 150 stores programs and data necessary for the network terminal 100 to operate.

When the network terminal 100 is a server, the processor 130 generates and assigns an information address on the network according to the above-described information address system on the network, manages an address for information on the network, and retrieves information / associated information. do.

Meanwhile, the processor 130 of the network terminal 100 serving as a client receives information from the network terminal 100 serving as a server.

It goes without saying that the technical idea of the present invention can also be applied to a computer-readable recording medium having a computer program for performing the functions of the apparatus and method according to the present embodiment. In addition, the technical idea according to various embodiments of the present invention may be embodied in computer-readable code form recorded on a computer-readable recording medium. The computer-readable recording medium is any data storage device that can be read by a computer and can store data. For example, the computer-readable recording medium may be a ROM, a RAM, a CD-ROM, a magnetic tape, a floppy disk, an optical disk, a hard disk drive, or the like. In addition, the computer readable code or program stored in the computer readable recording medium may be transmitted through a network connected between the computers.

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 present invention.

100: network terminal
110: communication interface
120: Display
130: processor
140: user interface
150:

Claims (8)

Generating, by the network server, an information address on the network based on the characteristics of the information present on the network; And
Providing, by the network server, the information address to the information;
The information address is
The information address management method on the network, characterized in that it comprises a 'part that functions as an address for the information' and 'part that indicates the characteristics of the information without indicating the location where the information is stored.'
The method of claim 1,
The information address is
An information address management method on a network comprising a classification of information by a plurality of steps.
3. The method of claim 2,
The classification by the previous step is higher than the classification by the next step,
The classification by the plurality of steps is an information address management method on a network, characterized in that separated by "/" as a separator.
The method of claim 1,
The information address is
And a location hierarchy of the information by a plurality of steps.
5. The method of claim 4,
The position hieraki of the information,
A method for managing information addresses on a network, characterized by being converted into a code corresponding to a hieraki.
The method of claim 1,
The information address is
The physical address of the server where the information exists or the information provider server providing the information is located at the front, and the unique identifier of the information is located at the back.
The method of claim 1,
Retrieving, by the network server, the information using an information query generated by using the address of the information;
The information query,
And at least one of addressing of the information, domain limitation of the information, and location limitation of the information.
The method of claim 1,
Retrieving, by the network server, the association information by using the association information query generated by using the addresses of the information.
The association information query,
An information address management method on a network, comprising an associated word, an address of an associated word subject, and an address of an associated word subject.

Images