CN109947766A - For tracking method, the computer system and storage medium of the transaction of block chain - Google Patents
For tracking method, the computer system and storage medium of the transaction of block chain Download PDFInfo
- Publication number
- CN109947766A CN109947766A CN201711045794.3A CN201711045794A CN109947766A CN 109947766 A CN109947766 A CN 109947766A CN 201711045794 A CN201711045794 A CN 201711045794A CN 109947766 A CN109947766 A CN 109947766A
- Authority
- CN
- China
- Prior art keywords
- transaction
- tree
- account
- period
- tracked
- 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.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 33
- 238000012546 transfer Methods 0.000 claims description 38
- 230000000694 effects Effects 0.000 claims description 17
- 230000004044 response Effects 0.000 claims description 8
- 238000004590 computer program Methods 0.000 claims description 4
- 238000004364 calculation method Methods 0.000 claims description 3
- 238000010586 diagram Methods 0.000 description 9
- 238000004891 communication Methods 0.000 description 4
- 230000006870 function Effects 0.000 description 4
- 230000008569 process Effects 0.000 description 3
- 238000013461 design Methods 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000004422 calculation algorithm Methods 0.000 description 1
- 238000013500 data storage Methods 0.000 description 1
- 230000005611 electricity Effects 0.000 description 1
- 230000036541 health Effects 0.000 description 1
- 238000003780 insertion Methods 0.000 description 1
- 230000037431 insertion Effects 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 230000000630 rising effect Effects 0.000 description 1
- 239000004065 semiconductor Substances 0.000 description 1
Landscapes
- Financial Or Insurance-Related Operations Such As Payment And Settlement (AREA)
Abstract
Method, the computer system and computer readable storage medium of realization this method that present disclose provides a kind of for tracking the transaction of block chain.This method comprises: multiple transaction in block chain are sorted according to an account involved in wherein each transaction and exchange hour；The transaction B+ tree of multiple transaction of the block chain is constructed using the content of the transaction as value using the combination of an account and exchange hour involved in each transaction as major key；And specific transaction is tracked from transaction B+ tree.
Description
Technical field
This disclosure relates to which Internet technology, more particularly, to a kind of method for tracking the transaction of block chain, realizes and is somebody's turn to do
The computer system and computer readable storage medium of method.
Background technique
Block chain (Blockchain) is a key concept of bit coin, is substantially the data of a decentralization
Library, the Distributed sharing account book for store transaction.Block chain is made of block, and each block includes the information of one group of transaction.
Whenever thering is transaction to generate in network, there is the node (i.e. miner (Miner)) of powerful operational capability just to open in network
Begin competition one Hash puzzle of solution, competes the right that successful node acquisition generates new block and is remembered with constructing new block
Record newest transaction.New block is linearly added original block chain end sequentially in time, this account book will
Ceaselessly increase and extends.
Fig. 1 shows a kind of structural schematic diagram of block chain 10.As shown in fig. 1, block chain 10 is by one or more areas
Block 1001、1002、1003... (being referred to as block 100) is constituted.Block 100 includes mainly block head 110 and the block is included
Transaction List Table 120.In general, the size of block head 110 is 80 bytes, including upper in version number (4 byte) field, block chain
Cryptographic Hash (42 byte) field, Merkel root cryptographic Hash (hashMerkelRoot, 42 bytes) field, timestamp (4 of one block
Byte) field, the block Hash puzzle difficulty value (4 byte) field and random number N once (4 byte) field.Each friendship
It include at least one transaction in easy list 120.By taking a common money transfer transactions as an example, the content of the transaction generally includes to produce
Account is transferred to account, exchange hour and number of transaction etc..
This distributed nature of block chain makes it possible to carry out trust transaction in non-trusted network, and not any
One folk prescription being capable of oneself modification transactions history.Therefore, block chain provides the trackability of transactions history.Currently, increasingly
More areas and group are woven in the application that block chain is used for oneself by research, such as finance, health.
Summary of the invention
However, the rising of the transaction size with block chain, tracks the transaction of some account by traversing all blocks
History becomes more and more difficult.
In view of the above-mentioned problems, based on the method and realization this method that the present disclosure proposes a kind of by tracking the transaction of block chain
Calculation machine system and computer readable storage medium.
According to one aspect of the disclosure, a kind of method for tracking the transaction of block chain is provided.This method comprises: will
Multiple transaction in block chain are sorted according to an account involved in wherein each transaction and exchange hour；By each exchange
The combination of the account and exchange hour that are related to constructs being somebody's turn to do for the block chain using the content of the transaction as value as major key
The transaction B+ tree of multiple transaction；And specific transaction is tracked from transaction B+ tree.
It is a kind of for tracking the computer system of block chain transaction another aspect of the present disclosure provides.The meter
Calculation machine system includes: memory, wherein being stored with computer program code；And one or more processors, it is configured as
The computer program stored in the memory is run, by multiple transaction in block chain according to involved in wherein each transaction
One account and exchange hour sequence；It, will using the combination of an account and exchange hour involved in each transaction as major key
The content of the transaction constructs the transaction B+ tree of multiple transaction of the block chain as value；And it is tracked from transaction B+ tree
Specific transaction.
Still another aspect of the present disclosure provides a kind of computer readable storage mediums, are stored thereon with for chasing after
The computer code of track block chain transaction.The computer code include: for by multiple transaction in block chain according to wherein every
The computer code of an account involved in a transaction and exchange hour sequence；For by an account involved in each transaction
Number and exchange hour combination be used as major key, using the content of the transaction as be worth, construct the friendship of multiple transaction of the block chain
The computer code of easy B+ tree；And for tracking the computer code specifically traded from transaction B+ tree.
Detailed description of the invention
By reference to the description of the specific embodiment of the disclosure given by following drawings, it is better understood with this public affairs
It opens, and the other purposes of the disclosure, details, features and advantages will become apparent, in which:
Fig. 1 shows a kind of schematic diagram of block chain structure；
Fig. 2 shows the schematic diagrames according to a kind of illustrative methods for tracking the transaction of block chain of the disclosure；
Fig. 3 shows a kind of illustrative diagram for B+ tree of trading constructed by method according to Fig.2,；And
Fig. 4 shows the block diagram of the computer system for tracking the transaction of block chain according to the disclosure.
Specific embodiment
The preferred embodiment of the disclosure is more fully described below with reference to accompanying drawings.Although showing the disclosure in attached drawing
Preferred embodiment, however, it is to be appreciated that may be realized in various forms the disclosure without the embodiment party that should be illustrated here
Formula is limited.On the contrary, these embodiments are provided so that this disclosure will be more thorough and complete, and can be by the disclosure
Range is fully disclosed to those skilled in the art.
Hereinafter, Fig. 2 to Fig. 4 will be combined to be described to according to the scheme for being used to track the transaction of block chain of the disclosure.Fig. 2
Show the schematic diagram of the method 20 for tracking the transaction of block chain according to the disclosure；Fig. 3 shows side according to Fig.2,
A kind of illustrative diagram of transaction B+ tree 30 constructed by method；Fig. 4 shows handing over for tracking block chain according to the disclosure
The block diagram of easy computer system 40.Method 20 for example can be by computer according to the present disclosure or computer system 40
To realize.
Include two processes according to the method 20 for tracking the transaction of block chain of the disclosure, that is, constructs the mistake of transaction B+ tree
Journey (including the steps that 202-204 as shown in Figure 2) and inquiry/tracking particular transaction process (including walk as shown in Figure 2
Rapid 206-224).
Firstly, computer system 40 is by multiple transaction in block chain according to one involved in each transaction in step 202
A account and exchange hour sequence.It here, such as can be by " account identifier (ID)+exchange hour " as the basis sorted.
In step 204, computer system 40 using the combination of account and exchange hour as major key, using transaction content as
Value is multiple transaction building transaction B+ tree in block chain.
B+ tree is a kind of tree form data structure, and each node usually has multiple child nodes, and a B+ tree includes root node, interior
Portion's node (non-leaf nodes) and leaf node.Root node may be a leaf node, it is also possible to one comprising two or
The node of more than two child nodes.For the B+ tree of a m (m is greater than 2 integer) rank, the numbers of branches of root node
For [2, m]；The numbers of branches of each non-leaf nodes is [[m/2], m] (wherein [m/2] indicates the smallest positive integral for being greater than m/2),
Its major key quantity is equal to numbers of branches；The major key quantity of each leaf node is that [[m/2], m] (wherein [m/2] indicates to be greater than m/2
Smallest positive integral), all leaf nodes according to major key size order sort.In a B+ tree, the major key of non-leaf nodes
It just corresponds to index, equal to the maximum or minimum major key in its subtree；Leaf node not only includes major key (index), but also includes
The value of the node.
Here, for as previously mentioned, for a common money transfer transactions, it is usually directed to one and is transferred to account and one turn
Account out.Therefore, transaction can be ranked up according to " being transferred to account identifier (ID)+exchange hour " in step 202, it can also
To be ranked up according to " producing account identifier (ID)+exchange hour " to transaction.Alternatively, account and can also be produced to being transferred to
Account is ranked up respectively, to be directed to two transaction B+ trees for being transferred to account and producing account respectively for block chain building.
In view of the speed that transaction is inquired or tracked, in the disclosure, carry out subregion building according to memory property
Transaction B+ tree.As shown in Figure 3, the B+ tree for embodying the historical trading of block chain is constructed in external memory (such as disk) 302
312, and the B+ tree for embodying the Recent Activity of block chain is constructed in built-in storage 304.It is possible to further in built-in storage
Two different memory blocks 306 and 308 are distributed in 304, for rotating the B+ tree 316 and 318 for being stored as Recent Activity building, such as
It is lower to be described in detail.
In one embodiment, as described in step 2042, distribute at least the first memory block 304 He in built-in storage 304
Second memory block 306 is respectively used to memory transfer B+ tree 316 and work B+ tree 318.Assuming that computer system 40 is with the period 1
Periodically the B+ tree in built-in storage 304 is transferred in external memory, then shifting B+ tree is for the transaction in the previous period 1
B+ tree that is constructed and being not yet transferred in external memory 302, and it is new during the building of transfer B+ tree that the B+ tree that works, which is,
Into B+ tree constructed by the transaction in built-in storage 304.
When to update (addition) for occurring individually to trade, computer system 40 is since the root node of work B+ tree 318
Search, which leaf node that the transaction is inserted into work B+ tree 318 determined.Specifically, computer system 40 from work B
The root node of+tree 318 starts, and the major key of " account identifier+exchange hour " individually traded and each node is compared
Compared with, constituted mode based on B+ tree (such as node major key be its subtree maximum major key or minimum major key), to determine this
Transaction is inserted into which leaf node of work B+ tree 318.
It, can by the way that two individual memory blocks and respectively building transfer B+ tree and work B+ tree are arranged in built-in storage
Guarantee during entire building, and when then being tracked, does not have the transaction of omission.
In step 2044, computer system 40 will shift B+ in scheduled transfer time (such as regularly with the period 1)
Tree 316 is transferred to external memory 302 from built-in storage 304 with history of forming transaction tree 312.It has been deposited in external memory 302
In the case where historical trading tree 312 (in the case where not being first period 1), B+ tree 316 will be shifted from built-in storage
304, which are transferred to external memory 302, is equivalent to the former historical trading tree of update to form new historical trading tree.
In one embodiment of the present disclosure, transfer B+ tree 316 is transferred to external memory 302 from built-in storage 304
What historical trading tree 312 executed is B+ tree " block insertion " or batch updating, that is, since the root node of historical trading tree 312
Transfer B+ tree is inserted into which leaf node of historical trading tree 312 to determine by search.
In addition, after transfer B+ tree 306 is transferred to external memory 302, it can be by the work in the second memory block 308
B+ tree 318 is transferred to the first memory block 306 as the transfer B+ tree 306 updated.In this way, realizing the first memory block 306 and
The rotation work of two memory blocks 308.
It here, include historical trading tree 312, transfer B+ tree 316 and work B+ tree with transaction B+ tree constructed by step 204
The scheme of the disclosure is described for 318.However, it will be understood by those skilled in the art that transaction B+ tree can also only wrap
Include one or two of historical trading tree 312, transfer B+ tree 316 and work B+ tree 318.For example, being transported in computer system 40
In first period 1 historical trading tree 312 is not present, at this time transaction B+ described in step 204 in row in external memory 302
Tree only includes transfer B+ tree 316 and work B+ tree 318.Alternatively, in some cases or certain special time periods, shifting B+ tree
There is no newly generated transaction during 316 building, then transaction B+ tree described in step 304 may only include historical trading tree at this time
312 and transfer B+ tree 316.
Next, inquiry/the tracking from transaction B+ tree constructed by step 204 of computer system 40 is specifically traded.It is logical
Often, the transaction tracked is transaction (be transferred to and/or produce transaction) of some account in some special time period or particular moment.
In step 206, computer system 40 receives the tracking request of input, and tracking request includes at least account to be tracked
With at the beginning of the period to be tracked and the end time.The utilization account to be tracked of computer system 40 is opened with the period
Begin time and end time, inquires the All Activity in the period from transaction B+ tree.
Specifically, by taking B+ tree of trading includes historical trading tree, transfer B+ tree and the B+ tree three that works as an example, in step 208,
At the beginning of computer system 40 is according to account to be tracked and the period and the end time determines that the period to be tracked is
In the no exchange's corresponding period only existed in external memory 302 or built-in storage 304.
In response to determining that the exchange of period to be tracked only in external memory 302 or built-in storage 304 is corresponding
In period (judgement of step 208 is "Yes"), in step 210, computer system 40 is only from external memory 302 or built-in storage
304 are inquired.The method inquired from external memory 302 for example can be the update list above with reference to described in step 2042
Querying method when a transaction, the concrete mode inquired from built-in storage 304 for example can be referring to step 216-
Method described in 224.It is appreciated that the method for inquiring specific node from an existing B+ tree is those skilled in the art's public affairs
Know, therefore repeats no more herein.
In response to determining that the period to be tracked is corresponding with the exchange in built-in storage 304 across external memory 302
In period (judgement of step 208 is "No"), in step 212, computer system 40 is according to external memory 302 and built-in storage
When period wait track is divided into corresponding with the transaction in external memory 302 first by the boundary time of 304 transaction
Between section part and second time period part corresponding with the transaction in built-in storage 304.Here, external memory 302 and memory
The boundary time of the transaction of reservoir 304 can be the time that transfer B+ tree 316 is transferred in external memory 302, i.e. history B+
The renewal time of tree 312.
Next, computer system 40 inquires account to be tracked at the first time from external memory 302 in step 214
Transaction in section part.
Simultaneously or consecutively with step 214, computer system 40 also inquires account to be tracked from built-in storage 304 and exists
Transaction in second time period part.The process can also specifically include: computer system 40 determines that second time period part is
It is no to only exist in (step 216) in the period corresponding to transfer B+ tree 316 or work B+ tree 318.
In response to determining that second time period part only exists in the period corresponding to transfer B+ tree 316 or only exist in work
In period corresponding to B+ tree 318 (step 216 is judged as "Yes"), in step 218, computer system 40 is only from transfer B+ tree
316 or work B+ tree 318 in inquired.
On the contrary, in response to determining period corresponding to second time period spans transfer B+ tree 316 and work B+ tree
Period corresponding to 318 (step 216 is judged as "No"), in step 220, computer system 40 is according to transfer 316 He of B+ tree
Second time period part is further divided into third period part and the 4th period portion by the boundary time of work B+ tree 318
Point.Here, when the boundary time of transfer B+ tree 316 and the B+ tree 318 that works can be required for the building of transfer B+ tree 316
Between, or can be the time that work B+ tree 318 is transferred to the first memory block 306 from the second memory block 308, that is, shift B+ tree
316 renewal time.
Next, computer system 40 inquires account to be tracked within the third period from transfer B+ tree 316 respectively
Transaction, and transaction (step 222) of the account to be tracked within the 4th period is inquired from work B+ tree 318.
Finally, computer system 40 returns to inquired All Activity as tracking result.In the case of different, chase after
Track result includes different content.For example, for period to be tracked only feelings corresponding with the transaction in external memory 302
Condition, tracking result only include the query result (step 210) to historical trading tree 312.For the period to be tracked only with memory
The corresponding situation of transaction in reservoir 304, tracking result can be only comprising the query result (steps 216 to transfer B+ tree 316
The case where being judged as "Yes"), only include to work B+ tree 318 query result (step 216 is judged as the case where "Yes") or
It include that (step 216 is judged as the case where "No", i.e. step to query result of the B+ tree 316 with both B+ trees 318 that works is shifted
Result in 222).The case where transaction in external memory 302 and built-in storage 304 is crossed over for the period to be tracked, tracking
As a result comprising both above-mentioned or three.
It will be understood by those skilled in the art that the scheme of the transaction of tracking block chain described in the disclosure not only may be implemented
On single computer systems 40, and can be with distributed implementation on multiple computer nodes 40 and 50 (as shown in Figure 4).
For example, the transaction B+ tree of P2P can be constructed on multiple computer nodes 40 and 50, so that its storage capacity is extended, and
When inquiry, the inquiry across multiple computer nodes may be implemented.
It, being capable of easily tracing Area by way of the record that block chain is traded is configured to B+ tree using aforesaid way
Historical trading in block chain, and convenient for updating and being inserted into new transaction.
In addition, by being handed over respectively with the block chain that the tree-like formula of B+ stores different time in built-in storage and external memory
Easily, it can be improved inquiry velocity and transaction avoided to omit.
Fig. 4 shows the block diagram of the computer system 40 for tracking the transaction of block chain.Computer system 40 can position
In block chain 10 or independently of block chain 10.
As shown in Figure 4, computer system 40 includes processor 41.Processor 41 control computer system 40 operation and
Function.For example, in certain embodiments, processor 41 can be by means of the computer that is stored in coupled memory 42
Program code instructs 43 to execute various operations.Memory 42 can be any suitable class suitable for local technical environment
Type, and can use any suitable data storage technology to realize, memory device including but not limited to based on semiconductor,
Magnetic memory device and system, light storage device and system.In addition, memory 42 may include as described in above in conjunction with Fig. 2 and Fig. 3
External memory 302 and built-in storage 304.
Processor 41 can be any suitable type suitable for local technical environment, and can include but is not limited to
General purpose computer, special purpose computer, microcontroller, digital signal controller (DSP) and the multicore controller based on controller
One or more of framework is multiple.Computer system 40 also may include multiple processors 41.Processor 41 and communication interface
44 are connected, to realize sending and receiving for information by communication interface 44.For example, processor 41 can by communication interface 44 with
One or more computer nodes 50 carry out above-mentioned communication.
In one or more exemplary designs, this can be realized with hardware, software, firmware or their any combination
The application function.It, can be for example using the function as one or more instruction or code if realized with software
May be stored on the computer-readable medium, or as on computer-readable medium one or more instructions or code transmit.
Discrete hardware components can be used to realize in each unit of device disclosed herein, realize with also can integrate
One hardware component, on processor.For example, general processor, digital signal processor (DSP), dedicated integrated electricity can be used
It is road (ASIC), field programmable gate array (FPGA) or other programmable logic device, discrete gate or transistor logic, discrete
Hardware component or any combination for executing function as described herein realize or execute combine it is various described in the disclosure
Illustrative logical block, module and circuit.
Those of ordinary skill in the art should also understand that, the various illustrative logics described in conjunction with embodiments herein
The combination of electronic hardware, computer software or both may be implemented into block, module, circuit and algorithm steps.
The above description of the disclosure is for making any those of ordinary skill of this field can be realized or use the disclosure.It is right
For those of ordinary skill in the art, the various modifications of the disclosure be will be apparent from, and generality defined herein
Principle can also be applied to other deformations in the case where not departing from the spirit and scope of the disclosure.Therefore, the disclosure is simultaneously
It is not limited to example and design as described herein, but it is consistent with the widest scope of principle disclosed herein and novel features.
Claims (10)
1. a kind of method for tracking the transaction of block chain, comprising:
Multiple transaction in block chain are sorted according to an account involved in wherein each transaction and exchange hour；
Using the combination of an account and exchange hour involved in each transaction as major key, using the content of the transaction as value,
Construct the transaction B+ tree of the multiple transaction of the block chain；And
Specific transaction is tracked from the transaction B+ tree.
2. the method as described in claim 1, wherein the specific transaction of tracking includes: from the transaction B+ tree
The tracking request of input is received, tracking request included at least account to be tracked and at the beginning of the period to be tracked
And the end time；And
According to the account to be tracked and at the beginning of the period and the end time, institute is inquired from the transaction B+ tree
State the All Activity of account to be tracked during the period of time.
3. method according to claim 2, wherein building transaction B+ tree further include:
At least the first memory block and the second memory block are distributed in built-in storage is respectively used to memory transfer B+ tree and work B+ tree,
Wherein the transfer B+ tree be constructed by the transaction in the previous period 1 and to be not yet transferred to the B+ tree in external memory,
The work B+ tree is to enter B+ tree constructed by the transaction in the built-in storage during the building of the transfer B+ tree；
And
Periodically the transfer B+ tree is transferred in the external memory from the built-in storage with more with the period 1
Historical trading tree in the new external memory.
4. method as claimed in claim 3 inquires the All Activity of account to be tracked during the period of time further include:
Determine whether the period to be tracked only exists in corresponding to the transaction in the external memory or the built-in storage
Period in；
In response to determine the period to be tracked only exist in exchange's corresponding period in the external memory or
It only exists in exchange's corresponding period in the built-in storage, is only looked into from the external memory or the built-in storage
Ask the All Activity of account to be tracked during the period of time；And
In response to determining the period to be tracked across exchange's corresponding period in the external memory and described
Exchange's corresponding period in built-in storage,
The period to be tracked is divided into according to the boundary time of the transaction of the external memory and the built-in storage
First time period part and second time period part,
From inquiring the All Activity of the account to be tracked in the first time period part in the external memory, from described
The All Activity of the account to be tracked in the second time period part is inquired in built-in storage, and
The All Activity and the to be tracked account of the account to be tracked in the first time period part is returned described
Result of the All Activity as the transaction tracking of account to be tracked during the period of time in second time period part.
5. method as claimed in claim 3 inquires the account to be tracked in second time from the built-in storage
All Activity in section part further include:
Determine whether the second time period part only exists in the period corresponding to the transfer B+ tree or the work B+ tree
It is interior；
Institute is only existed in the transfer B+ tree corresponding period or only existed in response to the determination second time period part
It states in the work B+ tree corresponding period, the account to be tracked only is inquired from the transfer B+ tree or the work B+ tree
All Activity in the second time period part；And
In response to transfer B+ tree corresponding period and the work B+ tree described in the determination second time period spans
The corresponding period,
The second time period part is further divided into according to the boundary time of the transfer B+ tree and the work B+ tree
The third period part and the 4th period part,
The All Activity of the account to be tracked in third period part is inquired from the transfer B+ tree, from described
The All Activity of the account to be tracked in the 4th period part is inquired in work B+ tree, and
The All Activity and the to be tracked account of the account to be tracked in third period part is returned described
All Activity in 4th period part is as the transaction tracking of the account to be tracked in the second time period part
Result.
6. method as claimed in claim 3, further includes:
When updating single transaction to the transaction B+ tree, searched for since the root node of the work B+ tree to determine the list
A trade is inserted into which leaf node of the work B+ tree.
7. method as claimed in claim 3, wherein with the period 1 periodically by the transfer B+ tree from the built-in storage
It is transferred in the external memory to update the historical trading tree in the external memory further include:
It is searched for since the root node of the historical trading tree and transfer B+ tree is inserted by the historical trading tree with determination
Which leaf node；And
The work B+ tree of second memory block is transferred to first memory block as the transfer B+ tree updated.
8. the method as described in claim 1, wherein each transaction with one be transferred to account and one to produce account associated,
In
By multiple transaction in block chain according to an account involved in wherein each transaction and exchange hour sequence include: by
Multiple transaction in block chain are according to being transferred to account and exchange hour sorts involved in wherein each transaction, and/or by block
Multiple transaction in chain are according to producing account and exchange hour sorts involved in wherein each transaction；And wherein
The transaction B+ tree for constructing the multiple transaction of the block chain includes: that will be transferred to account and friendship involved in each transaction
The combination of easy time is used as major key, using the content of the transaction as being worth, constructs the B+ tree for being transferred to transaction of the block chain, and/
Or the combination of account and exchange hour will be produced involved in each transaction as major key, using the content of the transaction as value, structure
Build the B+ tree for producing transaction of the block chain.
9. a kind of for tracking the computer system of block chain transaction, comprising:
Memory, wherein being stored with computer program code；And
One or more processors are configured as running the computer program stored in the memory, with
Multiple transaction in block chain are sorted according to an account involved in wherein each transaction and exchange hour；
Using the combination of an account and exchange hour involved in each transaction as major key, using the content of the transaction as value,
Construct the transaction B+ tree of the multiple transaction of the block chain；And
Specific transaction is tracked from the transaction B+ tree.
10. a kind of computer readable storage medium is stored thereon with the computer code for tracking the transaction of block chain, the meter
Calculation machine code includes:
For what multiple transaction in block chain were sorted according to an account involved in wherein each transaction and exchange hour
Computer code；
For using the combination of an account and exchange hour involved in each transaction as major key, using the content of the transaction as
Value constructs the computer code of the transaction B+ tree of the multiple transaction of the block chain；And
For tracking the computer code specifically traded from the transaction B+ tree.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711045794.3A CN109947766A (en) | 2017-10-31 | 2017-10-31 | For tracking method, the computer system and storage medium of the transaction of block chain |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711045794.3A CN109947766A (en) | 2017-10-31 | 2017-10-31 | For tracking method, the computer system and storage medium of the transaction of block chain |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN109947766A true CN109947766A (en) | 2019-06-28 |
Family
ID=67004009
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201711045794.3A Pending CN109947766A (en) | 2017-10-31 | 2017-10-31 | For tracking method, the computer system and storage medium of the transaction of block chain |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109947766A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112800050A (en) * | 2019-11-13 | 2021-05-14 | 北京清红微谷技术开发有限责任公司 | Transaction data storage method, system and device based on state tree and P2P network |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105608146A (en) * | 2015-12-17 | 2016-05-25 | 布比（北京）网络技术有限公司 | Block chain tracing method |
| CN106055597A (en) * | 2016-05-24 | 2016-10-26 | 布比（北京）网络技术有限公司 | Digital transaction system, and account information query method therefor |
| US20170177898A1 (en) * | 2015-12-16 | 2017-06-22 | International Business Machines Corporation | Personal ledger blockchain |
-
2017
- 2017-10-31 CN CN201711045794.3A patent/CN109947766A/en active Pending
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20170177898A1 (en) * | 2015-12-16 | 2017-06-22 | International Business Machines Corporation | Personal ledger blockchain |
| CN105608146A (en) * | 2015-12-17 | 2016-05-25 | 布比（北京）网络技术有限公司 | Block chain tracing method |
| CN106055597A (en) * | 2016-05-24 | 2016-10-26 | 布比（北京）网络技术有限公司 | Digital transaction system, and account information query method therefor |
Non-Patent Citations (2)
| Title |
|---|
| TOMOYUKI SANDA 等: "Proposal of new authentication method in Wi-Fi access using Bitcoin 2.0", 《2016 IEEE 5TH GLOBAL CONFERENCE ON CONSUMER ELECTRONICS》 * |
| 李董 等: "区块链技术原理、应用领域及挑战", 《电信科学》 * |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112800050A (en) * | 2019-11-13 | 2021-05-14 | 北京清红微谷技术开发有限责任公司 | Transaction data storage method, system and device based on state tree and P2P network |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108062672B (en) | Flow scheduling method based on block chain intelligent contract | |
| Emek et al. | Stone age distributed computing | |
| Besta et al. | Practice of streaming processing of dynamic graphs: Concepts, models, and systems | |
| US7710884B2 (en) | Methods and system for dynamic reallocation of data processing resources for efficient processing of sensor data in a distributed network | |
| CN113743941B (en) | Method for executing transaction in block chain, block chain and main node | |
| US20190199693A1 (en) | Safe-Transfer Exchange Protocol Based on Trigger-Ready Envelopes Among Distributed Nodes. | |
| CN106407430A (en) | Complex and intelligent contract state synchronization method based on phase buckets | |
| CN109948003B (en) | Block chain system of isomorphic dual-mode main and auxiliary chains and block production method thereof | |
| TW202101437A (en) | Hierarchical storage method and device based on block chain and electronic equipment | |
| CN106462449A (en) | Multi-database log with multi-item transaction support | |
| Halim et al. | A MapReduce-based maximum-flow algorithm for large small-world network graphs | |
| CN107247758B (en) | Data processing method based on bank core system | |
| EP2176783A1 (en) | Efficient updates for distributed file systems | |
| CN109146677A (en) | Method, computer system and the readable storage medium storing program for executing of parallel building block chain view | |
| US20200084041A1 (en) | Automated Blockchain Protocol Update | |
| CN103164418A (en) | Method and device for processing serial numbers | |
| CA3194984A1 (en) | Methods and apparatus for a distributed database within a network | |
| Angluin et al. | Fast construction of overlay networks | |
| CN110309173B (en) | Contract data recording method and device, block chain node and storage medium | |
| CN110442580A (en) | A kind of block chain state date storage method, equipment and storage medium | |
| Zhao | Cross-Blockchain Transactions: Systems, Protocols, and Topological Theory | |
| CN113744061B (en) | Method for performing transactions in a blockchain system, and slave node | |
| CN103294799A (en) | Method and system for parallel batch importing of data into read-only query system | |
| CN110020272A (en) | Caching method, device and computer storage medium | |
| CN109947766A (en) | For tracking method, the computer system and storage medium of the transaction 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 | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20190628 |
|
| WD01 | Invention patent application deemed withdrawn after publication |