CN111695132A

CN111695132A - Voting data storage method and system based on service data block chain

Info

Publication number: CN111695132A
Application number: CN202010270284.1A
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-09-22

Abstract

The application discloses a voting data storage method and a system based on a service data block chain, wherein the method is applied to the voting data storage system of the service data block chain and comprises the following steps: a voting block chain node receives a user voting operation data uplink request sent by a voting client; storing user voting data through a chain structure and a tree structure; the chain structure is used for storing user voting operation data, and the tree structure is used for storing state data after user voting operation; the tree structure comprises a state tree and a relation tree, wherein the state tree is used for storing the global state of the user voting operation data, the global state is the global state after the user voting operation, and the relation tree is used for storing the incidence relation between the global states after the user voting operation. According to the method and the device, chaining of the voting operation data of the user is achieved, and the mode of chain storage and tree-shaped storage is adopted, so that the query efficiency of the voting operation data is improved.

Description

Voting data storage method and system based on service data block chain

Technical Field

The invention relates to the technical field of internet big data, and discloses a voting data storage method and system 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.

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; for various service data (such as evidence storage data, traceability data, financial data, travel data, search data, self-media data, investigation data, advertisement data, recruitment data, community data, question and answer data, e-commerce data, knowledge payment data, shared bicycle data, life service data, house renting data, voting data, OTO data (also called online to offline data), social data, praise data, evaluation data, internet appointment data and other internet related data), not only the data per se but also the association relationship between the data on the block chain need to be expressed.

Therefore, how to store the voting data on the block chain becomes a problem to be solved urgently.

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 present application provides a voting data storage method and system based on a service data block chain, where the method stores user voting operation data on the service block chain to implement uplink of the user voting operation data.

The application discloses a voting data storage method based on a service data block chain in a first aspect, which is applied to a voting data storage system of the service data block chain, wherein the voting data storage system of the service data block chain comprises a plurality of voting block chain nodes; the method comprises the following steps:

a voting block chain node receives a user voting operation data uplink request sent by a voting client;

storing user voting data through a chain structure and a tree structure; the user voting data comprise user voting operation data and state data after the user voting operation, the chain structure is used for storing the user voting operation data, and the tree structure is used for storing the state data after the user voting operation; the tree structure comprises a state tree and a relation tree, the state tree is used for storing the global state of the user voting operation data, the global state is the global state after the user voting operation, and the relation tree is used for storing the incidence relation between the global states after the user voting operation; the chain type structure is a chain type storage structure of a block;

and sending the operation data uplink response of the user to the voting client.

In one possible embodiment, the user voting operation data comprises 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 voting operation data by the user, and a hash value of the user voting operation data; wherein the content of the first and second substances,

the voting data operation type comprises the operation of the user on the voting data and the operation on the integral, and the operated address comprises the operation address of the voting data and the address of the other voting data operation user.

In one possible implementation, the state tree stores user voting operation data global states including one or more of user information, voting data, and integration data.

In a possible implementation manner, the association relationship stored in the relationship tree includes an association relationship between user voting operation data and user information; one user voting operation data information corresponds to one or more user information; and/or

The incidence relation stored in the relation tree comprises the incidence relation between the user information and the integral information; wherein, one user information corresponds to one or more integral information; and/or

The incidence relation stored in the relation tree comprises the incidence relation between the user voting operation data information and the integral information; wherein, one user voting operation data information corresponds to one or more integral information.

In a possible implementation manner, the tree structure employs a database supporting attribute query or a KV database, where the database supporting attribute query includes a relational database and an in-memory database.

In one possible embodiment, any one of the user information, the user voting operation data, the point information, the user voting operation data-user information, the user information-point information, and the user voting operation data-point information is organized into an MPT tree or a mercker tree; wherein the content of the first and second substances,

the root of any Tree is stored in the block header, the MPT Tree is a Merck Tree variation of a Tree structure fused with a prefix Tree, and the Merck Tree is a Merkle Patricia Tree Tree.

In one example, leaf nodes in the relational tree store a tree root of a relational sub-tree, values of leaf nodes of the relational sub-tree store one or more of user information-score information, entity information-user information, and entity information-score information; or

And the value of the leaf node in the relational tree stores one or more of user information-integral information, entity information-user information and entity information-integral information in an array or hash table mode.

In one example, any one of the user information, the entity information, the point information, the user information-point information, the entity information-user information and the entity information-point information is stored in a database supporting attribute query in a form of a data table, so that a user can query according to an attribute field in the data table; one kind of information corresponds to one kind of data table, any line in any kind of data table corresponds to one piece of information, and one kind of information comprises a plurality of lines of information.

The second aspect of the application discloses a voting data storage system based on a service data block chain, wherein the voting data storage system of the service data block chain comprises a plurality of voting block chain nodes; the voting block chain node comprises a receiving unit, a processing unit and a sending unit; wherein the content of the first and second substances,

the receiving unit is used for receiving a user voting operation data uplink request sent by a voting client;

the processing unit stores user voting data through a chain structure and a tree structure; the user voting data comprise user voting operation data and state data after the user voting operation, the chain structure is used for storing the user voting operation data, and the tree structure is used for storing the state data after the user voting operation; the tree structure comprises a state tree and a relation tree, the state tree is used for storing the global state of the user voting operation data, the global state is the global state after the user voting operation, and the relation tree is used for storing the incidence relation between the global states after the user voting operation; the chain type structure is a chain type storage structure of a block;

and the sending unit is used for sending the uplink response of the operation data of the user to the voting client.

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.

The method comprises the steps that user voting operation data are stored in a service data block chain, and chaining of the user voting operation data is achieved; meanwhile, the service data block chain adopts a chain storage mode and a tree storage mode, so that the query of the user voting operation data is facilitated, and the query efficiency 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 voting data storage method based on a service data block chain according to the present application;

FIG. 2 is a block diagram illustrating a business data block chaining system according to the present application;

fig. 3 is a schematic diagram of a voting data storage structure based on a service data block chain according to the present application;

fig. 4 is a block header structure diagram in a service data block chain system 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 which is formed by organizing transaction receipts generated after the execution of the transactions in the block and corresponding to each transaction. 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.

For the MPT transaction tree, the MPT receipt tree and the MPT state tree which are organized, the MPT transaction tree, the MPT receipt tree and the MPT state tree are finally stored in a Key-Value type database (such as a levelDB) which adopts a multi-level data storage structure.

The database adopting a multi-level storage structure can be generally divided into n-level data storage; for example, each level of data storage may be set to L0, L1, L2, L3.. L (n-1) in sequence; for each level of data storage in the database, the smaller the level number is, the higher the level is generally; for example, L0 stores the latest data of several blocks, L1 stores the next latest data of several blocks, and so on.

Wherein, the read-write performance of the storage medium corresponding to each level of data storage may also have performance difference in general; the read/write performance of the storage medium corresponding to the data storage with a higher rank (i.e., with a smaller rank number) may be higher than the read/write performance of the storage medium corresponding to the data storage with a lower rank.

For example, in practical applications, a storage medium with higher read-write performance can be used for data storage with a higher level; and the storage medium with low unit cost and large capacity can be used for storing the data with low level.

In practical applications, as the block height increases, the data stored in the database may contain a lot of historical data; also, the longer the data in a block with a smaller block number is, the less important it is. Therefore, in order to reduce the overall storage cost, data of different block heights generally needs to be "treated differently";

for example, the data in the block with the smaller block number can be stored on a storage medium with lower cost; and storing the data in the block with larger block number on the storage medium with higher cost

The node on the MPT state tree is finally stored in a database in a Key-Value Key Value pair mode;

when a node on the MPT state tree is stored in a database, a key in a key value pair of the node on the MPT state tree is a hash value of data content contained in the node; value in the key Value pair of the node on the MPT state tree is the data content contained in the node.

That is, when a node in the MPT state tree is stored in the database, a hash Value of data content contained in the node may be calculated (that is, the whole node is subjected to hash calculation), the calculated hash Value is used as a Key, the data content contained in the node is used as a Value, and a Key-Value Key Value pair is generated; and then storing the generated Key-Value Key Value pair into a database.

Because the node in the MPT state tree takes the hash value of the data content contained in the node as Key and the data content contained in the node as value for storage; therefore, when a node on the MPT state tree needs to be queried, content addressing can be performed as a key based on the hash value of the data content contained in the node. By adopting the content addressing, for some nodes with repeated content, the node can be generally multiplexed to save the storage space of data storage.

The above is a description of the storage structure in the block chain, and the following is a description of the storage structure of the service data block chain in the present application.

The present specification discloses a voting data storage method based on a service data block chain, which is applied to a voting data storage system of the service data block chain, as shown in fig. 1, and the voting data storage system of the service data block chain comprises a plurality of voting block chain nodes; the method includes S101-S102.

The user information, the user voting data and the integral data in the specification all include associated attributes and non-associated attributes, and the associated attributes mean 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.

In addition, the service data block chain in this specification refers to a block chain including a chain storage structure and a tree storage structure and used for storing service data.

In addition, in this specification, the processes of packing the user voting operation data into blocks, completing consensus verification, and the like are not described, and a common data uplink method may be adopted.

S101, a voting block chain node receives a user voting operation data uplink request sent by a voting client.

In one example, the user voting operation data comprises 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 voting operation data by the user, and a hash value of the user voting operation data; the voting data operation type comprises operation of the user on the voting data and operation on the integral, and the operated address comprises an operation address of the voting data and addresses of other voting data operation users.

In this specification, the client may be a server or a user equipment.

S102, storing user voting data through a chain structure and a tree structure; the user voting data comprise user voting operation data and state data after the user voting operation, the chain structure is used for storing the user voting operation data, and the tree structure is used for storing the state data after the user voting operation; the tree structure comprises a state tree and a relation tree, the state tree is used for storing the global state of the user voting operation data, the global state is the global state after the user voting operation, and the relation tree is used for storing the incidence relation between the global states after the user voting operation; the chain type structure is a chain type storage structure of blocks.

S103, sending the uplink response of the operation data of the user to the voting client.

In one example, the state tree stores user voting operation data global states including one or more of user information, voting data, and integration data.

In one example, the association stored in the relationship tree includes an association of user voting operation data information and user information; wherein, one user voting operation data information corresponds to one or more user information.

The voting operation data comprises voting object issuing data, voting result evaluation data, voting result and vote data and the like. Such as: one or more users vote for the same voting object; the voting corresponding relation exists on a block chain, cannot be tampered, has high reliability and is convenient to query; and is referred to by other users.

In one example, the relationship tree stores associations comprising associations of user information and point information; wherein one user information corresponds to one or more point information.

The issuing of the voting object can be directed issuing, that is, when the user has the corresponding type of score and the score reaches a certain number, the voting can be performed. Thus, a user may have one or more points when faced with multiple voting objects, and the points may be of the same type or of different types. The corresponding relation exists on the block chain, cannot be tampered, and is convenient to query.

In one example, the association stored in the relationship tree includes an association of user voting operation data information and point information; wherein, one user voting operation data information corresponds to one or more integral information.

Here, the authority of the user voting operation is converted into a score, that is, when the user owns the score, and the number and the type are all matched, the user has the voting operation authority corresponding to the score. One user voting operation authority can be one integral or a plurality of integrals; the points corresponding to the voting operation authorities of different users can be of the same type or different types. For example: the voting authority for a voting object may correspond to one or more points. The way in which the user gets the points may be by attending to the voting object to publish the user's activities.

Furthermore, the obtaining of the integral may be obtained by mortgaging the native integral. The native score is the score required by using the blockchain system, and only the mortgage native score can enable a user to use the network and storage resources of the blockchain system; the native score can also avoid the problem that the user uses the network resources of the blockchain system without limit, which causes the waste of the blockchain system resources. At this time, the user transfers the score, which corresponds to the authority of the transfer voting related operation.

In one example, the tree structure employs a database supporting attribute query or a KV database, wherein the database supporting attribute query includes a relational database and an in-memory database.

The relational database can be a MySql database, and the memory database can be a MongoDB database; when the database supporting attribute query is adopted to store the user operation voting data, the user can conveniently query through the attribute fields, and the user query efficiency is improved.

When a KV database is adopted, for example, a Key-Value database is adopted, and the query needs to be carried out through an address; for example: inquiring user information according to a user address, inquiring user voting operation data according to the user voting operation address, and inquiring user integral data according to an integral address; the user information-integral information needs to be inquired according to the user address, the user voting operation data information-integral information needs to be inquired according to the user voting operation data address, and the user voting operation data information-user information needs to be inquired according to the user voting operation data address.

It should be noted that the address of the user information can be obtained by performing multiple hash operations according to the user public key; the user voting operation data address or the integral address can be obtained by taking the preset first few characters of the operation result after carrying out hash operation according to the user establishing integral operation or initiating the user voting operation.

In one example, any one of the user information, the user voting operation data information, the point information, the user voting operation data information-user information, the user information-point information, and the user voting operation data information-point information is organized into an MPT state tree; the root of any one of the MPT state trees is stored in the block header (as shown in fig. 4), and the MPT state Tree is a merkel Tree Merkle variant of a Tree structure fused with a prefix Tree Trie, and the merkel Tree Merkle is a Merkle Patricia Tree state Tree.

In fig. 4, Action represents user voting operation, Account represents user information, Asset represents points, Object represents user voting operation data, Object-Asset represents an association relationship between user voting operation data and user information, Account-Asset represents an association relationship between user information and point information, and Object-Asset represents an association relationship between user voting operation data and point information. Root denotes the tree Root. Briefly, a block includes a block header and a block body, and the root of the MPT state tree shown in fig. 4 is stored in the block header.

The present specification also discloses a voting data storage system based on the service data block chain, as shown in fig. 2. In practice, the number of blockchain nodes is not limited thereto. The voting data storage system of the service data block chain comprises a plurality of voting block chain nodes; the voting block chain node comprises a receiving unit, a processing unit and a sending unit.

The receiving unit receives a user voting operation data uplink request sent by a voting client.

The processing unit stores user voting data through a chain structure and a tree structure; the user voting data comprise user voting operation data and state data after the user voting operation, the chain structure is used for storing the user voting operation data, and the tree structure is used for storing the state data after the user voting operation; the tree structure comprises a state tree and a relation tree, the state tree is used for storing the global state of the user voting operation data, the global state is the global state after the user voting operation, and the relation tree is used for storing the incidence relation between the global states after the user voting operation; the chain type structure is a chain type storage structure of blocks.

In one example, the user voting operation data comprises 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 voting operation data by the user, and a hash value of the user voting operation data; wherein the content of the first and second substances,

In one example, the association stored by the relationship tree includes an association of user voting operation data and user information; one user voting operation data information corresponds to one or more user information; and/or

In one example, any one of the user information, the user voting operation data, the point information, the user voting operation data-user information, the user information-point information, and the user voting operation data-point information is organized into an MPT tree or a mercker tree; wherein the content of the first and second substances,

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. The voting data storage method based on the service data block chain is characterized in that the method is applied to a voting data storage system of the service data block chain, and the voting data storage system of the service data block chain comprises a plurality of voting block chain nodes; the method comprises the following steps:

2. A voting data storage method according to claim 1, wherein the user voting operation data includes one or more of a timestamp, an operating user address, an operated address, an operation type, a value of the operation, a credit address, a signature of the user on the user voting operation data, and a hash value of the user voting operation data; wherein the content of the first and second substances,

3. A voting data storage method according to claim 1, wherein the state tree stores user voting operation data global states comprising one or more of user information, voting data and integration data.

4. A voting data storage method according to claim 3, wherein the relationship tree stores associations that include associations of user voting operation data and user information; one user voting operation data information corresponds to one or more user information; and/or

5. The voting data storage method according to claim 1, wherein the tree structure employs a database supporting attribute query or a KV database, wherein the database supporting attribute query includes a relational database and an in-memory database.

6. A voting data storage method according to claim 4, wherein any one of the user information, the user voting operation data, the point information, the user voting operation data-user information, the user information-point information, and the user voting operation data-point information is organized into an MPT tree or a Mercker tree; wherein the content of the first and second substances,

the root of any one tree is stored in the block header, the MPT tree is a Merck tree variation of a tree structure fused with a prefix tree, and the Merck tree is a MerklePatricia Tree tree.

7. The voting data storage system based on the service data block chain is characterized by comprising a plurality of voting block chain nodes; the voting block chain node comprises a receiving unit, a processing unit and a sending unit; wherein the content of the first and second substances,

8. A voting data storage system according to claim 7, wherein the user voting operation data comprises one or more of a timestamp, an operating user address, an operated address, an operation type, a value of the operation, a credit address, a signature of the user on the user voting operation data, and a hash value of the user voting operation data; wherein the content of the first and second substances,

9. A voting data storage system according to claim 7, wherein the state tree stores user voting operation data global states comprising one or more of user information, voting data and integration data.

10. A voting data storage system according to claim 9, wherein the relationship tree stores associations that include associations of user voting operation data and user information; one user voting operation data information corresponds to one or more user information; and/or