CN111488349A

CN111488349A - Data query method and device based on service data block chain

Info

Publication number: CN111488349A
Application number: CN202010270330.8A
Authority: CN
Inventors: 吉建勋; 杨慧; 沈书航
Original assignee: Beijing Ruice Technology Co Ltd
Current assignee: Beijing Ruice Technology Co Ltd
Priority date: 2020-04-08
Filing date: 2020-04-08
Publication date: 2020-08-04

Abstract

The application discloses a data query method and a device based on a service data block chain, wherein the service data block chain comprises a plurality of block chain nodes, and the method comprises the following steps: the method comprises the steps that user equipment sends a first query request to a first block chain node, wherein the first query request comprises an object identifier; receiving a first query response sent by the first blockchain node, wherein the first query response comprises current object data corresponding to the object identifier; determining a first hash value of current object data; acquiring a second hash value of the object identification corresponding to the current object data from a second block link point; and if the first hash value is equal to the second hash value, determining that the current object data is legal object data. According to the method and the device, the object data inquired by the user can be more accurate, and the user experience is improved.

Description

Data query method and device based on service data block chain

Technical Field

The invention relates to the technical field of internet big data, and discloses a data query method and device based on a service data block chain.

Background

Currently, the blockchain technology is a distributed stored ledger that uses technologies such as encryption algorithm and consensus mechanism. With the use of blockchain technology, more and more internet data is stored on the blockchain.

The data block generally includes a block header and a block body, wherein the block header encapsulates information such as a current version number, a previous block address, a target hash value of the current block, a random number of solution in a current block consensus process, a timestamp, and the like. The block body then contains the transaction data volume of the current block and all verified transaction records generated during the block creation process, and these data contained in the block body constitute the block data. The block data includes all data in the block creation process, and such storage manner may traverse all relevant records stored in the block chain when querying the data, thereby resulting in inefficient query. In addition, when a user acquires data information at any node in the blockchain, if all nodes are not traversed, there may be a case where the acquired data may be tampered. If all nodes are traversed, a serious waste of computer resources is caused, and therefore, how to improve the efficiency and accuracy of data query in the blockchain becomes a focus.

In the existing block chain, only transaction data can be stored, wherein the transaction data comprises a transfer party address, a receiving party address and a transfer amount; the business data on the internet comprises evidence storage data, traceability data, financial data, tourism data, search data, self-media data, research data, advertisement data, e-commerce data, community data, knowledge question and answer data, knowledge payment data, shared bicycle data, recruitment data, living service data, house renting data, voting data, OTO data (also called online to offline data), social data, praise data, evaluation data, online booking data and the like.

The foregoing description is merely for convenience in understanding and is not to be construed as limiting the prior art to the present application.

Disclosure of Invention

Based on the above problems, the application discloses a data query method and device based on a service data block chain, which can enable object data queried by a user to be more accurate and improve user experience.

A first aspect of the present application discloses a data query method based on a service data block chain, where the service data block chain includes a plurality of block chain nodes, and the method includes:

the method comprises the steps that user equipment sends a first query request to a first block chain node, wherein the first query request comprises an object identifier;

receiving a first query response sent by the first blockchain node, wherein the first query response comprises current object data corresponding to the object identifier;

determining a first hash value of current object data;

acquiring a second hash value of the object identification corresponding to the current object data from a second block link point;

and if the first hash value is equal to the second hash value, determining that the current object data is legal object data.

In a possible implementation manner, the obtaining, by the user equipment, a second hash value of the current object data corresponding to the object identifier from a second block link point specifically includes:

the user equipment sends a second query request to a second blockchain node, wherein the second query request comprises an object identifier;

receiving a second query response sent by the second blockchain node, wherein the second query response comprises current object data corresponding to an object identifier;

determining a second hash value of the current object data.

In a possible implementation manner, the sending, by the user equipment, the first query request to the first blockchain node specifically includes:

the user equipment sends a first query request to a first blockchain node so as to be convenient for querying from a tree structure of the first blockchain node; wherein,

the tree structure comprises a state tree and a relation tree, the state tree comprises object data after user operation, the relation tree comprises the relation between the object data after the user operation, and the user operation is the operation of a user on service data.

In one possible implementation, the object data includes one or more of user data, point data, and entity data;

the relationship between the object data includes one or more of user data-point data, entity data-point data, and entity data-user data.

In one possible implementation, the value of the leaf node of the state tree stores the object data; the value of the leaf node of the relational tree stores the relation between the object data in an array or hash table mode; or the leaf nodes of the relational tree store the tree roots of the relational subtrees, and the values of the leaf nodes of the relational subtrees store the relations among the object data.

A second aspect of the present application discloses a data query apparatus based on a service data block chain, where the service data block chain includes a plurality of block chain nodes, and the apparatus is a user equipment; wherein,

determining a first hash value of current object data;

determining a second hash value of the current object data.

In one possible implementation, the user operation data is operation data of a user on the internet, and the user operation data includes one or more of evidence storage data, traceability data, financial data, travel data, search data, self-media data, research data, advertisement data, e-commerce data, community data, knowledge question and answer data, knowledge payment data, shared bicycle data, recruitment data, living service data, rentals data, voting data, online-to-offline data, social data, praise data, evaluation data and online booking data.

In one possible implementation, the user operation data includes one or more of a timestamp, an operation user address, an operated address, an operation type, a value of an operation, a credit address, a signature of the user on the user operation data, and a hash value of the user operation data; the operation type comprises an operation of a user on an entity and an operation on the credit, and the operated address comprises an operation address on the entity and addresses of other operation users.

In one possible implementation manner, the attributes of the user operation data include an associated attribute and a non-associated attribute; wherein the attribute value of the associated attribute is automatically increased or decreased according to the data state after the user operation.

A third aspect of the present application provides a computer-readable storage medium, which stores computer instructions, and when the computer instructions are executed by a processor, the computer instructions implement any one of the above-mentioned technical solutions.

A fourth aspect of the present application provides an electronic device, which includes a processor configured to execute any one of the above technical solutions.

According to the method and the device, the object data inquired by the user can be more accurate, and the user experience is improved.

Drawings

In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings needed to be used in the description of the embodiments are briefly introduced below, and it is obvious that the drawings in the following description are only some embodiments of the invention, and it is obvious for those skilled in the art to obtain other drawings based on these drawings without creative efforts.

Fig. 1 is a schematic flow chart illustrating a data query method for a service data block chain according to the present application;

fig. 2 is a schematic block head structure diagram of a service data block chain according to the present application;

fig. 3 is a schematic structural diagram of a data query device for a service data block chain according to the present disclosure.

Detailed Description

In order to make the objects, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are some, but not all, embodiments of the present invention. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.

The terms "first" and "second" in this application are used for convenience of understanding only, and are not to be construed as sequential or limiting in any way.

For the purpose of facilitating understanding of the embodiments of the present invention, the following description will be further explained with reference to specific embodiments, which are not to be construed as limiting the embodiments of the present invention.

Blockchains are generally divided into three types: public chain (Public Blockchain), private chain (PrivateBlockchain) and alliance chain (Consortium Blockchain). In addition, there are various types of combinations, such as private chain + federation chain, federation chain + public chain, and other different combinations. The most decentralized of these is the public chain. The public chain is represented by bitcoin and ether house, and the participators joining the public chain can read the data record on the chain, participate in transaction, compete for accounting right of new blocks, and the like.

Furthermore, each participant (i.e., node) is free to join and leave the network and perform related operations. Private chains are the opposite, with the network's write rights controlled by an organization or organization and the data read rights specified by the organization. Briefly, a private chain can be a weakly centralized system with strictly limited and few participating nodes. This type of blockchain is more suitable for use within a particular establishment.

Based on the basic characteristics of a blockchain, a blockchain is usually composed of several blocks. The time stamps corresponding to the creation time of the block are recorded in the blocks respectively, and all the blocks form a time-ordered data chain according to the time stamps recorded in the blocks strictly.

The real data generated by the physical world can be constructed into a standard transaction (transaction) format supported by a block chain, then is issued to the block chain, is identified by node equipment in the block chain, and is packed into a block by the node equipment serving as an accounting node in the block chain after the identification is achieved, and is subjected to persistent evidence storage in the block chain.

In the field of blockchain, an important concept is Account (Account); taking an ether house as an example, the ether house generally divides an account into an external account and a contract account; the external account is an account directly controlled by the user; and the contract account is created by the user through an external account, the account containing the contract code (i.e. the smart contract).

Of course, for some blockchain items derived based on the ethernet framework, the account types supported by the blockchain may be further expanded, and are not particularly limited in this specification.

For accounts in a blockchain, the account status of the account is usually maintained through a structure. When a transaction in a block is executed, the status of the account associated with the transaction in the block chain is also typically changed.

Taking etherhouses as an example, the structure of an account usually includes fields such as Balance, Nonce, Code, and storage. Wherein:

a Balance field for maintaining the current account Balance of the account;

a Nonce field for the number of transactions for the account; the counter is used for guaranteeing that each transaction can be processed only once, and replay attack is effectively avoided.

A code field for maintaining a contract code for the account; in practical applications, only the hash value of the contract code is typically maintained in the code field; thus, the code field is also commonly referred to as a codehash field. For external accounts, this field is null.

storage field to maintain the storage of the account (default to empty). In practical application, the storage field only maintains the root node of an MPT (Merkle Patricia Trie) tree constructed based on the storage content of the account; thus, the storage field is also commonly referred to as the storageRoot field.

Wherein, for the external account, the code field and storage field shown above are null values.

Most blockchain items typically use Merkle trees; alternatively, the data is stored and maintained based on the data structure of the Merkle tree. Taking etherhouses as an example, the etherhouses use MPT tree (a Merkle tree variation) as a data organization form for organizing and managing important data such as account status, transaction information, and the like.

The Etherhouse designs three MPT trees, namely an MPT state tree, an MPT transaction tree and an MPT receipt tree, aiming at data needing to be stored and maintained in a block chain.

The MPT state tree is an MPT tree organized by account state data (state) of all accounts in the block chain; the MPT transaction tree is transaction data (transaction) in a block and is organized into the MPT tree; the MPT receipt tree is an MPT tree organized by transaction receipts (receipts) corresponding to each transaction generated after the transaction in the block is completed. The hash values of the root nodes of the MPT state tree, MPT transaction tree, and MPT receipt tree shown above are all added to the block header.

Wherein the MPT transaction tree and the MPT receipt tree correspond to tiles, each tile having its own MPT transaction tree and MPT receipt tree. The MPT state tree is a global MPT tree, which does not correspond to a specific tile, but covers account state data of all accounts in the tile chain.

The present specification discloses a data operation method of a service data blockchain, as shown in fig. 1, the service data blockchain system includes a plurality of blockchain nodes; the method includes S101-S105.

The entity information in the present specification refers to abstraction of objective objects and also refers to specific objective objects, the entity information includes associated attributes and non-associated attributes, and the associated attributes refer to that attribute values can be increased or decreased; the user information refers to description information of a user, and the user information comprises a user address; the point information is point information issued by the user, and is point information other than the original points on the block chain, and the point information includes the name and the total amount of the point.

S101, user equipment sends a first query request to a first block chain node, wherein the first query request comprises an object identifier.

S102, receiving a first query response sent by the first blockchain node, wherein the first query response comprises current object data corresponding to the object identifier.

S103, determining a first hash value of the current object data.

And S104, acquiring a second hash value of the current object data corresponding to the object identifier from the second block link point.

And S105, if the first hash value is equal to the second hash value, determining that the current object data is legal object data.

In an example, the obtaining, by the user equipment, a second hash value of the current object data corresponding to the object identifier from a second block link point specifically includes:

determining a second hash value of the current object data.

In one example, the sending, by the user equipment, the first query request to the first blockchain node specifically includes: the user equipment sends a first query request to a first blockchain node so as to be convenient for querying from a tree structure of the first blockchain node; wherein,

In one example, the object data includes one or more of user data, point data, entity data; the relationship between the object data includes one or more of user data-point data, entity data-point data, and entity data-user data.

For example, the entity is a commodity of an internet e-commerce platform, and the user can initiate an operation of purchasing the commodity, namely, a point transfer operation (point is transferred from the address of the operating user to the address of the operated user) for a point corresponding to the commodity entity; the user can also initiate a comment or a praise operation for the commodity, namely a user operation for the commodity entity.

Associated attributes in an attribute type, for example: the number of praise is automatically increased for the same commodity or the self-media (such as pictures, texts and small videos circled by WeChat friends) after praise is performed by different users. Non-associated attributes, such as: and after different users comment the comment content, the user searches the commodity on the block chain and can see the comments of the different users.

The points are user issued points, for example: after a user can pass the notarization and securitize the house, a point is issued on the block chain, and the point uniquely represents the house property on the block chain; alternatively, the house may be securitized, a predetermined number of points issued, possession of the point will have ownership of the house, and will have equal ownership of the house lease or change. In addition, the block chain is provided with native scores which can be used for restricting the operation of the user on the block chain, so that the user is prevented from using the resources of the block chain system without limit; for example: after the users on the blockchain are registered, the users are operated on the blockchain, and the native credits are required to be collated so as to uplink the user operation data.

In one example, the tile link nodes organize relationships between user-manipulated global states into leaf nodes of a relationship tree, the relationships between the global states including one or more of a user state-integral state, an entity state-integral state, and an entity state-user state.

The relationship between entity state and user state, for example: on an electronic commerce platform (such as Taobao, Tianmao and Jingdong shopping mall) of the Internet, a commodity is purchased by a plurality of different users; on a self-media platform (such as WeChat and microblog) on the Internet, one piece of self-media data is praised or commented by a plurality of users; the one-to-many relationship between such entities and users can be expressed by using the association relationship between the entity information and the user information. The method and the device facilitate chaining of the service data and query of the service data by the user.

The relationship between the user state and the integration state. A user may have multiple points, for example: a user has both native credits on the blockchain and other types of credits. The incidence relation can describe the one-to-many relation between the user and the score, and meanwhile, the user can conveniently inquire. It should be noted that a user in the blockchain system at least has the native scores of the blockchain system; it is possible to have credits issued by other users or by themselves.

The relation between the entity state and the integral state is equivalent to the securitization of the entity on the block chain. For example: the ownership of a commodity corresponds to an integral, and the transfer of the integral corresponds to the transfer of the ownership of the commodity; the ownership of a set of houses corresponds to a predetermined number of points, the number of owned points corresponds to the ownership proportion of the houses, and namely, the houses are owned to sell or rent the prices in the same proportion.

In one example, the value of the state tree leaf node stores the object data; the value of the leaf node of the relational tree stores the relation between the object data in an array or hash table mode; or the leaf nodes of the relational tree store the tree roots of the relational subtrees, and the values of the leaf nodes of the relational subtrees store the relations among the object data.

In one example, the state tree or the relationship tree employs a merkel tree or an MPT tree, whose root is stored in a chunk header; wherein the MPT Tree is a Mercker Tree variation of a Tree structure fused with a prefix Tree, and the Mercker Tree is a Merkle Patricia Tree Tree.

In one example, the user operation data is operation data of a user on the internet, and the user operation data comprises one or more of evidence storage data, traceability data, financial data, travel data, search data, self-media data, research data, advertisement data, e-commerce data, community data, knowledge question and answer data, knowledge payment data, shared bicycle data, recruitment data, life service data, house renting data, voting data, online-offline data, social data, praise data, evaluation data and net appointment data.

In one example, the user operation data includes one or more of a timestamp, an operation user address, an operated address, an operation type, a value of an operation, a credit address, a signature of the user on the user operation data, and a hash value of the user operation data; the operation type comprises an operation of a user on an entity and an operation on the credit, and the operated address comprises an operation address on the entity and addresses of other operation users.

As described above, any one of the user state (e.g., Account field), the credit state (e.g., Asset field), the entity state (e.g., Object field), the entity state-user state (e.g., Object-Account field), the user state-credit state (e.g., Account-Asset field), and the entity state-credit state (e.g., Object-Asset field) may be implemented by using an MPT state tree or a Mercker tree, and the tree roots of various MPT state trees are stored in the header of the block. As shown in FIG. 2, the user Action of the tile store (e.g., the Action field), and the root of the MPT status tree of the Receipt status of the on-chain database store (e.g., the Recept field) are also stored in the tile header.

In the above, the states are stored in an MPT state tree manner, and a user can query through address information; directly adopting a user address, a point address and an entity address to inquire the state aiming at the user state, the point state and the entity state; and respectively adopting the entity address, the user address and the entity address to carry out state query aiming at the entity state-user state, the user state-integral state and the entity state-integral state.

In addition, the user address can be obtained by carrying out multiple times of hash operation according to the user public key; the point address or the entity address may be obtained by a user operation of creating a point or an entity, for example: and carrying out multiple times of hash operation on the user operation, and selecting characters with preset digits from the obtained hash value as integral addresses or entity addresses.

According to the method and the device, the object data inquired by the user can be more accurate, and the user experience is improved; in addition, the service data is stored by adopting a chain structure and a tree structure, and various attributes of the service data can be stored on the block chain; and the database supporting attribute query is adopted, so that the user can conveniently access the database, and the query efficiency is improved.

In addition, the present specification discloses a data manipulation apparatus of a service data blockchain, and a service data blockchain system includes a plurality of blockchain nodes.

determining a first hash value of current object data;

determining a second hash value of the current object data.

In one example, the attributes of the user operation data include an associated attribute and a non-associated attribute; wherein the attribute value of the associated attribute is automatically increased or decreased according to the data state after the user operation.

The same or similar parts in the above device embodiments and the above method embodiments can be referred to each other, and are not described herein again.

The present specification also discloses a computer readable storage medium storing computer instructions which, when executed by a processor, implement any one of the above-mentioned technical solutions.

The present specification also discloses an electronic device comprising a processor configured to perform any of the above-described technical solutions.

Meanwhile, the application also provides an embodiment of the entity device.

Fig. 3 shows a schematic diagram of a computer device, which may include: a processor 310, a memory 320, an input/output interface 330, a communication interface 340, and a bus 350. Wherein the processor 340, the memory 320, the input/output interface 330, and the communication interface 340 are communicatively coupled to each other within the device via a bus 350.

The processor 310 may be implemented by a general-purpose CPU (Central Processing Unit), a microprocessor, an Application Specific Integrated Circuit (ASIC), or one or more Integrated circuits, and is configured to execute related programs to implement the technical solutions provided in the embodiments of the present specification.

The Memory 320 may be implemented in the form of a ROM (Read Only Memory), a RAM (Random access Memory), a static storage device, a dynamic storage device, or the like. The memory 320 may store an operating system and other application programs, and when the technical solution provided by the embodiments of the present specification is implemented by software or firmware, the relevant program codes are stored in the memory 320 and called to be executed by the processor 310.

The input/output interface 330 is used for connecting an input/output module to realize information input and output. The i/o module may be configured as a component in a device (not shown) or may be external to the device to provide a corresponding function. The input devices may include a keyboard, a mouse, a touch screen, a microphone, various sensors, etc., and the output devices may include a display, a speaker, a vibrator, an indicator light, etc.

The communication interface 340 is used for connecting a communication module (not shown in the figure) to implement communication interaction between the present device and other devices. The communication module can realize communication in a wired mode (such as USB, network cable and the like) and also can realize communication in a wireless mode (such as mobile network, WIFI, Bluetooth and the like).

Bus 350 includes a path that transfers information between the various components of the device, such as processor 310, memory 320, input/output interface 330, and communication interface 340.

It should be noted that although the above-mentioned device only shows the processor 310, the memory 320, the input/output interface 330, the communication interface 340 and the bus 350, in a specific implementation, the device may also include other components necessary for normal operation. In addition, those skilled in the art will appreciate that the above-described apparatus may also include only those components necessary to implement the embodiments of the present description, and not necessarily all of the components shown in the figures.

Those of skill would further appreciate that the various illustrative components and algorithm steps described in connection with the embodiments disclosed herein may be implemented as electronic hardware, computer software, or combinations of both, and that the various illustrative components and steps have been described above generally in terms of their functionality in order to clearly illustrate this interchangeability of hardware and software. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the implementation. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present invention.

The steps of a method or algorithm described in connection with the embodiments disclosed herein may be embodied in hardware, a software module executed by a processor, or a combination of the two. A software module may reside in Random Access Memory (RAM), memory, Read Only Memory (ROM), electrically programmable ROM, electrically erasable programmable ROM, registers, hard disk, a removable disk, a CD-ROM, or any other form of storage medium known in the art.

The above-mentioned embodiments are intended to illustrate the objects, technical solutions and advantages of the present invention in further detail, and it should be understood that the above-mentioned embodiments are only illustrative of the present invention and are not intended to limit the scope of the present invention, and any modifications, equivalent substitutions, improvements and the like made within the scope of the present invention should be included in the scope of the present invention.

Claims

1. A data query method based on a service data block chain, wherein the service data block chain comprises a plurality of block chain nodes, the method comprising:

determining a first hash value of current object data;

2. The data query method according to claim 1, wherein the obtaining, by the user equipment, the second hash value of the current object data corresponding to the object identifier from the second block link point specifically includes:

determining a second hash value of the current object data.

3. The data query method according to claim 1, wherein the user equipment sends a first query request to the first blockchain node, specifically:

4. The data query method of claim 3, wherein the object data comprises one or more of user data, point data, and entity data;

5. The data query method of claim 3, wherein the value of the leaf node of the state tree stores the object data;

the value of the leaf node of the relational tree stores the relation between the object data in an array or hash table mode; or the leaf nodes of the relational tree store the tree roots of the relational subtrees, and the values of the leaf nodes of the relational subtrees store the relations among the object data.

6. A data query device based on a service data block chain, wherein the service data block chain comprises a plurality of block chain nodes, and the device is a user equipment; wherein,

determining a first hash value of current object data;

7. The data query device according to claim 6, wherein the obtaining, by the ue, the second hash value of the current object data corresponding to the object identifier from the second block link point specifically includes:

determining a second hash value of the current object data.

8. The data query device according to claim 6, wherein the user equipment sends a first query request to the first blockchain node, specifically:

9. The data query device of claim 8, wherein the object data comprises one or more of user data, point data, and entity data;

10. The apparatus according to claim 8, wherein the value of the leaf node of the state tree stores the object data;