CN109067719A - The method of data-handling efficiency is improved in the application of block chain - Google Patents
The method of data-handling efficiency is improved in the application of block chain Download PDFInfo
- Publication number
- CN109067719A CN109067719A CN201810813881.7A CN201810813881A CN109067719A CN 109067719 A CN109067719 A CN 109067719A CN 201810813881 A CN201810813881 A CN 201810813881A CN 109067719 A CN109067719 A CN 109067719A
- Authority
- CN
- China
- Prior art keywords
- data
- block chain
- application
- hash
- handling efficiency
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L63/00—Network architectures or network communication protocols for network security
- H04L63/12—Applying verification of the received information
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L63/00—Network architectures or network communication protocols for network security
- H04L63/04—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks
- H04L63/0428—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks wherein the data content is protected, e.g. by encrypting or encapsulating the payload
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/06—Protocols specially adapted for file transfer, e.g. file transfer protocol [FTP]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/1097—Protocols in which an application is distributed across nodes in the network for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]
Abstract
The invention discloses the methods that data-handling efficiency is improved in a kind of application of block chain.This method be it is a kind of in block chain or other similar data processing system on application improve processing speed, the method for efficiency and capacity.By reduce upload to block chain or or other similar data processing system in data volume increase data processing speed, efficiency, capacity and the recorded cost of application, part workload is transferred to the server local processing of non-distributed, and can be at any time by specific requirements come the size of allocation data amount.
Description
Technical field
The present invention relates to the methods that data-handling efficiency is improved in a kind of application of block chain.
Background technique
Block chain technology Information Security, decentralization calculating, public trust, can not be at the opposite traditional data such as tamper
Reason method has absolute predominance, but the bottleneck of block chain technology is calculating speed and inefficiency brought by decentralization
Problem.In practical applications, the application of business data especially big data, high flow capacity are typical characteristics at high speed, all at present
Block chain technology be all unable to satisfy the demand of business application, limit its all application other than electronic coin.Block chain mentions
Rising processing speed is the past few years whole world in the direction of effort, however difficulty is very big, makes slow progress, and also leads to block chain technology
Still it is not in progress after bit coin is born 9 years, without the business application of any landing.This method is a kind of based on existing
Block chain technology, on the basis of not touching and changing existing block chain technology, cooperate local data service device, Ke Yi
The method that application increases substantially data processing speed, capacity and efficiency, while inheriting block chain technology and pacifying in data
Quan Xing, decentralization calculating, public trust, can not tamper whole advantages.
The bottleneck of block chain technology is calculating speed brought by this core logic of decentralization and inefficiency
Problem.The treatment effeciency theory of bit coin is seven per second, three to four really per second, and the processing speed is useful by institute
Family is shared, and current each data processing usually requires to wait ten to two ten minutes, does not meet the demand that business uses completely.And
Whole speed-raising is carried out to block chain public affairs chain on the basis of complete decentralization, target can be reached currently without any technology.
Common method is to realize that part is raised speed by reducing decentralization degree at present, such as typical EOS public affairs chain, by will be complete
Node is more than 12000 from bit coin and is reduced to 21, so that processing speed is promoted, but the centralization of full node violates
A possibility that core logic of block chain technology allows the public trust of entire public chain to be greatly lowered, and data are tampered is increased.Quan Jie
Block catenary system and traditional distributed the database difference that point is greatly lowered less, can not provide block chain technology institute band
The data edge come.The development of block chain technology is very slow, therefore needs one kind independently of block chain skill in business application
Art itself processing speed developing ability, the method that data processing speed, capacity and efficiency can be increased substantially in application,
It must be able to the system for inheriting block chain technology whole advantage simultaneously.
Summary of the invention
In order to solve the above technical problems, the present invention devises the side for improving data-handling efficiency in a kind of application of block chain
Method.This method is that one kind improves processing speed, efficiency in block chain or other similar data processing system on application
With the method for capacity.Irreversible encryption method is used simultaneously and ensures that body data will not be disclosed to public chain, on public chain
Data will not be cracked or reverse-engineering is decoded as initial data.This method can handle the stored database finished or
Data flow of the person just in storing process.
The present invention adopts the following technical scheme:
The method of data-handling efficiency is improved in a kind of application of block chain comprising following steps:
One, data storage procedure:
It is arranged 1. first storing initial data according to certain sequence, forms f (x1), f(x2),f(x3)…f(xn)；
2. then handling initial data, processing mode hash () unified reference；
3. first to the first data f (x1) carry out hash () acquisition S (x1)=hash(f(x1))；
4. then handling follow-up data, S (xn)=hash(S(x (n-1))+f(xn))；S(x(n-1))+f(xn) refer to
Be two datas merge；
5. obtaining data column S (x at this time1), S(x2), S(x3)…S(xn)；
6. being directed to S (xn) one data selective rules of setting, it selects fixed intervals t to select mode as data, then will be singled out
Data S (x1), S(x(1+t)), S(x(1+2t)) ..., the data that will be singled out upload in block chain；
7. setting data B (1)=S (x in this process1), B(2)= S(x(1+t)), B(3)= S(x(1+2t))…B(n)= S
(x(1+(n-1) t))；
Two, verification of data process:
1. needing to check data f (xn) authenticity when, first find the corresponding S (x of this datan), it then positions from this number
The data uploaded according to each one nearest of front and back are B (x '), B (x '+1)；
2. obtaining its corresponding B (x '), the numerical value of B (x '+1)；
3. comparing confirmation S (x ')=B (x '), whether S (x '+t)=B (x '+1) meets；
4. stopping at f (x '+t), the f (x at f (x ') ... under the premise of meeting since f (x ')n) ... in the section of f (x '+t)
Re-starting calculating S (x ') ..., S (x '+t) obtains data and is denoted as S ' (x ') ... S ' (x '+t)；
5. whether unanimously S ' (x '+t) and B (x '+1) is compareed, if unanimously, the data in f (x ') to f (x '+t) are not usurped
Change, it is authentic and valid；
6. compareing, whether S ' (x '+t) and B (x '+1) be consistent, if it is inconsistent, f (x ') arrives the data in f (x '+t) at least
One is tampered, then enters next step checking step；
7. compare S ' (x '+1) whether with S (x '+1) unanimously, compareed if consistent S ' (x '+2) whether with S (x '+2) unanimously,
The rest may be inferred until finding S ' (x '+y) not equal to S (x '+y), (wherein y≤t), data f (x '+y) is data tampering at this time
Point, it is all there is no public trust to the data between f (x '+t) positioned at f (x '+y)；
8. if f (xn) be not located at f (x '+y) between f (x '+t), then f (xn) it is trust data, it is not tampered with；
9. if f (xn) be located at f (x '+y) between f (x '+t), then f (xn) be can not letter data, not can be used；
10. if S (x '+t)=B (x '+1) is simultaneously unsatisfactory for compare confirmation S (x ')=B (x '), then need to expand data comparison model
It encloses, and repeats the above steps, until navigating to the first data point that mistake occurs and its data area section influenced；
Three, increase data processing speed and capacity on chain:
By expanding the average value of the t uploaded between the data in block chain, reduction uploads to the total amount of data in block chain,
In the case where not changing block chain attribute itself, so that it may simply increase processing speed and capacity in application.
Preferably, handling in the step 2 of the data storage procedure initial data, processing mode be can be
Hash algorithm, any other function or other Encryption Algorithm.
Preferably, in the step 4 of the data storage procedure, the concrete mode that two datas merge can be addition,
Superposition, subtraction or arbitrary data merge mode, by determining in specifically used.
Preferably, the data that will be singled out, which upload in block chain, to lead in the step 6 of the data storage procedure
Cross API or other modes.
The beneficial effects of the present invention are:
1, by reduce upload to block chain or or other similar data processing system in data volume increase application
Data processing speed, efficiency, capacity and recorded cost, by part workload be transferred to non-distributed server local handle,
And it can be at any time by specific requirements come the size of allocation data amount；
2, this method inherit block chain technology Information Security, public trust, can not tamper advantage；
3, this method only needs to carry out calculation and check to the data in f (x '+t) to f (x ') in verification of data, and operand is small；
4, this method can find the data source header being tampered.
Figure of description
Fig. 1 is a kind of flow chart of the invention；
Specific embodiment
Below by specific embodiment, and in conjunction with attached drawing, technical scheme of the present invention is further described:
Embodiment: as shown in Fig. 1, the method for data-handling efficiency is improved in a kind of application of block chain comprising following steps:
One, data storage procedure:
1, initial data is stored first and is arranged according to certain sequence, form f (x1), f(x2),f(x3)…f(xn)；
2, then initial data is handled, processing mode hash () unified reference；
3, first to the first data f (x1) carry out hash () acquisition S (x1)=hash(f(x1))；
4, then follow-up data is handled, S (xn)=hash(S(x (n-1))+f(xn))；S(x(n-1))+f(xn) refer to
Be two datas merge；
5, data column S (x is obtained at this time1), S(x2), S(x3)…S(xn)；
6, it is directed to S (xn) one data selective rules of setting, it selects fixed intervals t to select mode as data, then will select
Data S (x out1), S(x(1+t)), S(x(1+2t)) ..., the data that will be singled out upload in block chain；
7, data B (1)=S (x is set in this process1), B(2)= S(x(1+t)), B(3)= S(x(1+2t))…B(n)=
S(x(1+(n-1) t))；
Two, verification of data process:
1, need to check data f (xn) authenticity when, first find the corresponding S (x of this datan), it then positions from this number
The data uploaded according to each one nearest of front and back are B (x '), B (x '+1)；
2, its corresponding B (x '), the numerical value of B (x '+1) are obtained；
3, confirmation S (x ')=B (x ') is compared, whether S (x '+t)=B (x '+1) meets；
4, under the premise of meeting since f (x '), stop at f (x '+t), the f (x at f (x ') ...n) ... in the section of f (x '+t)
Re-starting calculating S (x ') ..., S (x '+t) obtains data and is denoted as S ' (x ') ... S ' (x '+t)；
5, whether control S ' (x '+t) and B (x '+1) consistent, if unanimously, f (x ') to the data in f (x '+t) not by
It distorts, it is authentic and valid；
6, whether control S ' (x '+t) and B (x '+1) are consistent, if it is inconsistent, f (x ') arrives the data in f (x '+t) at least
There is one to be tampered, then enters next step checking step；
7, control S ' (x '+1) whether with S (x '+1) unanimously, compareed if consistent S ' (x '+2) whether with S (x '+2) one
It causes, the rest may be inferred until finding S ' (x '+y) not equal to S (x '+y), (wherein y≤t), data f (x '+y) is data at this time
It distorts a little, it is all there is no public trust to the data between f (x '+t) positioned at f (x '+y)；
If 8, f (xn) be not located at f (x '+y) between f (x '+t), then f (xn) it is trust data, it is not tampered with；
If 9, f (xn) be located at f (x '+y) between f (x '+t), then f (xn) be can not letter data, not can be used；
If 10, comparing confirmation S (x ')=B (x '), S (x '+t)=B (x '+1) is simultaneously unsatisfactory for, then needs to expand data comparison model
It encloses, and repeats the above steps, until navigating to the first data point that mistake occurs and its data area section influenced；
Three, increase data processing speed and capacity on chain:
By expanding the average value of the t uploaded between the data in block chain, reduction uploads to the total amount of data in block chain,
In the case where not changing block chain attribute itself, so that it may simply increase processing speed and capacity in application.For example,
By the way of fixed intervals upload, original t=2 are then uploaded every two data；If necessary to which processing speed is double, then
T=4 are then uploaded every four data；The data volume of upload halves, in the case that in region, the primary processing capacity of chain is constant,
Application, processing speed are doubled.
In the step 2 of data storage procedure, initial data is handled, processing mode is hash algorithm.
In the step 4 of data storage procedure, the concrete mode that two datas merge is that addition data merges mode.
In the step 6 of data storage procedure, uploaded in block chain by the data that API will be singled out.
Above-mentioned embodiment is only a preferred solution of the present invention, not the present invention is made in any form
Limitation, there are also other variations and modifications on the premise of not exceeding the technical scheme recorded in the claims.
Claims (4)
1. improving the method for data-handling efficiency in a kind of block chain application, characterized in that it includes the following steps: one, data
Storing process:
Initial data is stored first and is arranged according to certain sequence, f (x is formed1), f(x2),f(x3)…f(xn)；
Then initial data is handled, processing mode hash () unified reference；
First to the first data f (x1) carry out hash () acquisition S (x1)=hash(f(x1))；
Then follow-up data is handled, S (xn)=hash(S(x (n-1))+f(xn))；S(x(n-1))+f(xn) refer to be
Two datas merge；
Data column S (x is obtained at this time1), S(x2), S(x3)…S(xn)；
For S (xn) one data selective rules of setting, it selects fixed intervals t to select mode as data, then will be singled out counting
According to S (x1), S(x(1+t)), S(x(1+2t)) ..., the data that will be singled out upload in block chain；
Data B (1)=S (x is set in this process1), B(2)= S(x(1+t)), B(3)= S(x(1+2t))…B(n)= S
(x(1+(n-1) t))；
Two, verification of data process:
Need to check data f (xn) authenticity when, first find the corresponding S (x of this datan), it then positions from this data
The data uploaded that nearest front and back is each one are B (x '), B (x '+1)；
Obtain its corresponding B (x '), the numerical value of B (x '+1)；
Confirmation S (x ')=B (x ') is compared, whether S (x '+t)=B (x '+1) meets；
Under the premise of satisfaction since f (x '), stop at f (x '+t), the f (x at f (x ') ...n) ... in the section of f (x '+t) again
The S (x '+t) that carries out calculating S (x ') ..., obtains data and is denoted as S ' (x ') ... S ' (x '+t)；
Whether unanimously S ' (x '+t) and B (x '+1) is compareed, if unanimously, the data in f (x ') to f (x '+t) are not usurped
Change, it is authentic and valid；
Whether consistent S ' (x '+t) and B (x '+1) is compareed, if it is inconsistent, f (x ') arrives the data at least one in f (x '+t)
Item is tampered, then enters next step checking step；
Compare S ' (x '+1) whether with S (x '+1) unanimously, compareed if consistent S ' (x '+2) whether with S (x '+2) unanimously,
The rest may be inferred until finding S ' (x '+y) not equal to S (x '+y), (wherein y≤t), data f (x '+y) is data tampering at this time
Point, it is all there is no public trust to the data between f (x '+t) positioned at f (x '+y)；
If f (xn) be not located at f (x '+y) between f (x '+t), then f (xn) it is trust data, it is not tampered with；
If f (xn) be located at f (x '+y) between f (x '+t), then f (xn) be can not letter data, not can be used；
If comparing confirmation S (x ')=B (x '), S (x '+t)=B (x '+1) is simultaneously unsatisfactory for, then needs to expand data comparison range,
And repeat the above steps, until navigating to the first data point that mistake occurs and its data area section influenced；
Three, increase data processing speed and capacity on chain:
By expanding the average value of the t uploaded between the data in block chain, reduction uploads to the total amount of data in block chain,
In the case where not changing block chain attribute itself, so that it may simply increase processing speed and capacity in application.
2. improving the method for data-handling efficiency in block chain application according to claim 1, characterized in that the number
In step 2 according to storing process, initial data is handled, processing mode can be hash algorithm, any other function
Or other Encryption Algorithm.
3. improving the method for data-handling efficiency in block chain application according to claim 1, characterized in that the data
In the step 4 of storing process, the concrete mode that two datas merge can be addition, superposition, subtraction or arbitrary data and merge
Mode, by determining in specifically used.
4. improving the method for data-handling efficiency in block chain application according to claim 1, characterized in that the data
In the step 6 of storing process, the data that will be singled out upload in block chain can be by API or other modes.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810813881.7A CN109067719B (en) | 2018-07-23 | 2018-07-23 | Method for improving data processing efficiency in block chain application |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810813881.7A CN109067719B (en) | 2018-07-23 | 2018-07-23 | Method for improving data processing efficiency in block chain application |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109067719A true CN109067719A (en) | 2018-12-21 |
| CN109067719B CN109067719B (en) | 2020-12-22 |
Family
ID=64836114
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810813881.7A Active CN109067719B (en) | 2018-07-23 | 2018-07-23 | Method for improving data processing efficiency in block chain application |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109067719B (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111079161A (en) * | 2019-12-12 | 2020-04-28 | 山西云海智化大数据科技有限公司 | Trusted data exchange method based on block chain technology |
| CN111162912A (en) * | 2019-12-30 | 2020-05-15 | 深圳前海微众银行股份有限公司 | Verification method and device suitable for block chain |
| CN113806072A (en) * | 2021-08-10 | 2021-12-17 | 中标慧安信息技术股份有限公司 | Data processing method and system based on edge calculation |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20170329980A1 (en) * | 2016-05-13 | 2017-11-16 | Vmware, Inc. | Secure and scalable data transfer using a hybrid blockchain-based approach |
| CN107426170A (en) * | 2017-05-24 | 2017-12-01 | 阿里巴巴集团控股有限公司 | A kind of data processing method and equipment based on block chain |
| US20180103042A1 (en) * | 2016-10-12 | 2018-04-12 | Bank Of America Corporation | Automated data authentication and service authorization via cryptographic keys in a private blockchain |
| CN108092982A (en) * | 2017-12-22 | 2018-05-29 | 广东工业大学 | A kind of date storage method and system based on alliance's chain |
-
2018
- 2018-07-23 CN CN201810813881.7A patent/CN109067719B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20170329980A1 (en) * | 2016-05-13 | 2017-11-16 | Vmware, Inc. | Secure and scalable data transfer using a hybrid blockchain-based approach |
| US20180103042A1 (en) * | 2016-10-12 | 2018-04-12 | Bank Of America Corporation | Automated data authentication and service authorization via cryptographic keys in a private blockchain |
| CN107426170A (en) * | 2017-05-24 | 2017-12-01 | 阿里巴巴集团控股有限公司 | A kind of data processing method and equipment based on block chain |
| CN108092982A (en) * | 2017-12-22 | 2018-05-29 | 广东工业大学 | A kind of date storage method and system based on alliance's chain |
Non-Patent Citations (1)
| Title |
|---|
| 葛泽烽等: "区块链技术在企业即时通信系统中的应用", 《软件导刊》 * |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111079161A (en) * | 2019-12-12 | 2020-04-28 | 山西云海智化大数据科技有限公司 | Trusted data exchange method based on block chain technology |
| CN111162912A (en) * | 2019-12-30 | 2020-05-15 | 深圳前海微众银行股份有限公司 | Verification method and device suitable for block chain |
| CN111162912B (en) * | 2019-12-30 | 2021-06-15 | 深圳前海微众银行股份有限公司 | Verification method and device suitable for block chain and storage medium |
| CN113806072A (en) * | 2021-08-10 | 2021-12-17 | 中标慧安信息技术股份有限公司 | Data processing method and system based on edge calculation |
| CN113806072B (en) * | 2021-08-10 | 2022-10-21 | 中标慧安信息技术股份有限公司 | Data processing method and system based on edge calculation |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109067719B (en) | 2020-12-22 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10776786B2 (en) | Method for creating, registering, revoking authentication information and server using the same | |
| US20220327122A1 (en) | Performing data mining operations within a columnar database management system | |
| WO2020119053A1 (en) | Picture clustering method and apparatus, storage medium and terminal device | |
| CN109067719A (en) | The method of data-handling efficiency is improved in the application of block chain | |
| US9116879B2 (en) | Dynamic rule reordering for message classification | |
| US20160147808A1 (en) | Inverted indexing | |
| WO2022126901A1 (en) | Commodity recommendation method and related device thereof | |
| US10614312B2 (en) | Method and apparatus for determining signature actor and identifying video based on probability of appearance of signature actor | |
| US11514003B2 (en) | Data compression based on key-value store | |
| CN109359206A (en) | Image processing method and system based on Internet of Things campus administration | |
| US20150066873A1 (en) | Policy based deduplication techniques | |
| CN103336890A (en) | Method for quickly computing similarity of software | |
| US20200372013A1 (en) | Accelerated processing apparatus for transaction considering transaction failure probability and method thereof | |
| US9852226B2 (en) | Search engine results system using entity density | |
| US20190012315A1 (en) | User feedback for low-confidence translations | |
| CN107329947B (en) | The determination method, device and equipment of Similar Text | |
| KR20190030434A (en) | Method, apparatus and computer software stored in computer readable recording medium for trademark similarity determination using deep learnig engine trained based on trademark similarity result | |
| WO2020113582A1 (en) | Providing images with privacy label | |
| Drew et al. | Strand: fast sequence comparison using mapreduce and locality sensitive hashing | |
| CN109299887A (en) | A kind of data processing method, device and electronic equipment | |
| US11960453B2 (en) | Techniques for asynchronous snapshot invalidation | |
| CN107436920A (en) | Node.js authority control methods, storage medium, electronic equipment and system | |
| US20160275172A1 (en) | Non-transitory computer-readable recording medium, data classifying method, and data classifying device | |
| CN106127596A (en) | A kind of method for release management for the non-original picture of social networks | |
| CN109359096A (en) | A kind of digital asset secure sharing method and device based on the storage of block chain |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |