KR20190058922A - Data management and search method of each of nodes communicating each other and computer device operating as one of nodes - Google Patents

Abstract

According to an embodiment of the present invention, provided is a method for managing and searching data in any one of a plurality of nodes communicating with each other through a network. The method comprises the steps of: storing and updating a block chain by linking data blocks generated in a plurality of nodes, wherein each of the data blocks includes at least one contact and information corresponding to at least one contact; receiving a request message including a contact; searching a contact from at least a portion of the data blocks of the block chain in response to the request message; and providing feedback information for the request message in accordance with information corresponding to the searched contact extracted from at least a portion of the data blocks, when the search of the contact is successful.

Description

TECHNICAL FIELD [0001] The present invention relates to a data management and search method for each of nodes communicating with each other through a network, and a computer apparatus operating with any one of the nodes. [0002]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to electronic devices, and more particularly, to a method of managing and retrieving data for each of the nodes communicating with each other via a network, and to a computer apparatus operating with any one of such nodes.

The block chain uses a method of sharing data with a large number of participants to prevent counterfeiting of data. The block chain can be applied to a bit coin, which is a typical online virtual currency. Bit coin records transactions on a book that anyone can read, and many participants who use bit coin verify transaction details at a set time interval to prevent hacking. That is, the block chain includes a decentralized structure in which all network participants share and store transaction details. Satoshi Nakamoto's paper entitled "Bitcoin: A Peer-to-Peer Electronic Cash System," published in 2008, describes a P2P system that does not involve central financial institutions And a method of solving the problem of double spending by using a cryptographic function and receiving incentives through decentralized nodes participating in the mining process .

The conventional method of providing information on a telephone number stores and manages data in a cloud using a centralized server, and users access the cloud to request or retrieve data. This method not only requires a large-capacity storage device but also requires a centralized server for managing the system, which complicates the design and maintenance of the system.

It should be understood that the above description is intended to assist the understanding of the background of the technical ideas of the present invention only and thus it can not be understood that it corresponds to the prior art known to those skilled in the art.

Embodiments of the present invention are intended to prevent a database storing information about telephone numbers from being falsified or altered and to ensure that the information provided to the user from the database is highly reliable. For example, information about phone numbers may be stored in a block chain.

A method for managing and searching data in any one of a plurality of nodes communicating with each other through a network according to an embodiment of the present invention includes: storing and updating a block chain by linking data blocks generated in the plurality of nodes Each of the data blocks including at least one telephone number and information corresponding to the at least one telephone number; Receiving a request message including a telephone number; In response to the request message, retrieving the telephone number from at least a portion of the data blocks of the block chain; And providing feedback information for the request message according to information corresponding to the retrieved telephone number extracted from the at least a portion of the data blocks when the retrieval of the telephone number is successful.

The step of retrieving the telephone number may include retrieving the telephone number from a highest data block of the data blocks of the block chain and a predetermined number of data blocks sequentially linked to the highest data block .

The data blocks each including time stamps, wherein the step of retrieving the telephone number comprises retrieving the telephone number from data blocks having time stamps that fall within a predetermined time of the data blocks of the block chain can do.

The information corresponding to the at least one telephone number included in each of the data blocks may include a reputation for the at least one telephone number.

The information corresponding to the at least one telephone number included in each of the data blocks may include a comment for the at least one telephone number.

Wherein the data blocks include a first data block, wherein storing and updating the block chain comprises: collecting information received from user terminals in connection with telephone numbers; And generating the first data block using the collected information.

The step of storing and updating the block chain may further comprise updating the block chain by linking the first data block to the block chain.

And sharing the first data block with other nodes by transmitting the first data block through the network.

The data blocks including a second data block, wherein storing and updating the block chain may include receiving the second data block from any one of the plurality of nodes.

Wherein storing and updating the block chain comprises: verifying the second data block; And updating the block chain by linking the second data block to the block chain according to the verification result.

A method for managing and retrieving data by communicating with a plurality of nodes through a network according to an embodiment of the present invention includes: storing a block chain including first through Nth data blocks sequentially linked, Each of the N th data blocks including telephone numbers and information corresponding to the telephone numbers, wherein N is an integer greater than one; Receiving a request message including a telephone number; Searching for the telephone number in the N-Kth to Nth data blocks, where K is an integer greater than 1 and less than N; And providing feedback information on the request message according to information corresponding to the telephone number extracted from the N-Kth to Nth data blocks when the retrieval of the telephone number is successful.

The Nth data block may be the highest data block of the block chain and the first data block may be the lowest data block of the block chain.

The information corresponding to the telephone numbers included in each of the first to Nth data blocks may include reputations for the telephone numbers.

The information corresponding to the telephone numbers included in each of the first to Nth data blocks may include a comment on the telephone numbers.

Another aspect of the invention relates to a computer apparatus operating as any one of a plurality of nodes communicating with each other via a network. A computer apparatus according to an embodiment of the present invention comprises: a communicator for communicating with the network; And at least one processor coupled to the communicator, wherein the at least one processor links data blocks generated at the plurality of nodes to store and update a block chain in a database, At least one telephone number and information corresponding to the at least one telephone number; Receive a request message including a telephone number via the communicator; In response to the request message, retrieving the telephone number from at least a portion of the data blocks of the block chain; And provide feedback information for the request message via the communicator according to information corresponding to the retrieved telephone number extracted from the at least a portion of the data blocks when the retrieval of the telephone number is successful.

Embodiments of the present invention prevent a database that stores information about phone numbers from being falsified or altered, and ensure that the information provided to the user from the database is highly reliable.

Figure 1 is a block diagram illustrating a block chain system to which embodiments of the present invention may be applied.
2 is a conceptual diagram showing a block chain according to an embodiment of the present invention.
FIG. 3 is a conceptual diagram showing a part of the data blocks of the block chain of FIG. 2 in more detail.
4 is a flowchart illustrating a method for updating a block chain in any one of a plurality of nodes according to an embodiment of the present invention.
FIG. 5 is a view showing information collected in step S110 of FIG.
6 is a conceptual diagram illustrating an example of a data block generated in step S130 of FIG.
7 is a conceptual diagram showing another example of a data block generated in step S130 of FIG.
8 is a flowchart showing another embodiment of a method of updating a block chain at any one of a plurality of nodes.
9 is a flowchart illustrating a method of providing information on a telephone number in any one of a plurality of nodes according to an embodiment of the present invention.
FIG. 10 is a flowchart showing an embodiment of step S330 of FIG.
11 is a conceptual diagram showing data blocks included in a block chain.
12 is a block diagram illustrating an exemplary computing device suitable for any of the plurality of nodes of FIG.

Hereinafter, preferred embodiments of the present invention will be described in detail with reference to the accompanying drawings. In the following description, only parts necessary for understanding the operation according to the present invention will be described, and descriptions of other parts will be omitted in order to avoid obscuring the gist of the present invention. Further, the present invention is not limited to the embodiments described herein but may be embodied in other forms. The embodiments described herein are provided to enable those skilled in the art to easily understand the technical ideas of the present invention.

Throughout the specification, when a part is referred to as being "connected" to another part, it includes not only "directly connected" but also "indirectly connected" . Throughout the specification, when an element is referred to as " comprising ", it means that it can include other elements as well, without excluding other elements unless specifically stated otherwise.

1 is a block diagram illustrating a block chain system 100 to which embodiments of the present invention may be applied.

Referring to FIG. 1, a block-chain system 100 is a decentralized network system consisting of a plurality of nodes 110-170. The nodes 110-170 constituting the decentralized network are electronic devices having computational capabilities such as computers, mobile terminals, dedicated electronic devices, and the like.

The block chain system 100 may store information commonly known to all the nodes 110 to 170 in a connection bundle of data blocks called block chains. Each of the plurality of nodes 110 to 170 may communicate with each other to store the same block chain including the same data blocks. The plurality of nodes 110-170 may store a block chain, generate and propagate a new data block, verify the received new data block, and store the new data block in a block chain, (full node).

Each of the data blocks contained in the block chain contains information about the contact and the contact. For example, each data block may contain a variety of information about the contact, such as reputation for a particular contact, information indicating whether a particular contact is spam or not, and comments about the contact (e.g. Here, the contact is an address specified for communication between user devices. For example, when the user device functions as a telephone, the contact may be a telephone number assigned to the user device. As another example, when the user device communicates with the Internet and functions as an Internet phone, the contact may be an address that indicates the location of the user device on the Internet. A contact may be specified in various ways for communication between user devices. Hereinafter, for convenience of description, embodiments in which each of the data blocks included in the block chain include information on a telephone number and a telephone number will be described.

On the other hand, it has been described above that the nodes 110 to 170 are complete nodes. However, the embodiments of the present invention are not limited thereto. At least a portion of the plurality of nodes 110-170 may be a light node that provides information about the telephone number, such as an evaluation of the telephone number, a comment on the telephone number, etc., to the complete node. For example, the simple node may include a user interface for receiving information on a telephone number from a user, and a communication module for transmitting the input information to another node.

Each of the plurality of nodes 110 to 170 shares a new data block generated each time it generates a block of data with other nodes so that the plurality of nodes 110 to 170 can store the same data blocks You can store block chains. The data blocks receiving the new data block may verify the corresponding data block to agree whether to include the new data block in the block chain. According to the verification result, the plurality of nodes 110 to 170 can update the block chain. In this way, the plurality of nodes 110 to 170 can store the same block chain.

2 is a conceptual diagram showing a block chain 200 according to an embodiment of the present invention.

Referring to FIG. 2, the block chain 200 includes sequentially connected data blocks 210 to 230. The block chain 200 is created by each node included in the block chain system 100 by creating a new data block, sharing the generated new data block, and linking the shared data block to the block chain 200 . Although three data blocks 210-230 are illustrated in FIG. 2 by way of example, the number of data blocks that may be included in the block chain 100 is not limited thereto.

Each of the data blocks 210 to 230 includes a block header BH and a block body BB. The block header BH may include the hash value of the previous data block to indicate the connection relationship between the data blocks. For example, the block header BH of the (N-1) -th data block 220 includes a hash value contained in the block header BH of the previous data block 210. The hash value included in the block header BH may be used in the process of verifying that the block chain 200 is valid. The block body BB may include information on a telephone number and a telephone number.

FIG. 3 is a conceptual diagram showing a part of the data blocks of the block chain 200 of FIG. 2 in more detail.

2 and 3, the block header BH of each data block includes hash values 221 and 231 of the previous data block, hash values 222 and 232 of the current data block, and hash values 223 of the body , 233).

The data blocks 210 to 230 are connected based on the hash values. The hash value 231 of the previous data block included in the block header BH of the Nth data block 230 is the same as the hash value 231 of the current data included in the block header BH of the N- Is equal to the hash value 222 of the block. As such, each data block is cascaded by including the hash value of the previous data block in the block header BH. The nodes 110 to 170 participating in the block chain system 100 verify the validity of the data blocks 210 to 230 based on the hash value of the previous data block included in each of the data blocks 210 to 230 can do. Thus, it is considerably difficult to falsify or modulate the contents of the data block already generated and included in the block chain 200.

The hash values 223 and 233 of the body of the block header BH may indicate the header of the corresponding block body BB.

The block header BH may further include additional data fields 224, 234. For example, the additional data 224, 234 may include a timestamp indicating the time at which the data block was created.

The block body BB contains information on telephone numbers. The plurality of nodes 110 to 170 store the same data blocks 210 to 230. Even if the data blocks 210 to 230 stored in any one of the plurality of nodes 110 to 170 are falsified or modulated, the data blocks 210 to 230 stored in the corresponding node are different from each other Because it is different from the data blocks 210-230 of the nodes, falsification or modulation can be easily determined. Accordingly, the information on the telephone numbers in the block bodies BB of the data blocks 210 to 230 is hardly arbitrarily changed, and therefore, has a relatively high reliability.

If information about phone numbers is stored in a central server managed by a specific manager, information corresponding to phone numbers can be arbitrarily manipulated according to the needs of the manager. On the other hand, according to the embodiment of the present invention, by storing information on telephone numbers in the block chain 200, the information is shared by the plurality of nodes 110 to 170, The possibility of the information being changed arbitrarily may be reduced. Further, as described above, each of the plurality of nodes 110 to 170 can verify the validity of each data block based on the hash value of the previous data block included in each of the data blocks 210 to 230 , It is difficult for the contents of the data block already created by somebody, for example, the information about the telephone numbers in the block body BB, to be falsified or altered. Accordingly, the information on the telephone numbers stored in the block chain 200 can have high reliability.

4 is a flowchart illustrating a method of updating a block chain 200 in any one of a plurality of nodes 110 to 170 according to an embodiment of the present invention. FIG. 5 is a view showing information collected in step S110 of FIG. 6 is a conceptual diagram illustrating an example of a data block generated in step S130 of FIG. 7 is a conceptual diagram showing another example of a data block generated in step S130 of FIG.

Referring to FIG. 4, in step S110, information is collected in relation to telephone numbers. As an embodiment, each of the user terminals communicating with the node may receive ratings and comments on information entered in connection with the telephone number, for example a telephone number, from the user, and may transmit the received information to the node.

More specifically, the user can assess whether the telephone number is a spam phone number or not. For example, the user may enter " like " or " unlike " for an evaluation of the incoming telephone number, and the user terminal may deliver the input evaluation to the node. As another example, if the user refuses to receive a call from any phone number to the user terminal, the user terminal can notify the node of " unlike " In addition, the user terminal may receive information related to the telephone number caused by the user in various ways and may communicate the received information to the node. In another embodiment, when the node is a computer device used by a user, such as a mobile terminal or a personal computer, the node can directly receive information related to the telephone number caused by the user.

Referring to FIG. 5, regarding the first telephone number PHN1, " 111-1111-1111 ", the first to mth evaluations EVL11 to EVL1m are collected. As illustrated in Fig. 5, each of the first to mth evaluations EVL11 to EVL1m may be any of " dislike " and " good. &Quot; Also, the first to m-th comments CMT11 to CMT1m are collected in association with the first telephone number PHN1. For example, the first to mth comments CMT11 to CMT1m may be business information such as " Internet subscription solicitation, " " carrier, "

Referring again to FIG. 4, in step S120, it is determined whether or not the predetermined condition is satisfied. If so, step S130 is performed. For example, step S130 may be performed when a predetermined number or more of information is received in association with a telephone number. As another example, information may be collected in association with telephone numbers for a predetermined time, and step S130 may be performed when the predetermined time has elapsed.

In step S130, a data block is generated using the collected information. The data block includes a block header (BH; see FIG. 3) and a block body (BB, see FIG. 3). 3), the hash value of the current block 232 (see FIG. 3), the hash value of the body 233 (see FIG. 3), and the additional data 234, see Fig. 3). In addition, the node may create a block body (BB) that contains information about telephone numbers.

Referring to FIG. 6, information on the first to n-th telephone numbers PHN1 to PHNn is included in the block body BB.

As an example, the information about each phone number may include reputation information and comments. The block body BB includes first to nth flat plate information RPT1 to RPTn and first to nth comments CMT1 to CMTn corresponding to the first to nth telephone numbers PHN1 to PHNn can do.

The reputation information and the comment are determined according to the information collected in association with the corresponding phone number in step S110 of FIG. As an example, the node may determine the corresponding reputation information according to evaluations (e.g., EVL11 to EVL1m in FIG. 5) collected in connection with a telephone number (e.g., PHN1 in FIG. 5). As an example, the node may determine the corresponding comment according to the collected comments (e.g., CMT11 to CMT1m in FIG. 5) in association with the telephone number (e.g., PHN1 in FIG. 5).

The first to nth plate information RPT1 to RPTn may be first to nth count values CNT1 to CNTn as shown in FIG. The count value may be the number of times the telephone number is evaluated as " no " or the number of times the telephone number is evaluated as " good ". For example, the first count value CNT1 corresponding to the first telephone number PHN1 may indicate the number of evaluations of the first to mth evaluations EVL11 to EVL1m in FIG. 5 that are " dislike ".

The comment may be the text that appears in the largest number of comments collected with respect to the telephone number. For example, the first comment CMT1 corresponding to the first telephone number PHN1 may be the text that appears the greatest number of times among the first through mth comments CMT11 through CMT1m in Fig.

The node may process the collected information in association with the telephone numbers according to various methods to determine the first to nth reputation information RPT1 to RPTn and the first to nth comments CMT1 to CMTn. As shown in FIG. 7, the first to nth flat plate information PRT1 to PRTn may be probability values. The probability value may indicate the ratio between the number of times the phone number is rated "dislike" and the number of times it is rated "good". Figure 7 illustrates that the block body (BB) includes the percentage of evaluations that are " disliked " among the evaluations for each telephone number.

Referring again to FIG. 4, in step S140, the generated data block is transmitted to the network and the corresponding data block is shared with other nodes. In step S150, the generated data block is linked to the block chain 200 to update the block chain 200. [ The node may update the block chain 200 by linking the new data block to the last data block of the block chain 200 already stored. Likewise, other nodes may also update the block chain 200 by linking the new data block to the block chain 200.

FIG. 8 is a flowchart showing another embodiment of a method of updating the block chain 200 at any one of the plurality of nodes 110 to 170.

Referring to FIG. 8, in step S210, a new data block is received at the node via the network. The received new data block may be configured similarly to the data block described with reference to FIGS. The new data block may include a block header BH and a block body BB. The block body BB may include information on telephone numbers and telephone numbers.

In step S220, the received data block is verified. The node may verify the data block based on the block header (BH) of the received data block. The node may verify the data block based on the block header (BH) of the received data block. The node determines whether the hash value (e.g., 231 in FIG. 3) of the previous data block included in the block header BH of the received data block is included in the block header BH of the last data block of the block chain 200 It is possible to verify the received data block by determining whether it matches the hash value of the current block (e.g., 222 in FIG. 3). The node may verify the data block based on the block body (BB) of the received data block. The node can verify the data block by checking whether the information about phone numbers and phone numbers of the block body BB has a predetermined data format. However, the embodiments of the present invention are not limited thereto. The node may verify the data block in various manners.

In step S230, step S240 is performed depending on whether the verification is successful or not. In step S240, the block chain 200 is updated by linking the received data block to the block chain 200. [

9 is a flowchart illustrating a method of providing information on a telephone number from any one of a plurality of nodes 110 to 170 according to an embodiment of the present invention.

Referring to FIG. 9, in step S310, a block chain is stored. The block chain may be stored as described with reference to FIGS. 4 and 8. FIG.

In step S320, a request message for a specific telephone number is received. For example, the node may receive a request message from the user terminal via the network, querying for information on a particular telephone number.

In step S330, the corresponding telephone number is retrieved from at least a part of the data blocks of the block chain. Each of the block bodies of the data blocks contains information on telephone numbers and telephone numbers. The node can retrieve the requested phone number by scanning the data blocks of the search range of the stored data blocks.

In step S340, step S350 or step S360 is performed depending on whether the telephone number is searched.

In step S350, feedback on the request message is provided according to information stored in association with the retrieved telephone number.

As described with reference to FIG. 6, when the information on the telephone number is the reputation information and the reputation information is the count value, the count value stored in association with the retrieved telephone number can be provided to the user terminal. When a telephone number is retrieved from a plurality of data blocks, the corresponding count values are calculated and the computed value can be provided to the user terminal. For example, the sum of the count values may be computed and fed back. As another example, the higher the height of the data block in which the telephone number is searched (the later stored data block), the higher the weight value is given to the corresponding count value, and the sum of the count values to which the weight values are assigned can be calculated and fed back.

As described with reference to FIG. 7, when the reputation information is a probability value, a probability value stored in association with the retrieved telephone number can be provided to the user terminal. When a telephone number is retrieved from a plurality of data blocks, the probability values are calculated and the computed value can be provided to the user terminal. For example, the average value of the probability values may be computed and fed back. As another example, the higher the height of the data block (the later stored data block), the higher the weight value is given to the probability value, and the average value of the probability values to which the weight values are assigned can be calculated and fed back.

And a message indicating that the spam phone number is the number when the calculated value is equal to or greater than a predetermined threshold value may be fed back.

In step S360, feedback is provided indicating that the telephone number has not been retrieved.

FIG. 10 is a flowchart showing an embodiment of step S330 of FIG. 11 is a conceptual diagram showing data blocks included in the block chain 1100. FIG.

Referring to FIG. 10, some of the data blocks of the block chain are selected for retrieval of the telephone number. Referring to FIG. 11, first to Nth data blocks are included in a block chain.

The Nth data block is the highest data block among the data blocks included in the block chain, i.e., the latest block. The first data block is a lower data block, i.e., a genisis block, of the data blocks included in the block chain. In accordance with an embodiment of the present invention, a node may select data blocks that are sequentially linked to the highest data block (i.e., the Nth data block) and the highest data block, and may search for the phone number in the selected data blocks have.

As an example, the node may select a fixed number of data blocks. When the predetermined number is K + 1, the node can select the N-th data block, which is a data block, and the (N-K) th to N-1th data blocks, which are sequentially linked to the N-th data block, as shown in FIG.

Each of the first to Nth data blocks may include a time stamp in a block header. For example, the time stamp is included in the additional data 224, 234 described with reference to FIG. In this case, the node can select data blocks having time stamps belonging to within a predetermined time from the current one of the first to Nth data blocks. For example, when the N-Kth to Nth data blocks have time stamps belonging to a predetermined time from the current time, the N-Kth to Nth data blocks are selected as shown in FIG.

If information about a phone number is stored in a central server managed by a specific manager and information on the phone number is provided based on the information, the information provided is based on accumulated information from the past, Lt; / RTI > For example, a phone number that has been spam in the past may no longer be spam anymore. According to an embodiment of the present invention, the information on the telephone number is stored in the data blocks of the block chain, and the data blocks that are sequentially linked to the highest data block (i.e., the Nth data block) It may be a range for searching for a telephone number. Considering that the data blocks of the block chain are linked in the order in which the data blocks are generated and the later linked (high-height) data block has a higher reliability at the present point in time, Can have high reliability without any other processing considering the passage of time. For example, phone numbers that were spam in the past may not be spam at this time as the block chain is updated.

12 is a block diagram illustrating an exemplary computing device 1200 suitable for any of the plurality of nodes 110-170 of FIG.

12, a computing device 1200 includes a processor 1210, a memory 1220, a database 1230, and a communicator 1240.

Memory 1220 may store program code that, when executed by processor 1210, provides various functions. When computer device 1200 is employed in any one of a plurality of nodes 110-170, such program codes may be stored in computer readable medium, such as computer readable media, when executed by processor 1210, with reference to Figures 4, 8, 9, And may provide the described operations and / or functions. In addition, the program codes may provide one or more additional operations and / or functions when executed by the processor 1210. These program codes may be loaded from a computer readable recording medium separate from the memory 1220 using a drive mechanism. Such a computer-readable recording medium may include at least one of various storage media such as a floppy disk drive, a DVD / CD-ROM drive, a hard disk drive, a memory card, and the like. Alternatively, the program codes may be loaded from the external device into the memory 1220 via the communicator 1240.

The database 1230 may store the block chain described with reference to FIG. The processor 1210 may communicate with the database 1230 to store and update block chains, read information stored in the block chain, and process the read information. In FIG. 12, the database 1230 is shown as a component of the computer device 1200. However, the embodiments of the present invention are not limited thereto. For example, the database 1230 may be a component external to the computer device 1200, and the computer device 1200 may communicate with the database 1230 via the communicator 1240.

Communicator 1240 is configured to communicate with the network. Communicator 1240 may communicate with at least one of the plurality of nodes 110-170 shown in FIG. 1 via a network.

Although specific embodiments and applications are described herein, it is not intended to be exhaustive or to limit the invention to the precise form disclosed, and it is to be understood that the invention is not limited to those precise embodiments, Various modifications and variations are possible in light of the above teachings.

Accordingly, the spirit of the present invention should not be construed as being limited to the embodiments described, and all of the equivalents or equivalents of the claims, as well as the following claims, belong to the scope of the present invention .

110 to 170: a plurality of nodes
200: Block Chain
210 to 230: N-2 th to N th data blocks
BH: Block header
BB: Block body
RPT1 to RPTn: the first to n < th >
CMT1 to CMTn: First to nth comments

Claims (16)

A method for managing and retrieving data in any one of a plurality of nodes communicating with each other via a network, the method comprising:
Storing and updating a block chain by linking data blocks generated at the plurality of nodes, wherein each of the data blocks includes at least one contact and information corresponding to the at least one contact;
Receiving a request message including a contact;
In response to the request message, retrieving the contact from at least a portion of the data blocks of the block chain; And
And providing feedback information for the request message according to information corresponding to the retrieved contact extracted from the at least a portion of the data blocks when the retrieval of the contact is successful. The method according to claim 1,
The step of retrieving the contact includes:
And retrieving the contact from the highest data block of the data blocks of the block chain and a predetermined number of data blocks sequentially linked to the highest data block. The method according to claim 1,
Each of the data blocks including time stamps,
The step of searching for the contact includes:
And retrieving the contact from data blocks having time stamps that fall within a predetermined time of the data blocks of the block chain. The method according to claim 1,
Wherein the information corresponding to the at least one contact included in each of the data blocks comprises a reputation for the at least one contact. The method according to claim 1,
Wherein the information corresponding to the at least one contact included in each of the data blocks includes a comment for the at least one contact. The method according to claim 1,
The data blocks including a first data block,
Wherein storing and updating the block chain comprises:
Collecting information received from the user terminals in association with the contacts; And
And generating the first data block using the collected information. The method according to claim 6,
Wherein storing and updating the block chain comprises:
And linking the first data block to the block chain to update the block chain. The method according to claim 6,
And sharing the first data block with other nodes by transmitting the first data block through the network. The method according to claim 1,
The data blocks including a second data block,
Wherein storing and updating the block chain comprises:
And receiving the second data block from any one of the plurality of nodes. 10. The method of claim 9,
Wherein storing and updating the block chain comprises:
Verifying the second data block; And
And linking the second data block to the block chain according to the verification result to update the block chain. The method according to claim 1,
Wherein the contact is a telephone number assigned to a device functioning as a telephone. A method for managing and retrieving data by communicating with a plurality of nodes through a network, the method comprising:
Wherein each of the first through N th data blocks includes information corresponding to the contacts and the contacts, and wherein N is greater than 1 An integer;
Receiving a request message including a contact;
Searching for the contact in the NKth to Nth data blocks, where K is an integer greater than 1 and less than N; And
And providing feedback information for the request message according to information corresponding to the contact extracted from the Nth to Nth data blocks when the retrieval of the contact is successful. 13. The method of claim 12,
Wherein the Nth data block is the highest data block of the block chain and the first data block is the lowest data block of the block chain. 13. The method of claim 12,
Wherein the information corresponding to the contacts included in each of the first through Nth data blocks includes reputations for the contacts. 13. The method of claim 12,
Wherein the information corresponding to the contacts included in each of the first to Nth data blocks includes a comment on the contacts. A computer apparatus operating as any one of a plurality of nodes communicating with each other via a network,
A communicator for communicating with the network; And
At least one processor coupled to the communicator,
Wherein the at least one processor comprises:
Storing and updating a block chain in a database by linking data blocks generated in the plurality of nodes, wherein each of the data blocks includes at least one contact and information corresponding to the at least one contact;
Receive a request message including the contact via the communicator;
In response to the request message, retrieving the contact from at least a portion of the data blocks of the block chain;
And to provide, via the communicator, feedback information for the request message according to information corresponding to the retrieved contact extracted from the at least a portion of the data blocks when the retrieval of the contact is successful.

Images