CN106528746A - Trade information inquiring method, device and system - Google Patents
Trade information inquiring method, device and system Download PDFInfo
- Publication number
- CN106528746A CN106528746A CN201610969683.0A CN201610969683A CN106528746A CN 106528746 A CN106528746 A CN 106528746A CN 201610969683 A CN201610969683 A CN 201610969683A CN 106528746 A CN106528746 A CN 106528746A
- Authority
- CN
- China
- Prior art keywords
- matched rule
- transaction information
- data volume
- matched
- threshold value
- 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
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/95—Retrieval from the web
- G06F16/951—Indexing; Web crawling techniques
Landscapes
- Engineering & Computer Science (AREA)
- Databases & Information Systems (AREA)
- Theoretical Computer Science (AREA)
- Data Mining & Analysis (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Financial Or Insurance-Related Operations Such As Payment And Settlement (AREA)
- Computer And Data Communications (AREA)
Abstract
The invention discloses a trade information inquiring method, device and system. The method comprises the steps of: sending a trade information inquiry request carrying a first matching rule to a complete node, so that the complete node inquires first trade information matched with the first matching rule according to the first matching rule, and collects statistics on the data volume of the first trade information; receiving the data volume sent by the complete node, and judging whether the data volume is greater than a first preset threshold corresponding to an SPV (Simplified Payment Verification) node; if the data volume is greater than the first preset threshold, dynamically adjusting the first matching rule to obtain a second matching rule, and sending a trade information inquiry request carrying the second matching rule to the complete node, so that the complete node inquires second trade information matched with the second matching rule according to the second matching rule; and receiving second trade information sent by the complete node, thereby reducing the transmission of invalid trade information and avoiding the defect that the SPV node receiving too much trade information is overloaded.
Description
Technical field
The present invention relates to Internet technical field, and in particular to a kind of Transaction Information querying method, apparatus and system.
Background technology
In bit coin network, complete block chain on the in store network of complete node, it can be by traveling through whole piece area
Transaction record on block chain is obtaining the All Activity information of certain account.And in block chain network, user, carries for convenience
A kind of incomplete node, also referred to as SPV (simple payment verification, Simplified Payment Verification) sections are supplied
Point, i.e., simple payment verification node.By SPV nodes, as long as user preserves all of block header, even if not running completely
Node also can verify that payment.
The appearance of SPV nodes, participates in bit coin network trading to domestic consumer and provides a great convenience.Although user's nothing
Method directly verifies transaction, but if the transaction being consistent can be found from the somewhere of block chain, it is possible to confirm that network has recognized that
This transaction, and obtained the accreditation of multiple nodes of network.That is, SPV nodes are not enterprising in its node itself
Row checking, but go to complete checking by associated complete node, SPV nodes itself only safeguard the certain number needed for user
According to.
That is, SPV nodes need to receive the Transaction Information inquired about by complete node, will there is complete node and send
Transaction Information data volume it is excessive, and cause SPV node overload operations, increased the transmission of invalid Transaction Information.
The content of the invention
In view of the above problems, it is proposed that the present invention so as to provide one kind overcome the problems referred to above or at least in part solve on
State Transaction Information querying method, Transaction Information inquiry unit and the corresponding Transaction Information inquiry system of problem.
According to an aspect of the invention, there is provided a kind of Transaction Information querying method, method is applied to SPV nodes, wraps
Include：
Send to complete node and carry the Transaction Information inquiry request of the first matched rule, so that complete node is according to the
One matched rule inquires about the first Transaction Information matched with the first matched rule, and counts the data volume of the first Transaction Information；
The data volume that complete node sends is received, and judges data volume the first default threshold whether corresponding more than SPV nodes
Value；
If data volume is more than the first predetermined threshold value, dynamic the first matched rule of adjustment obtains the second matched rule；
Send to complete node and carry the Transaction Information inquiry request of the second matched rule, so that complete node is according to the
Two matched rules inquire about the second Transaction Information matched with the second matched rule；
Receive the second Transaction Information that complete node sends.
According to a further aspect in the invention, there is provided a kind of Transaction Information inquiry unit, device are applied to SPV nodes, wrap
Include：
Sending module, for sending the Transaction Information inquiry request for carrying the first matched rule to complete node, for
The first Transaction Information that node is matched with the first matched rule according to the inquiry of the first matched rule completely, and count the first transaction
The data volume of information；
Receiver module, for receiving the data volume that complete node sends；
Whether judge module, for judging data volume more than corresponding first predetermined threshold value of SPV nodes；
Adjusting module, in the case of in data volume more than the first predetermined threshold value, dynamic the first matched rule of adjustment is obtained
To the second matched rule；
Sending module is further used for：The Transaction Information inquiry that the second matched rule is carried to the transmission of complete node please
Ask, for the second Transaction Information that complete node is matched with the second matched rule according to the inquiry of the second matched rule；
Receiver module is further used for：Receive the second Transaction Information that complete node sends.
According to a further aspect in the invention, there is provided a kind of Transaction Information inquiry system, system include：Transaction Information is inquired about
Device and complete node.
According to the scheme that the present invention is provided, the Transaction Information inquiry for carrying the first matched rule to the transmission of complete node please
Ask, for the first Transaction Information that complete node is matched with the first matched rule according to the inquiry of the first matched rule, and count
Whether the data volume of the first Transaction Information, receive the data volume that complete node sends, and judge data volume more than SPV nodes correspondence
The first predetermined threshold value, if data volume be more than the first predetermined threshold value, dynamic adjustment the first matched rule, obtain the second matching rule
Then, the Transaction Information inquiry request for carrying the second matched rule is sent to complete node, so that complete node is according to second
With the second Transaction Information that rule query and the second matched rule match, the second Transaction Information that complete node sends is received,
Reduce the transmission of invalid Transaction Information, it is to avoid SPV nodes are because receiving excessive Transaction Information and overload operation lacks
Fall into.
Described above is only the general introduction of technical solution of the present invention, in order to better understand the technological means of the present invention,
And can be practiced according to the content of description, and in order to allow the above and other objects of the present invention, feature and advantage can
Become apparent, below especially exemplified by the specific embodiment of the present invention.
Description of the drawings
By reading the detailed description of hereafter preferred implementation, various other advantages and benefit are common for this area
Technical staff will be clear from understanding.Accompanying drawing is only used for illustrating the purpose of preferred implementation, and is not considered as to the present invention
Restriction.And in whole accompanying drawing, it is denoted by the same reference numerals identical part.In the accompanying drawings：
Fig. 1 shows the schematic flow sheet of Transaction Information querying method according to an embodiment of the invention；
Fig. 2 shows the schematic flow sheet of Transaction Information querying method in accordance with another embodiment of the present invention；
Fig. 3 shows the structural representation of Transaction Information inquiry unit according to an embodiment of the invention；
Fig. 4 shows the structural representation of Transaction Information inquiry system according to an embodiment of the invention.
Specific embodiment
The exemplary embodiment of the disclosure is more fully described below with reference to accompanying drawings.Although showing the disclosure in accompanying drawing
Exemplary embodiment, it being understood, however, that may be realized in various forms the disclosure and should not be by embodiments set forth here
Limited.On the contrary, there is provided these embodiments are able to be best understood from the disclosure, and can be by the scope of the present disclosure
Complete conveys to those skilled in the art.
Fig. 1 shows the schematic flow sheet of Transaction Information querying method according to an embodiment of the invention.The method should
For SPV nodes, as shown in figure 1, the method is comprised the following steps：
Step S100, sends the Transaction Information inquiry request for carrying the first matched rule, for complete to complete node
The first Transaction Information that node is matched with the first matched rule according to the inquiry of the first matched rule, and count the first Transaction Information
Data volume.
SPV (Simplified Payment Verification) node, also becomes simple payment verification node, the section
Point need not store complete block chain, only preserve all of block head (block header) and can be carried out complete payment and test
The light node of card.
Node is the node in block chain network, wherein, the block chain copy that complete node is stored with complete completely.Block
Chain includes but is not limited to bit coin (bitcoin) block chain, ether mill (ethereum) block chain and super account book
(hyperledger) block chain.
When SPV nodes need to inquire about Transaction Information, Transaction Information inquiry request, the transaction can be sent to complete node
The first matched rule is carried in information inquiring request, and wherein, the first matched rule defines matching condition, and complete node is connecing
After receiving the Transaction Information inquiry request for carrying the first matched rule of SPV nodes transmission, can be according to the first matched rule
The first Transaction Information that inquiry is matched with the first matched rule.Completely node is matched with the first matched rule inquiring
After first Transaction Information, the data volume of the first Transaction Information is counted, and the data volume after statistics is sent to into SPV sections
Point.
Step S101, receives the data volume that complete node sends.
SPV nodes receive the data volume that complete node sends, due to the data of the Transaction Information that each node can be received
Amount is limited, if the Transaction Information for being sent to SPV nodes is excessive, it is easy to cause SPV node overload operations, so as to affect
Transfer rate, therefore, in the present embodiment, the data volume that complete node sends is received, rather than directly complete node is looked into
Ask the first Transaction Information and be sent to SPV nodes.
Whether step S102, judge data volume more than corresponding first predetermined threshold value of SPV nodes, if data volume is more than first
Predetermined threshold value, then execution step S103.
The data volume that SPV nodes can be received has a maximum, and referred to herein as the first predetermined threshold value is being received
After the data volume that full node sends, whether data volume is judged more than corresponding first predetermined threshold value of SPV nodes, primarily to really
Whether the data volume of the first Transaction Information that fixed complete node is inquired is more than the data volume that SPV nodes can be received, i.e. number
Whether the first predetermined threshold value is more than, and then determine the need for being adjusted the first matched rule according to amount.
Step S103, dynamic the first matched rule of adjustment, obtains the second matched rule.
In the case where the data volume for judging complete node transmission is more than the first predetermined threshold value, need to the first matching rule
Then enter Mobile state adjustment, it is therefore an objective to reduce the data volume of the Transaction Information that complete querying node is arrived.
Step S104, sends the Transaction Information inquiry request for carrying the second matched rule, for complete to complete node
The second Transaction Information that node is matched with the second matched rule according to the inquiry of the second matched rule.
Entering Mobile state adjustment to the first matched rule, after obtaining the second matched rule, SPV nodes will be sent out to complete node
The Transaction Information inquiry request for carrying the second matched rule, complete node is sent to be matched with second according to the inquiry of the second matched rule
The second Transaction Information that rule matches, and the second Transaction Information is sent to into SPV nodes.
Step S105, receives the second Transaction Information that complete node sends.
According to the method that the above embodiment of the present invention is provided, the transaction for carrying the first matched rule is sent to complete node
Information inquiring request, for the first transaction letter that complete node is matched with the first matched rule according to the inquiry of the first matched rule
Breath, and the data volume of the first Transaction Information is counted, the data volume that complete node sends is received, and judges whether data volume is more than
Corresponding first predetermined threshold value of SPV nodes, if data volume is more than the first predetermined threshold value, dynamic the first matched rule of adjustment is obtained
To the second matched rule, the Transaction Information inquiry request for carrying the second matched rule is sent to complete node, for saving completely
The second Transaction Information for o'clock being matched with the second matched rule according to the inquiry of the second matched rule, receive that complete node sends the
Two Transaction Informations, reduce the transmission of invalid Transaction Information, it is to avoid SPV nodes are super negative because receiving excessive Transaction Information
The defect of lotus operation.
Fig. 2 shows the schematic flow sheet of Transaction Information querying method in accordance with another embodiment of the present invention.The method
SPV nodes are applied to, as shown in Fig. 2 the method is comprised the following steps：
Step S200, sends the Transaction Information inquiry request for carrying the first matched rule, for complete to complete node
The first Transaction Information that node is matched with the first matched rule according to the inquiry of the first matched rule, and count the first Transaction Information
Data volume.
SPV (Simplified Payment Verification) node, also becomes simple payment verification node, the section
Point need not store complete block chain, only preserve all of block head (block header) and can be carried out complete payment and test
The light node of card.
Node is the node in block chain network, wherein, the block chain copy that complete node is stored with complete completely.Block
Chain includes but is not limited to bit coin (bitcoin) block chain, ether mill (ethereum) block chain and super account book
(hyperledger) block chain.
When SPV nodes need to inquire about Transaction Information, Transaction Information inquiry request, the transaction can be sent to complete node
The first matched rule is carried in information inquiring request, and wherein, the first matched rule defines matching condition, and complete node is connecing
After receiving the Transaction Information inquiry request for carrying the first matched rule of SPV nodes transmission, can be according to the first matched rule
The first Transaction Information that inquiry is matched with the first matched rule.Completely node is matched with the first matched rule inquiring
After first Transaction Information, the data volume of the first Transaction Information is counted, and the data volume after statistics is sent to into SPV sections
Point.
Wherein, the first matched rule is to be generated according to keyword and counting bloom filter.More specifically, keyword
Including block chain account address information.
Specifically, Bloom filter is a very long binary vector and a series of random mapping functions.Assume that cloth is grand
Filter is a sixteen bit array and three hash functions, and three hash functions are respectively hash function K1, hash function K2With
Hash function K3, the initial value of each number in the sixteen bit array of Bloom filter is zero, and the first matched rule is generated
Process can be：Pass through hash function K using block chain account address information as keyword1Carry out computing, Jing hash function K1Fortune
A number between 1 and 16 is obtained after calculation, is 1 by its corresponding position in the sixteen bit array, so as to Hash letter
Number K1Output record, then according to the same manner by hash function K2Output and hash function K3Output record
Come.
Transaction in the historical transactional information of storage is initiated ground during match trading information by so node completely
Location information and transaction purpose address information obtain two or more respectively Jing after these three hash function computings respectively as keyword
Output, if the position for being set to 1 in the arbitrary output in exporting more than the two is arranged to 1 in sixteen bit array,
Illustrate that the historical transactional information is the Transaction Information matched with the first matched rule；Otherwise illustrate the historical transactional information be not with
The Transaction Information of the first matched rule matching.
Assume to obtain sixteen bit array according to after the block chain account address information of SPV nodes and three hash function computings
In the 1st, the 3rd and the 14th be set to 1, if the transaction completely in the historical transactional information 1 of node storage initiates ground
Location information and transaction purpose address information obtain being output as Jing after these three hash function computings respectively as keyword respectively
1st, 3 and 14 and 2,4,10, then illustrate that historical transactional information 1 is the Transaction Information matched with the first matched rule, although history is handed over
Easily information 1 is the Transaction Information matched with the first matched rule, but, historical transactional information 1 is not necessarily related to SPV nodes
Transaction Information；If address information and transaction purpose address are initiated in the transaction completely in the historical transactional information 2 of node storage
Information obtains being output as 1,2 and 14 and 2,4,10 Jing after these three hash function computings as keyword respectively, then explanation is gone through
History Transaction Information 2 is not the Transaction Information matched with the first matched rule.
It should be noted that when key word is increased, the position for obtaining output valve after Hash process is carried out to keyword can
Can be 1, in this case, the position will not change again, also result in when keyword is deleted, it is impossible to directly change position
The value of corresponding positions in array.That is, as more keywords have pointed to the position repeated, Bloom filter is with position 1
Increase and saturation, accuracy is also reduced.Therefore, under conditions of M and N are constant, keyword is more, and complete node is according to first
Matched rule can the Transaction Information that the match is successful it is more, then complete node may be caused to be sent to the transaction letter of SPV nodes
The excessive data volume for being even more than the receivable Transaction Information of SPV nodes of the data volume of breath.It is possible to cause SPV nodes to surpass
Load operation, and also result in invalid data transfer.When needing to increase or when deleting keyword, need according to after increase or
Keyword and Bloom filter after deleting regenerates a new matched rule.
Counting bloom filter is that the one kind to Bloom filter is improved, and counting bloom filter is by original bit array
In each n-bit enumerators are expanded to by bit, that is to say, that when multiple keywords point to the position repeated, can in n-
The digit counter of bit adds 1, checks bit array non-zero in matching, when needing to delete keyword, only need to be bit array
The keyword correspondence position subtracts 1；In the same manner, when needing to add keyword, Hash process is carried out in the keyword to adding and obtain defeated
After going out value, only need to add 1 in the corresponding position of bit array, without regenerating new matched rule.
Step S201, receives the data volume that complete node sends.
SPV nodes receive the data volume that complete node sends, due to the data of the Transaction Information that each node can be received
Amount is limited, if the Transaction Information for being sent to SPV nodes is excessive, it is easy to cause SPV node overload operations, so as to affect
Transfer rate, therefore, in the present embodiment, the data volume that complete node sends is received, rather than directly complete node is looked into
Ask the first Transaction Information and be sent to SPV nodes.
Whether step S202, judge data volume more than corresponding first predetermined threshold value of SPV nodes, if data volume is more than first
Predetermined threshold value, then execution step S203；If data volume is less than the first predetermined threshold value, execution step S204.
The data volume that SPV nodes can be received has a maximum, and referred to herein as the first predetermined threshold value is being received
After the data volume that full node sends, whether data volume is judged more than corresponding first predetermined threshold value of SPV nodes, primarily to really
Whether the data volume of the first Transaction Information that fixed complete node is inquired is more than the data volume that SPV nodes can be received, i.e. number
Whether the first predetermined threshold value is more than, and then determine the need for being adjusted the first matched rule according to amount.
Step S203, deletes to keyword, and is adjusted according to the keyword after deleting and counting bloom filter dynamic
Whole first matched rule, obtains the second matched rule.
In the case where data volume is more than corresponding first predetermined threshold value of SPV nodes, illustrate what complete node was inquired
The maximum of the data volume of the Transaction Information that the data volume of the first Transaction Information can be received more than SPV nodes, may result in portion
Divide Transaction Information be received, and invalid Transaction Information occur and be transmitted, accordingly, it would be desirable to delete to keyword, root
According to the keyword after deleting and counting bloom filter dynamic the first matched rule of adjustment, the second matched rule is obtained, specifically,
The keyword correspondence position of counting bloom filter middle position array can be subtracted 1.
Whether step S204, judge data volume less than corresponding second predetermined threshold value of SPV nodes, if data volume is less than second
Predetermined threshold value, then execution step S205；If data volume is more than the second predetermined threshold value, execution step S208；Wherein, second preset
Threshold value is less than the first predetermined threshold value.
In the case where data volume is less than the first predetermined threshold value, whether the present embodiment can also judge data volume less than SPV
Corresponding second predetermined threshold value of node, the second predetermined threshold value here can be set according to practical experience, define that SPV connects
The minima of the data volume of Transaction Information is received, to avoid the wasting of resources.If data volume is less than the second predetermined threshold value, illustrate according to the
The data volume of inquired the first Transaction Information of one matched rule is too small, can suitably increase data volume, if data volume is more than the
Two predetermined threshold values, and be less than the first predetermined threshold value, then illustrate that the data volume of the first Transaction Information that complete node is inquired is closed
It is suitable, the first Transaction Information can be received.
Step S205, adds new keyword, and according to the keyword after addition and counting bloom filter dynamic adjustment
First matched rule, obtains the second matched rule.
In the case where data volume is less than corresponding second predetermined threshold value of SPV nodes, illustrate what complete node was inquired
The minima of the data volume of the Transaction Information that the data volume of the first Transaction Information can be received less than SPV nodes, may result in money
Source wastes, accordingly, it would be desirable to add new keyword, and according to the keyword after addition and the adjustment of counting bloom filter dynamic the
One matched rule, obtains the second matched rule, specifically, can be by the keyword correspondence of counting bloom filter middle position array
Jia 1 in position.
Step S206, sends the Transaction Information inquiry request for carrying the second matched rule, for complete to complete node
The second Transaction Information that node is matched with the second matched rule according to the inquiry of the second matched rule.
Entering Mobile state adjustment to the first matched rule, after obtaining the second matched rule, SPV nodes will be sent out to complete node
The Transaction Information inquiry request for carrying the second matched rule, complete node is sent to be matched with second according to the inquiry of the second matched rule
The second Transaction Information that rule matches, and the second Transaction Information is sent to into SPV nodes.
Step S207, receives the second Transaction Information that complete node sends.
Step S208, sends Transaction Information to complete node and receives request.
Determining data volume more than the second predetermined threshold value, and less than in the case of the first predetermined threshold value, illustrate to save completely
The data volume of the first inquired Transaction Information of point is suitable, can receive the first Transaction Information.Now, SPV nodes can be to
Node sends Transaction Information and receives request completely, and request receives the first Transaction Information.
Step S209, receives the first Transaction Information that complete node response transaction information receives request and sends.
Completely node first is handed over what match query was arrived after the Transaction Information for receiving the transmission of SPV nodes receives request
Easily information is sent to SPV nodes, and SPV nodes receive the first transaction letter that complete node response transaction information receives request and sends
Breath.
According to the method that the above embodiment of the present invention is provided, by adding or deleting Key Word Adapted counting bloom filter
The keyword correspondence position of bit array, carrys out the first matched rule of dynamic adjustment, it is possible to reduce the transmission of invalid Transaction Information, keeps away
Exempt from SPV nodes because receiving excessive Transaction Information and the defect of overload operation, and without the need for after further according to adding or deleting
Keyword regenerate new matched rule.
Fig. 3 shows the structural representation of Transaction Information inquiry unit according to an embodiment of the invention.The device should
For SPV nodes, as shown in figure 3, the device 300 includes：Sending module 310, receiver module 320, judge module 330, adjustment
Module 340.
Sending module 310, for sending the Transaction Information inquiry request for carrying the first matched rule to complete node, with
For the first Transaction Information that complete node is matched with the first matched rule according to the inquiry of the first matched rule, and count the first friendship
The data volume of easy information.
Receiver module 320, for receiving the data volume that complete node sends.
Whether judge module 330, for judging data volume more than corresponding first predetermined threshold value of SPV nodes.
Adjusting module 340, in the case of in data volume more than the first predetermined threshold value, dynamic adjustment the first matching rule
Then, obtain the second matched rule.
Sending module 310 is further used for：The Transaction Information inquiry for carrying the second matched rule is sent to complete node
Request, for the second Transaction Information that complete node is matched with the second matched rule according to the inquiry of the second matched rule.
Receiver module 320 is further used for：Receive the second Transaction Information that complete node sends.
Alternatively, the first matched rule and the second matched rule are to be generated according to keyword and counting bloom filter.
Wherein, keyword includes block chain account address information.
Alternatively, adjusting module 340 is further used for：In the case where data volume is more than the first predetermined threshold value, to key
Word is deleted, and according to the keyword after deleting and counting bloom filter dynamic the first matched rule of adjustment, obtains second
Matched rule.
Alternatively, judge module 330 is further used for：In the case where data volume is less than the first predetermined threshold value, number is judged
Whether corresponding second predetermined threshold value of SPV nodes is less than according to amount, wherein, the second predetermined threshold value is less than the first predetermined threshold value；
Adjusting module 340 is further used for：In the case where data volume is less than the second predetermined threshold value, dynamic adjustment first
With rule, the second matched rule is obtained.
Alternatively, adjusting module 340 is further used for：The new keyword of addition, and according to the keyword and meter after addition
Number Bloom filter dynamic the first matched rule of adjustment, obtains the second matched rule.
Alternatively, sending module 310 is further used for：The first predetermined threshold value is less than and more than the second default threshold in data volume
In the case of value, Transaction Information is sent to complete node and receive request；
Receiver module 320 is further used for：Receive the first friendship that complete node response transaction information receives request and sends
Easy information.
According to the device that the above embodiment of the present invention is provided, the transaction for carrying the first matched rule is sent to complete node
Information inquiring request, for the first transaction letter that complete node is matched with the first matched rule according to the inquiry of the first matched rule
Breath, and the data volume of the first Transaction Information is counted, the data volume that complete node sends is received, and judges whether data volume is more than
Corresponding first predetermined threshold value of SPV nodes, if data volume is more than the first predetermined threshold value, dynamic the first matched rule of adjustment is obtained
To the second matched rule, the Transaction Information inquiry request for carrying the second matched rule is sent to complete node, for saving completely
The second Transaction Information for o'clock being matched with the second matched rule according to the inquiry of the second matched rule, receive that complete node sends the
Two Transaction Informations, reduce the transmission of invalid Transaction Information, it is to avoid SPV nodes are super negative because receiving excessive Transaction Information
The defect of lotus operation.
Fig. 4 shows the structural representation of Transaction Information inquiry system according to an embodiment of the invention.Such as Fig. 4 institutes
Show, the system 400 includes：Transaction Information inquiry unit 300 and complete node 410.
Algorithm and display be not inherently related to any certain computer, virtual system or miscellaneous equipment provided herein.
Various general-purpose systems can also be used together based on teaching in this.As described above, construct required by this kind of system
Structure be obvious.Additionally, the present invention is also not for any certain programmed language.It is understood that, it is possible to use it is various
Programming language realizes the content of invention described herein, and the description done to language-specific above is to disclose this
Bright preferred forms.
In description mentioned herein, a large amount of details are illustrated.It is to be appreciated, however, that the enforcement of the present invention
Example can be put into practice in the case where not having these details.In some instances, known method, structure is not been shown in detail
And technology, so as not to obscure the understanding of this description.
Similarly, it will be appreciated that in order to simplify the disclosure and help understand one or more in each inventive aspect, exist
Above to, in the description of the exemplary embodiment of the present invention, each feature of the present invention is grouped together into single enforcement sometimes
In example, figure or descriptions thereof.However, should the method for the disclosure be construed to reflect following intention：I.e. required guarantor
The more features of feature is expressly recited in each claim by the application claims ratio of shield.More precisely, such as following
Claims it is reflected as, inventive aspect is less than all features of single embodiment disclosed above.Therefore,
Thus the claims for following specific embodiment are expressly incorporated in the specific embodiment, wherein each claim itself
All as the separate embodiments of the present invention.
Those skilled in the art are appreciated that can be carried out adaptively to the module in the equipment in embodiment
Change and they are arranged in one or more different from embodiment equipment.Can be the module in embodiment or list
Unit or component are combined into a module or unit or component, and can be divided in addition multiple submodule or subelement or
Sub-component.In addition at least some in such feature and/or process or unit is excluded each other, can adopt any
Combination is disclosed to all features disclosed in this specification (including adjoint claim, summary and accompanying drawing) and so to appoint
Where all processes or unit of method or equipment are combined.Unless expressly stated otherwise, this specification (includes adjoint power
Profit is required, summary and accompanying drawing) disclosed in each feature can it is identical by offers, be equal to or the alternative features of similar purpose carry out generation
Replace.
Although additionally, it will be appreciated by those of skill in the art that some embodiments in this include institute in other embodiments
Including some features rather than further feature, but the combination of the feature of different embodiment means in the scope of the present invention
Within and form different embodiments.For example, in the following claims, embodiment required for protection it is any it
One can in any combination mode using.
The present invention all parts embodiment can be realized with hardware, or with one or more processor operation
Software module realize, or with combinations thereof realize.It will be understood by those of skill in the art that can use in practice
Microprocessor or digital signal processor (DSP) are realizing in Transaction Information query facility according to embodiments of the present invention
The some or all functions of a little or whole parts.The present invention is also implemented as performing method as described herein
Some or all equipment or program of device (for example, computer program and computer program).Such realization
The program of the present invention can be stored on a computer-readable medium, or can have the form of one or more signal.This
The signal of sample can be downloaded from internet website and be obtained, or provide on carrier signal, or be carried with any other form
For.
It should be noted that above-described embodiment the present invention will be described rather than limits the invention, and ability
Field technique personnel can design alternative embodiment without departing from the scope of the appended claims.In the claims,
Any reference markss between bracket should not be configured to limitations on claims.Word "comprising" is not excluded the presence of not
Element listed in the claims or step.Word "a" or "an" before element does not exclude the presence of multiple such
Element.The present invention can come real by means of the hardware for including some different elements and by means of properly programmed computer
It is existing.If in the unit claim for listing equipment for drying, several in these devices can be by same hardware branch
To embody.The use of word first, second, and third does not indicate that any order.These words can be explained and be run after fame
Claim.
The invention discloses：
A1, a kind of Transaction Information querying method, it is characterised in that methods described is applied to SPV nodes, including：
The Transaction Information inquiry request for carrying the first matched rule is sent to complete node, for the complete node root
According to the first Transaction Information that first matched rule inquiry is matched with first matched rule, and count first friendship
The data volume of easy information；
The data volume that the complete node sends is received, and judges the data volume whether more than SPV nodes correspondence
The first predetermined threshold value；
If the data volume is more than first predetermined threshold value, dynamic adjustment first matched rule obtains second
Matched rule；
The Transaction Information inquiry request for carrying second matched rule is sent to the complete node, for described complete
The second Transaction Information that full node is matched with second matched rule according to second matched rule inquiry；
Receive the second Transaction Information that the complete node sends.
A2, the method according to A1, it is characterised in that first matched rule and the second matched rule are according to pass
What key word and counting bloom filter were generated.
A3, the method according to A2, it is characterised in that the keyword includes block chain account address information.
A4, the method according to A2 or A3, it is characterised in that if the data volume is more than first predetermined threshold value,
The dynamic adjusts first matched rule, obtains the second matched rule and further includes：
The keyword is deleted, and described in the keyword and counting bloom filter dynamic adjustment after delete
First matched rule, obtains the second matched rule.
A5, the method according to A2 or A3, it is characterised in that if the data volume is less than first predetermined threshold value,
Methods described also includes：Whether the data volume is judged less than corresponding second predetermined threshold value of the SPV nodes, it is wherein, described
Second predetermined threshold value is less than first predetermined threshold value；
If the data volume is less than second predetermined threshold value, dynamic adjustment first matched rule obtains second
Matched rule.
A6, the method according to A5, it is characterised in that the dynamic adjusts first matched rule, obtains second
Matched rule is further included：
The new keyword of addition, and it is described first according to the keyword after addition and counting bloom filter dynamic adjustment
With rule, the second matched rule is obtained.
A7, the method according to A5, it is characterised in that if the data volume is less than first predetermined threshold value and is more than
Second predetermined threshold value, methods described also include：Transaction Information is sent to the complete node and receives request, and receive described
Node responds the first Transaction Information that the Transaction Information receives request and sends completely.
B8, a kind of Transaction Information inquiry unit, it is characterised in that described device is applied to SPV nodes, including：
Sending module, for sending the Transaction Information inquiry request for carrying the first matched rule to complete node, for
The first Transaction Information that the complete node is matched with first matched rule according to first matched rule inquiry, and
Count the data volume of first Transaction Information；
Receiver module, for receiving the data volume that the complete node sends；
Whether judge module, for judging the data volume more than corresponding first predetermined threshold value of the SPV nodes；
Adjusting module, in the data volume more than in the case of first predetermined threshold value, dynamic adjustment described the
One matched rule, obtains the second matched rule；
The sending module is further used for：The transaction for carrying second matched rule is sent to the complete node
Information inquiring request, so that the complete node is matched with second matched rule according to second matched rule inquiry
The second Transaction Information；
The receiver module is further used for：Receive the second Transaction Information that the complete node sends.
B9, the device according to B8, it is characterised in that first matched rule and the second matched rule are according to pass
What key word and counting bloom filter were generated.
B10, the device according to B9, it is characterised in that the keyword includes block chain account address information.
B11, the device according to B9 or B10, it is characterised in that the adjusting module is further used for：In the number
According to amount more than in the case of first predetermined threshold value, the keyword is deleted, and according to the keyword after deleting and
Counting bloom filter dynamic adjustment first matched rule, obtains the second matched rule.
B12, the device according to B9 or B10, it is characterised in that the judge module is further used for：In the number
In the case of first predetermined threshold value is less than according to amount, judge the data volume whether less than the SPV nodes corresponding second
Predetermined threshold value, wherein, second predetermined threshold value is less than first predetermined threshold value；
The adjusting module is further used for：In the case where the data volume is less than second predetermined threshold value, dynamic
First matched rule is adjusted, the second matched rule is obtained.
B13, the device according to B12, it is characterised in that the adjusting module is further used for：The new key of addition
Word, and according to the keyword after addition and counting bloom filter dynamic adjustment first matched rule, obtain the second matching
Rule.
B14, the device according to B12, it is characterised in that the sending module is further used for：In the data volume
Less than first predetermined threshold value and more than in the case of second predetermined threshold value, Transaction Information is sent to the complete node
Receive request；
The receiver module is further used for：Receive the complete node to respond the Transaction Information reception request and send
The first Transaction Information.
C15, a kind of Transaction Information inquiry system, it is characterised in that the system includes：Friendship described in any one of B8-B14
Easy information query device and complete node.
Claims (10)
1. a kind of Transaction Information querying method, it is characterised in that methods described is applied to SPV nodes, including：
The Transaction Information inquiry request for carrying the first matched rule is sent to complete node, so that the complete node is according to institute
The first Transaction Information that the inquiry of the first matched rule is matched with first matched rule is stated, and counts the first transaction letter
The data volume of breath；
Receive the data volume that the complete node sends, and judge the data volume whether corresponding more than the SPV nodes the
One predetermined threshold value；
If the data volume is more than first predetermined threshold value, dynamic adjustment first matched rule obtains the second matching
Rule；
The Transaction Information inquiry request for carrying second matched rule is sent to the complete node, is saved for described completely
The second Transaction Information that point is matched with second matched rule according to second matched rule inquiry；
Receive the second Transaction Information that the complete node sends.
2. method according to claim 1, it is characterised in that according to first matched rule and the second matched rule
What keyword and counting bloom filter were generated.
3. method according to claim 2, it is characterised in that the keyword includes block chain account address information.
4. according to the method in claim 2 or 3, it is characterised in that if the data volume is more than first predetermined threshold value,
The dynamic adjusts first matched rule, obtains the second matched rule and further includes：
The keyword is deleted, and according to the keyword after deleting and counting bloom filter dynamic adjustment described first
Matched rule, obtains the second matched rule.
5. according to the method in claim 2 or 3, it is characterised in that if the data volume is less than first predetermined threshold value,
Methods described also includes：Whether the data volume is judged less than corresponding second predetermined threshold value of the SPV nodes, it is wherein, described
Second predetermined threshold value is less than first predetermined threshold value；
If the data volume is less than second predetermined threshold value, dynamic adjustment first matched rule obtains the second matching
Rule.
6. method according to claim 5, it is characterised in that the dynamic adjustment first matched rule, obtains the
Two matched rules are further included：
The new keyword of addition, and according to the keyword after addition and counting bloom filter dynamic adjustment the first matching rule
Then, obtain the second matched rule.
7. method according to claim 5, it is characterised in that if the data volume is less than first predetermined threshold value and big
In second predetermined threshold value, methods described also includes：Transaction Information is sent to the complete node and receives request, and receive institute
State complete node and respond the first Transaction Information that the Transaction Information receives request and sends.
8. a kind of Transaction Information inquiry unit, it is characterised in that described device is applied to SPV nodes, including：
Sending module, for sending the Transaction Information inquiry request for carrying the first matched rule to complete node, for described
The first Transaction Information that node is matched with first matched rule according to first matched rule inquiry completely, and count
The data volume of first Transaction Information；
Receiver module, for receiving the data volume that the complete node sends；
Whether judge module, for judging the data volume more than corresponding first predetermined threshold value of the SPV nodes；
Adjusting module, in the case of in the data volume more than first predetermined threshold value, dynamic adjustment is described first
With rule, the second matched rule is obtained；
The sending module is further used for：The Transaction Information for carrying second matched rule is sent to the complete node
Inquiry request, so that the complete node is inquired about according to second matched rule and second matched rule matches the
Two Transaction Informations；
The receiver module is further used for：Receive the second Transaction Information that the complete node sends.
9. device according to claim 8, it is characterised in that according to first matched rule and the second matched rule
What keyword and counting bloom filter were generated.
10. a kind of Transaction Information inquiry system, it is characterised in that the system includes：Transaction letter described in claim 8 or 9
Breath inquiry unit and complete node.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610969683.0A CN106528746B (en) | 2016-10-26 | 2016-10-26 | Transaction Information querying method, apparatus and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610969683.0A CN106528746B (en) | 2016-10-26 | 2016-10-26 | Transaction Information querying method, apparatus and system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106528746A true CN106528746A (en) | 2017-03-22 |
| CN106528746B CN106528746B (en) | 2019-07-16 |
Family
ID=58325868
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610969683.0A Active CN106528746B (en) | 2016-10-26 | 2016-10-26 | Transaction Information querying method, apparatus and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106528746B (en) |
Cited By (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108304475A (en) * | 2017-12-28 | 2018-07-20 | 北京比特大陆科技有限公司 | Data query method, apparatus and electronic equipment |
| CN108681900A (en) * | 2018-07-18 | 2018-10-19 | 众安信息技术服务有限公司 | The method of light node verification transaction |
| CN109063109A (en) * | 2018-07-27 | 2018-12-21 | 电子科技大学 | A kind of data query system based on ether mill |
| CN109101664A (en) * | 2018-09-18 | 2018-12-28 | 百度在线网络技术（北京）有限公司 | A kind of data transmission method, device, equipment and the medium of lightweight node |
| CN109194669A (en) * | 2018-09-18 | 2019-01-11 | 百度在线网络技术（北京）有限公司 | A kind of data transmission method, device, equipment and the medium of lightweight node |
| CN109189859A (en) * | 2018-09-20 | 2019-01-11 | 百度在线网络技术（北京）有限公司 | Node initializing method and apparatus in block chain network |
| CN109255709A (en) * | 2018-09-05 | 2019-01-22 | 深圳正品创想科技有限公司 | A kind of accounting method and its system based on block chain |
| CN109447630A (en) * | 2018-09-10 | 2019-03-08 | 北京安易信科技有限公司 | A kind of block chain building method and system for supporting conglomerate more to apply |
| CN110138566A (en) * | 2019-05-14 | 2019-08-16 | 数字钱包（北京）科技有限公司 | Verification method, device, electronic equipment and computer readable storage medium |
| JP2020510330A (en) * | 2017-07-14 | 2020-04-02 | アリババ・グループ・ホールディング・リミテッドＡｌｉｂａｂａ Ｇｒｏｕｐ Ｈｏｌｄｉｎｇ Ｌｉｍｉｔｅｄ | Blockchain-based data processing method and device |
| TWI698108B (en) * | 2018-06-29 | 2020-07-01 | 香港商阿里巴巴集團服務有限公司 | Blockchain-based data processing method and device |
| CN112241888A (en) * | 2019-07-19 | 2021-01-19 | 傲为信息技术(江苏)有限公司 | Public link-based address management system |
| US11893139B2 (en) | 2019-01-09 | 2024-02-06 | Tencent Technology (Shenzhen) Company Limited | Method for displaying blockchain data, blockchain browser, user node, and medium |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20150262176A1 (en) * | 2014-03-17 | 2015-09-17 | Coinbase, Inc. | Hot wallet for holding bitcoin |
| CN105488665A (en) * | 2015-11-25 | 2016-04-13 | 布比（北京）网络技术有限公司 | Decentralized transaction method |
| CN105719185A (en) * | 2016-01-22 | 2016-06-29 | 杭州复杂美科技有限公司 | Block chain data comparison and consensus method |
-
2016
- 2016-10-26 CN CN201610969683.0A patent/CN106528746B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20150262176A1 (en) * | 2014-03-17 | 2015-09-17 | Coinbase, Inc. | Hot wallet for holding bitcoin |
| CN105488665A (en) * | 2015-11-25 | 2016-04-13 | 布比（北京）网络技术有限公司 | Decentralized transaction method |
| CN105719185A (en) * | 2016-01-22 | 2016-06-29 | 杭州复杂美科技有限公司 | Block chain data comparison and consensus method |
Non-Patent Citations (1)
| Title |
|---|
| ANTCHAIN.COM: "SPV、SPV节点和SPV钱包", 《HTTPS://BLOG.CSDN.NET/A_LITTLE_E/ARTICLE/DETAILS/45336555》 * |
Cited By (21)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2020510330A (en) * | 2017-07-14 | 2020-04-02 | アリババ・グループ・ホールディング・リミテッドＡｌｉｂａｂａ Ｇｒｏｕｐ Ｈｏｌｄｉｎｇ Ｌｉｍｉｔｅｄ | Blockchain-based data processing method and device |
| US11947564B2 (en) | 2017-07-14 | 2024-04-02 | Advanced New Technologies Co., Ltd. | Blockchain-based data processing method and device |
| US11269916B2 (en) | 2017-07-14 | 2022-03-08 | Advanced New Technologies Co., Ltd. | Blockchain-based data processing method and device |
| CN108304475A (en) * | 2017-12-28 | 2018-07-20 | 北京比特大陆科技有限公司 | Data query method, apparatus and electronic equipment |
| CN108304475B (en) * | 2017-12-28 | 2020-11-10 | 比特大陆科技有限公司 | Data query method and device and electronic equipment |
| US10949447B2 (en) | 2018-06-29 | 2021-03-16 | Advanced New Technologies Co., Ltd. | Blockchain-based data synchronizing and data block parsing method and device |
| TWI698108B (en) * | 2018-06-29 | 2020-07-01 | 香港商阿里巴巴集團服務有限公司 | Blockchain-based data processing method and device |
| CN108681900A (en) * | 2018-07-18 | 2018-10-19 | 众安信息技术服务有限公司 | The method of light node verification transaction |
| CN109063109A (en) * | 2018-07-27 | 2018-12-21 | 电子科技大学 | A kind of data query system based on ether mill |
| CN109255709A (en) * | 2018-09-05 | 2019-01-22 | 深圳正品创想科技有限公司 | A kind of accounting method and its system based on block chain |
| CN109447630A (en) * | 2018-09-10 | 2019-03-08 | 北京安易信科技有限公司 | A kind of block chain building method and system for supporting conglomerate more to apply |
| CN109101664A (en) * | 2018-09-18 | 2018-12-28 | 百度在线网络技术（北京）有限公司 | A kind of data transmission method, device, equipment and the medium of lightweight node |
| CN109194669A (en) * | 2018-09-18 | 2019-01-11 | 百度在线网络技术（北京）有限公司 | A kind of data transmission method, device, equipment and the medium of lightweight node |
| CN109194669B (en) * | 2018-09-18 | 2023-09-15 | 百度在线网络技术（北京）有限公司 | Data transmission method, device, equipment and medium of lightweight node |
| CN109189859B (en) * | 2018-09-20 | 2020-10-16 | 百度在线网络技术（北京）有限公司 | Node initialization method and device in block chain network |
| CN109189859A (en) * | 2018-09-20 | 2019-01-11 | 百度在线网络技术（北京）有限公司 | Node initializing method and apparatus in block chain network |
| US11893139B2 (en) | 2019-01-09 | 2024-02-06 | Tencent Technology (Shenzhen) Company Limited | Method for displaying blockchain data, blockchain browser, user node, and medium |
| CN110138566A (en) * | 2019-05-14 | 2019-08-16 | 数字钱包（北京）科技有限公司 | Verification method, device, electronic equipment and computer readable storage medium |
| CN112241888A (en) * | 2019-07-19 | 2021-01-19 | 傲为信息技术(江苏)有限公司 | Public link-based address management system |
| WO2021012811A1 (en) * | 2019-07-19 | 2021-01-28 | 南京瑞祥信息技术有限公司 | Public chain-based address management system |
| CN112241888B (en) * | 2019-07-19 | 2024-03-26 | 傲为有限公司 | Address management system based on public chain |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106528746B (en) | 2019-07-16 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106528746A (en) | Trade information inquiring method, device and system | |
| CN107368259B (en) | Method and device for writing service data into block chain system | |
| KR102175226B1 (en) | Methods and devices for controlling data risk | |
| US20180365688A1 (en) | Transaction execution and validation in a blockchain | |
| CN109614262B (en) | Service checking method, device and computer readable storage medium | |
| CN113487427B (en) | Transaction risk identification method, device and system | |
| CN109299222A (en) | Verification of data method and device | |
| CN107135188A (en) | The service implementation method of financial information exchange FIX agreements, apparatus and system | |
| CN109583861B (en) | Data compression method, access method and system in key-value database | |
| CN105095367A (en) | Method and device for acquiring client data | |
| CN114997990A (en) | Distributed account checking method, device and system | |
| KR20210106013A (en) | Preventing transmission of incorrect copies of data records to distributed ledger systems | |
| JP6721724B2 (en) | Methods and devices that facilitate the expansion of payment entities | |
| CN107547248A (en) | A kind of business collocation method, device and controller and electronic equipment | |
| CN116542668A (en) | Block chain-based data processing method, equipment and readable storage medium | |
| CN113835780A (en) | Event response method and device | |
| CN107145529A (en) | A kind of data processing method and device | |
| WO2021079854A1 (en) | Device, method, and program for calculating contamination level of address of encryption asset | |
| CN111681005A (en) | Data interaction method and device and electronic equipment | |
| CN113342275B (en) | Method, apparatus and computer readable storage medium for accessing data at block link points | |
| US20230195799A1 (en) | Systems and methods of programmatic control of scaling read requests to a database system | |
| CN114661772B (en) | Data processing method and related device | |
| CN108961039A (en) | Transaction processing method, apparatus and system | |
| CN113222735B (en) | Transaction associated information query method and related device | |
| JP2021069103A (en) | Apparatus, method and program for calculating pollution degree of address of crypto-assets |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| CB02 | Change of applicant information |
Address after: Room 3F301, C2 Building, 2.5 Industrial Park, No. 88 Dongchang Road, Suzhou Industrial Park, Jiangsu Province, 215000 Applicant after: JIANGSU PAYEGIS TECHNOLOGY CO., LTD. Address before: A street in Suzhou City, Jiangsu Province Industrial Park No. 388 innovation park off No. 6 Building 5 floor Applicant before: JIANGSU PAYEGIS TECHNOLOGY CO., LTD. |
|
| CB02 | Change of applicant information | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |