CN208781225U - A kind of block chain spatiotemporal data warehouse system and electronic equipment - Google Patents
A kind of block chain spatiotemporal data warehouse system and electronic equipment Download PDFInfo
- Publication number
- CN208781225U CN208781225U CN201821106014.1U CN201821106014U CN208781225U CN 208781225 U CN208781225 U CN 208781225U CN 201821106014 U CN201821106014 U CN 201821106014U CN 208781225 U CN208781225 U CN 208781225U
- Authority
- CN
- China
- Prior art keywords
- block chain
- block
- module
- data
- tree
- 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.)
- Active
Links
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
This application involves a kind of block chain spatiotemporal data warehouse system and electronic equipments.It include: the block chain module for memory block data, the Data insertion module with block chain module electric connection；The time range search module being electrically connected with the block chain module；The spatial dimension search module being electrically connected by the time range search module and the block chain module；Wherein, the topological structure G of directed acyclic graph is set as two parts node collection V and side collection E in the block chain module.The inquiry system structure of the application can accomplish that being rapidly returned in block chain for " online " meets to the result of provisioning request.
Description
Technical field
The application belongs to internet database technical field, in particular to a kind of block chain spatiotemporal data warehouse system and electricity
Sub- equipment.
Background technique
Block chain technology, also referred to as distributed account book technology, is a kind of internet database technology, is distributed data
The new application mode of the computer technologies such as storage, point-to-point transmission, common recognition mechanism, Encryption Algorithm.Block chain is with bit
One kind for becoming increasingly popular and gradually rising of the digital encryptions currency such as coin completely new decentralization architecture and distributed computing
Normal form.Due to block chain have many advantages, such as decentralization, time series data, collective maintenance, it is secure and trusted, in recent years, it is wide
It is applied in the industries such as finance, medical treatment, education generally, the more application scenarios of block chain are also being explored by industry and academia.
As the rise of block chain technology excites the generation of a large amount of new opplications in the various fields including Temporal-spatial data management, example
Such as, consider the supply chain scene for tracking article during transportation.It requires not only to need to constantly update space-time letter in transportational process
Breath, should also support the quick search of space-time data, such as be listed in all data that the t time is located at l, or the time from t1 to t2
All data in section at l.But current block chain technology can not efficiently respond the inquiry of space-time data, and needle
It attracts attention always in the database to the efficient inquiry research of space-time data, if efficient space-time data can be carried out on block chain
Inquiry, will be with a wide range of applications.
Block chain carries out Hash to the Transaction Information in block using Merkle tree, wherein each block includes build and block
Body, the effect of build are to be linked to the block of front to provide integrality for block chain, and block body then includes authenticated block creation process
In data record.When needing to inquire the data in block chain, the Transaction Information of current block can be inquired by block body,
The previous block of current block in block chain can be found by build.Currently, to number under certain data pattern in block chain
According to inquiry, need since the block being newly joined on block chain, first inquire the Transaction Information in the block block body, then pass through block
Head, which traces back in previous block, to be inquired, and so on, traverse the Transaction Information of whole block chain.
It does not support 1), efficiently to manage space-time data in conclusion existing block chain technology suffers a disadvantage in that
Reason, the efficient inquiry including effectively being stored to space-time data and to space-time data；2), inquiry of the current block chain to data,
It needs since the block being newly joined on block chain, one area of such a block of previous block is traced back to by its build
Block inquire, and under worst case, has inquired the data for needing to facilitate whole block chain, it is clear that such inquiry is very low
Effect and time-consuming, are not appropriate for quick search；3), current block chain data query response method is not appropriate for the space-time frequently changed
The inquiry of data；4), for spatial data also without some indexes to accelerate whole process；5), in block catenary system
Establish index for these multidimensional datas of space-time data and generally require be more than one it is complicated index, it is not only very complicated in this way but also
Expense can be larger.
Summary of the invention
This application provides a kind of block chain spatiotemporal data warehouse system and electronic equipments, it is intended at least to a certain extent
Solve one of above-mentioned technical problem in the prior art.
To solve the above-mentioned problems, this application provides following technical solutions:
A kind of block chain spatiotemporal data warehouse system, comprising:
Block chain module: memory block data are used for；
Data insertion module: it is electrically connected with the block chain module；
Time range search module: it is electrically connected with the block chain module；
Spatial dimension search module: it is electrically connected by the time range search module and the block chain module；
Wherein, the topological structure G of directed acyclic graph is set as two portions node collection V and side collection E in the block chain module
Point.
Preferably, time metamessage is set in each block build in the block chain module；
The topological structure G has multiple source node s for each v ∈ V.
Preferably, the tree index knot that the root node information in the block build is combined based on Merkle tree with kd tree
Structure；The root node is connect with the root node of the root node of right subtree, left subtree respectively.
In order to solve the above-mentioned technical problem, the embodiment of the present application also provides a kind of electronic equipment, comprising: at least one processing
Device；And the memory being connect at least one described processor communication；Wherein,
It is provided with block chain module as described above in the memory storage, the processor is provided with as described above
Data insertion module, time range search module and spatial dimension search module.
Compared with the existing technology, the beneficial effect that the embodiment of the present application generates is: when the block chain of the embodiment of the present application
Empty data query system and electronic equipment with kd tree by combining Merkle tree to form new tree index in directed acyclic
Space-time data on graph structure in memory block catenary system is based on this, and screening meets the area of time range in directed acyclic graph
Block, and inquiry meets the data of spatial dimension in the block after screening.Compared with the existing technology, the advantage of the embodiment of the present application
It is:
1, the application from the storage organization of block chain be adjusted to all be to the corresponding module that block chain module is inquired
For space-time data design, application scenarios of the block chain on Temporal-spatial data management can be met；
2, the application in each block head by being added specific time metamessage, for recording space-time data in the block
Time interval, the block for meeting the limitation can be quickly found out by given time restriction when queried, according to Merkle
The index that combines with kd tree is set, can navigate to corresponding data in block, each inquiry response is all in the prior art for improvement
Each block is needed to be traversed for, and reads the very inefficient deficiency of the data in each block；
3, the deficiency for being difficult to set up non-complex index structure to multidimensional data in block catenary system is improved, for spatial data
The tree index structure that Merkle tree combines with kd tree is established, and the key assignments obtained by the tree index can position rapidly
To initial data；
4, it is applied to the scene of frequent updating for space-time data, the data structure in the application block chain module uses more
The verification time of verification time faster directed acyclic graph structures (DAG), the structure is better than chain structure.
Detailed description of the invention
Fig. 1 is the structural schematic diagram of the block chain spatiotemporal data warehouse system of the embodiment of the present application；
Fig. 2 is the hardware device structural schematic diagram of the block chain spatiotemporal data warehouse system of the embodiment of the present application；
Fig. 3 is the directed acyclic graph of the embodiment of the present application；
Fig. 4 is that the embodiment of the present application is that the response exemplary diagram of space-time unique inquiry is carried out on directed acyclic graph；
The flow chart of the block chain spatiotemporal data warehouse system of Fig. 5 the embodiment of the present application；
Fig. 6 is the flow chart of the time range search of the embodiment of the present application；
Fig. 7 is the flow chart of spatial dimension search provided by the embodiments of the present application.
Specific embodiment
It is with reference to the accompanying drawings and embodiments, right in order to which the objects, technical solutions and advantages of the application are more clearly understood
The application is further elaborated.It should be appreciated that specific embodiment described herein is only to explain the application, not
For limiting the application.
Referring to Fig. 1, being the block schematic illustration of the block chain spatiotemporal data warehouse system of the embodiment of the present application.The application's
Block chain spatiotemporal data warehouse system, comprising: be electrically connected for the block chain module of memory block data, with block chain module
Data insertion module；The time range search module being electrically connected with block chain module；By time range search module with
The spatial dimension search module that block chain module is electrically connected；Wherein, the topological structure G of directed acyclic graph is set in block chain module
It is set to two parts node collection V and side collection E.
Preferably, time metamessage is set in each block build in block chain module in order to time range search module
Retrieval；
As shown in Fig. 3, for each v ∈ V, (the node v) for belonging to node collection V has multiple source node s to topological structure G.
Source node s is the node that in-degree is 0 in directed acyclic graph.For each node v in topological structure G, they are rear
Continuous node verification, and subsequent node is verified by more subsequent node.And so on, it is known that it is newly joined topological knot
The block node of structure G is that no subsequent node verifies them, so they are source node s to be verified.Utilize source
Node s can trace the node that the front had verified that, can facilitate the topological structure G progress time to entire directed acyclic graph
It goes through.
Preferably, the tree index structure that the root node information in block build is combined based on Merkle tree with kd tree；
Root node is connect with the root node of the root node of right subtree, left subtree respectively.
Specifically, Data insertion module: being also used in block chain block renewal process, by the space-time in block catenary system
In the tree index structure that data insertion is combined based on Merkle tree with kd tree, and it is stored in block chain module；Meanwhile it is right
Each block in block chain module introduces time metamessage in build；In the embodiment of the present application, space-time data is in block
The tree index structure combined based on Merkle tree with kd tree is used in structure in chain.Wherein, Merkle tree is to be used for
The tree construction of cryptographic Hash is stored, leaf is the cryptographic Hash of data, and non-leaf nodes is that it corresponds to child node series strings
Cryptographic Hash.And kd tree is a kind of binary tree for multidimensional theorem in Euclid space segmentation construction, is also represented to k dimension data collection
A division for closing the k dimension space constituted, i.e., the hypermatrix of the corresponding k dimension of each node in tree.In conjunction with the two, that is, kd burl
Data in point carry out Hash processing according to Merkle tree rule.Merkle Patricia-trie is then used to store space-time data
Key-value pair, the key assignments convenient for being obtained by tree index structure navigates to rapidly initial data.For adding in each block head
The time metamessage entered can pass through the given time for recording the time interval of space-time data in the block when queried
Range is quickly found out the block for meeting the time range, can be with according to the tree index structure that Merkle tree combines with kd tree
Navigate to corresponding data in block.
Time range search module: being also used to during spatiotemporal data warehouse, gives the corresponding time model of space-time data
It encloses and spatial dimension, utilizes time metamessage the opening up at directed acyclic graph (DAG) in each block build in block chain module
It flutters in structure G (V, E) and searches out the block for meeting time range；In the embodiment of the present application, in block chain technology, selects and need
Verification time shorter directed acyclic graph (DAG), it can improve the efficiency of block chain, so that block can be gone out in network parallel, and
And it is smaller the time required to verifying.In DAG network, every transaction is identified, need to be linked in a network it is existing simultaneously
And link confirmation is done in newer transaction, the width of such network keeps within a certain range, new transaction capable of being allowed to have comparatively fast
Acknowledging time.
In order to realize rapid time search on DAG, it includes time metamessage in each build that the application, which introduces,.
Given time range beta searches out the block of the condition of satisfaction on DAG topological structure G (V, E) according to β first.As shown in Fig. 3,
Topological structure G has multiple source node s (node to be verified in directed acyclic graph is newly added) for each v ∈ V, by source
Node starts to query, and considers inquiry later the nearest front nodal of retrospect current point.To the block of each directed acyclic graph
Temporally range searching is with breadth-first algorithm (BFS) realization.Specifically, the time range searcher of time range search module
Formula are as follows: given time range beta=(time started, the end time) is worked as using what GetRobustAccepted (G) function returned
Preceding newest verifying block, thus bring into operation BFS；In the implementation procedure of BFS, if the time metamessage in block build
In given time range β, that is,
Then the block is put into result set；When searching block outside time range β or in all next block builds
Between metamessage end time be respectively less than β at the beginning of, then terminate operation BFS.
Spatial dimension search module: be also used to read in each block build for meeting time range based on Merkle
The root node information for setting the tree index structure combined with kd tree, then accesses entire Merkle tree and kd tree phase from top to bottom
In conjunction with tree index structure, search out the key data met in spatial dimension, pass through Merkle further according to key data
Patricia-trie technology obtains corresponding original space-time data；The application proposes efficient block chain query for space-time data
Response method makes it to support such as " all data in the region l in the s period " inquiry.
Further, the spatial dimension way of search of spatial dimension search module are as follows: searched in time range search module
After the root node of the tree index structure combined based on Merkle tree with kd tree, Cong Genjie are obtained from the build of block
Point starts down always to be compared given spatial dimension with tree node along a simple path；If given spatial dimension
Bigger than tree node, then path enters the right subtree of tree, if given spatial dimension is smaller than tree node, path enters the left son of tree
Tree returns until the hypermatrix for meeting spatial dimension is accessed, and by the data in hypermatrix；For the data of return,
Because being cryptographic Hash, need to find the root section of the key-value pair index based on Merkle Patricia-trie technology in build
Point；According to the key-value pair index based on Merkle Patricia-trie technology, cryptographic Hash data are converted into original space-time number
According to, and return to original space-time data.
The application, which is tested, establishes a dedicated test network on the tangle (being based on directed acyclic graph) of iota, and
It is tested using the space-time data on Pokemon Go, it is found that in test network, user is proposed using the application
Method is capable of the qualified space-time data that inquires of " online ", and query responding time is quickly.For inquiry mode,
Experiment uses a variety of mainstream inquiry modes: knn inquiry, ball-point inquiry, range inquiry and bounded knn inquiry,
Obtained result is in response to speed and meets " online " inquiry.
Fig. 2 is the hardware device structural schematic diagram of block chain spatiotemporal data warehouse system provided by the embodiments of the present application.Such as
Shown in Fig. 7, which includes one or more processors and memory.It takes a processor as an example, which can also wrap
It includes: input system and output system.
Processor, memory, input system and output system can be connected by bus or other modes, in Fig. 2 with
For being connected by bus.
Memory as a kind of non-transient computer readable storage medium, can be used for storing non-transient software program, it is non-temporarily
State computer executable program and module.Processor passes through operation non-transient software program stored in memory, instruction
And module realizes the place of above method embodiment thereby executing the various function application and data processing of electronic equipment
Reason method.
Memory may include storing program area and storage data area, wherein storing program area can storage program area, extremely
Application program required for a few function；It storage data area can storing data etc..In addition, memory may include that high speed is random
Memory is accessed, can also include non-transient memory, a for example, at least disk memory, flush memory device or other are non-
Transient state solid-state memory.In some embodiments, it includes the memory remotely located relative to processor that memory is optional, this
A little remote memories can pass through network connection to processing system.The example of above-mentioned network includes but is not limited to internet, enterprise
Intranet, local area network, mobile radio communication and combinations thereof.
Input system can receive the number or character information of input, and generate signal input.Output system may include showing
Display screen etc. shows equipment.
One or more of module storages in the memory, are executed when by one or more of processors
When, execute the following operation of any of the above-described embodiment of the method:
Step a: the space-time data in block catenary system is inserted into the tree index combined based on Merkle tree with kd tree
In structure, and it is stored in block chain module；For each block in the block chain module, tempon is introduced in build
Information；
Step b: the given corresponding time range of space-time data and spatial dimension utilize each area in the block chain module
Time metamessage in block build searches out the block for meeting the time range in the topological structure G of directed acyclic graph；
Step c: meet combining based on the Merkle tree with kd tree in the block build of time range described in reading
Tree index structure root node information, search out the key data for meeting the spatial dimension, obtained further according to the key data
To corresponding space-time data.
Method provided by the embodiment of the present application can be performed in the said goods, has the corresponding functional module of execution method and has
Beneficial effect.The not technical detail of detailed description in the present embodiment, reference can be made to method provided by the embodiments of the present application.
The embodiment of the present application provides a kind of non-transient (non-volatile) computer storage medium, and the computer storage is situated between
Matter is stored with computer executable instructions, the executable following operation of the computer executable instructions:
Step a: the space-time data in block catenary system is inserted into the tree index combined based on Merkle tree with kd tree
In structure, and it is stored in block chain module；For each block in the block chain module, tempon is introduced in build
Information；
Step b: the given corresponding time range of space-time data and spatial dimension utilize each area in the block chain module
Time metamessage in block build searches out the block for meeting the time range in the topological structure G of directed acyclic graph；
Step c: meet combining based on the Merkle tree with kd tree in the block build of time range described in reading
Tree index structure root node information, search out the key data for meeting the spatial dimension, obtained further according to the key data
To corresponding space-time data.
The embodiment of the present application provides a kind of computer program product, and the computer program product is non-temporary including being stored in
Computer program on state computer readable storage medium, the computer program include program instruction, when described program instructs
When being computer-executed, the computer is made to execute following operation:
Step a: the space-time data in block catenary system is inserted into the tree index combined based on Merkle tree with kd tree
In structure, and it is stored in block chain module；For each block in the block chain module, tempon is introduced in build
Information；
Step b: the given corresponding time range of space-time data and spatial dimension utilize each area in the block chain module
Time metamessage in block build searches out the block for meeting the time range in the topological structure G of directed acyclic graph；
Step c: meet combining based on the Merkle tree with kd tree in the block build of time range described in reading
Tree index structure root node information, search out the key data for meeting the spatial dimension, obtained further according to the key data
To corresponding space-time data.
Referring to Fig. 5, being the flow chart of the block chain spatiotemporal data warehouse system of the embodiment of the present application.The embodiment of the present application
Block chain spatiotemporal data warehouse system the following steps are included:
Step 100: in block chain block renewal process, the space-time data insertion in block catenary system being based on Merkle
It sets in the tree index structure combined with kd tree, and is stored in block chain module；Meanwhile for every in block chain module
A block introduces time metamessage in build；
In step 100, for space-time data in the structure in block chain, the application, which uses, is based on Merkle tree and kd tree phase
In conjunction with tree index structure.Wherein, Merkle tree is the tree construction for storing cryptographic Hash, and leaf is the Hash of data
Value, and non-leaf nodes is its cryptographic Hash for corresponding to child node series strings.And kd tree is one kind for multidimensional theorem in Euclid space
The binary tree for dividing construction also represents a division of the k dimension space constituted to k dimension data set, i.e. each section in tree
The hypermatrix of the corresponding k dimension of point.Hash processing is carried out according to Merkle tree rule in conjunction with the data in the two, that is, kd tree node.
Merkle Patricia-trie then is used to store the key-value pair of space-time data, convenient for the key obtained by tree index structure
Value navigates to rapidly initial data.For the time metamessage being added in each block head, for recording space-time number in the block
According to time interval, the block for meeting the time range can be quickly found out by given time range when queried, according to
The tree index structure that Merkle tree combines with kd tree can navigate to corresponding data in block.
Step 200: during spatiotemporal data warehouse, giving the corresponding time range of space-time data and spatial dimension, benefit
With the time metamessage in block build each in block chain module in the topological structure G (V, E) of directed acyclic graph (DAG)
Search out the block for meeting time range；Wherein, the node of topological structure G integrates as V, and the side of topological structure G integrates as E.
In step 200, in block chain technology, the application selects the directed acyclic graph (DAG) for needing the verification time shorter,
It can improve the efficiency of block chain, so that can go out block in network parallel, and it is smaller to verify required time.In DAG network,
Every transaction is identified, has been needed to be linked to existing and newer transaction in a network and has been done link confirmation, such net
The width of network keeps within a certain range, new transaction capable of being allowed to have faster acknowledging time.Directed acyclic graph is as shown in Figure 3.
In order to realize rapid time search on DAG, it includes time metamessage in each build that the application, which introduces,.
Given time range beta searches out the block of the condition of satisfaction on DAG topological structure G (V, E) according to β first.As shown in Fig. 3,
Topological structure G has multiple source node s for each v ∈ V, and (i.e. source node s is new is added in directed acyclic graph topological structure G
Node to be verified) started to query by source node, to later inquiry consider retrospect current point nearest front nodal.To each
The block of directed acyclic graph temporally realized with breadth-first algorithm (BFS) by range searching.
It is the flow chart of the time range search of the embodiment of the present application referring specifically to Fig. 6.The step of time range is searched for
Include:
Step 201: given time range beta=(time started, the end time), utilizing GetRobustAccepted (G)
The current newest verifying block that function returns, thus bring into operation BFS；
Step 202: in the implementation procedure of BFS, if the time metamessage in block build is in given time range β
It is interior, that is, Then
The block is put into result set；
Step 203: when searching time metamessage of the block outside time range β or in all next block builds
End time be respectively less than β at the beginning of, then terminate operation BFS.
Step 300: for each block for meeting time range, read in each block build based on Merkle tree
Then the root node information of the tree index structure combined with kd tree accesses entire Merkle tree from top to bottom and mutually ties with kd tree
The tree index structure of conjunction, searches out the key data met in spatial dimension, passes through Merkle further according to key data
Patricia-trie technology obtains corresponding original space-time data；
In step 300, the application proposes efficient block chain query response method for space-time data, makes it to support such as " s
The inquiry such as all data in the region l in the period ".
The main process of spatial dimension search is the sky of the embodiment of the present application referring specifically to Fig. 7 for traversal of tree process
Between range searching flow chart.Spatial dimension search for the step of include:
Step 301: obtaining the tree combined based on Merkle tree with kd tree from the build of block for meeting time range
The root node of type index structure, down along a simple path always by given spatial dimension and tree node since root node
It is compared；
Step 302: if given spatial dimension is bigger than tree node, path enters the right subtree of tree, if given space
Range is smaller than tree node, then path enters the left subtree of tree, until the hypermatrix for meeting spatial dimension is accessed, and will surpass
Data in rectangle return；
Step 303: for the data of return, because being cryptographic Hash, needing to find in build based on Merkle
The root node of the key-value pair index of Patricia-trie technology；
Step 304: being indexed according to the key-value pair based on Merkle Patricia-trie technology, by cryptographic Hash data conversion
For original space-time data, and return to original space-time data.
Note that spatial dimension search process can all be handled all blocks for meeting given time range once, obtain
Returned data is exactly the space-time data for meeting spatial-temporal query requirement.Fig. 4 is that space-time unique inquiry is carried out on directed acyclic graph
Respond exemplary diagram.Firstly, block within this time range is obtained according to given time range, then, according to given space
Range looks for the hypermatrix met in each block, and returns to the data result in hypermatrix.
The block chain spatiotemporal data warehouse system of the embodiment of the present application and electronic equipment are by by Merkle tree and kd tree phase
In conjunction with new tree index is formed with the space-time data on directed acyclic graph structures in memory block catenary system, it is based on this, is being had
Into acyclic figure, screening meets the block of time range, and inquiry meets the data of spatial dimension in the block after screening.Phase
For the prior art, the advantage of the embodiment of the present application is:
1, the application is adjusted to inquiry of the block catenary system to data from the storage organization of block chain, both for space-time
Design data, application scenarios of the block chain on Temporal-spatial data management can be met；
2, the spatiotemporal data warehouse method of the application is very efficient, can accomplish " online " be rapidly returned to meet it is given
It is required that as a result, also, the block of the application generate to the speed of verifying and have greatly improved, wherein the efficient index designed is equal
It is lightweight, occupies little space, meets the requirement of space-time block chain；
3, inquiry response process is succinct and is easy to implement, and can be suitably used for the space-time number as a variety of mainstreams such as knn, range query
It is investigated that asking；
4, the application in each block head by being added specific time metamessage, for recording space-time data in the block
Time interval, the block for meeting the limitation can be quickly found out by given time restriction when queried, according to Merkle
The index that combines with kd tree is set, can navigate to corresponding data in block, each inquiry response is all in the prior art for improvement
Each block is needed to be traversed for, and reads the very inefficient deficiency of the data in each block；
5, the deficiency for being difficult to set up non-complex index structure to multidimensional data in block catenary system is improved, for spatial data
The tree index that Merkle tree combines with kd tree is established, and for each space-time data, utilizes Merkle Patricia-
Trie is made into key-value pair, and the key assignments convenient for being obtained by tree index navigates to rapidly initial data；
6, it is applied to the scene of frequent updating for space-time data, the application block chain is had faster using the verification time more
To acyclic graph structures (DAG), the verification time of the structure is better than chain structure.
The foregoing description of the disclosed embodiments makes professional and technical personnel in the field can be realized or use the application.
Various modifications to these embodiments will be readily apparent to those skilled in the art, defined herein
General Principle can realize in other embodiments without departing from the spirit or scope of the application.Therefore, this Shen
These embodiments shown in the application please be not intended to be limited to, and are to fit to special with principle disclosed in the present application and novelty
The consistent widest scope of point.
Claims (4)
1. a kind of block chain spatiotemporal data warehouse system characterized by comprising
Block chain module: memory block data are used for；
Data insertion module: it is electrically connected with the block chain module；
Time range search module: it is electrically connected with the block chain module；
Spatial dimension search module: it is electrically connected by the time range search module and the block chain module；
Wherein, the topological structure G of directed acyclic graph is set as two parts node collection V and side collection E in the block chain module.
2. block chain spatiotemporal data warehouse system according to claim 1, which is characterized in that every in the block chain module
Time metamessage is set in a block build；
The topological structure G has multiple source node s for each v ∈ V.
3. block chain spatiotemporal data warehouse system according to claim 2, which is characterized in that the root in the block build
The tree index structure that nodal information is combined based on Merkle tree with kd tree；The root node respectively with the root section of right subtree
The root node connection of point, left subtree.
4. a kind of electronic equipment, comprising: at least one processor；And the storage being connect at least one described processor communication
Device；Wherein,
It is provided with block chain module as claimed in any one of claims 1-3 in the memory storage, the processor is set
It is equipped with Data insertion module, time range search module and spatial dimension search as claimed in any one of claims 1-3
Module.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201821106014.1U CN208781225U (en) | 2018-07-12 | 2018-07-12 | A kind of block chain spatiotemporal data warehouse system and electronic equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201821106014.1U CN208781225U (en) | 2018-07-12 | 2018-07-12 | A kind of block chain spatiotemporal data warehouse system and electronic equipment |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN208781225U true CN208781225U (en) | 2019-04-23 |
Family
ID=66153447
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201821106014.1U Active CN208781225U (en) | 2018-07-12 | 2018-07-12 | A kind of block chain spatiotemporal data warehouse system and electronic equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN208781225U (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US11269863B2 (en) * | 2020-01-23 | 2022-03-08 | International Business Machines Corporation | Index structure for blockchain ledger |
| JP2023505412A (en) * | 2020-02-18 | 2023-02-09 | テンセント・テクノロジー・（シェンジェン）・カンパニー・リミテッド | Block processing method, data retrieval method and apparatus based on blockchain |
-
2018
- 2018-07-12 CN CN201821106014.1U patent/CN208781225U/en active Active
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US11269863B2 (en) * | 2020-01-23 | 2022-03-08 | International Business Machines Corporation | Index structure for blockchain ledger |
| JP2023505412A (en) * | 2020-02-18 | 2023-02-09 | テンセント・テクノロジー・（シェンジェン）・カンパニー・リミテッド | Block processing method, data retrieval method and apparatus based on blockchain |
| JP7441311B2 (en) | 2020-02-18 | 2024-02-29 | テンセント・テクノロジー・（シェンジェン）・カンパニー・リミテッド | Block processing method, data retrieval method and device based on blockchain |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108595720A (en) | A kind of block chain spatiotemporal data warehouse method, system and electronic equipment | |
| JP6963006B2 (en) | Data storage, data checking, and data concatenation methods and equipment | |
| US10338917B2 (en) | Method, apparatus, and system for reading and writing files | |
| US8468146B2 (en) | System and method for creating search index on cloud database | |
| US8229968B2 (en) | Data caching for distributed execution computing | |
| CN111324577B (en) | Yml file reading and writing method and device | |
| CN208781225U (en) | A kind of block chain spatiotemporal data warehouse system and electronic equipment | |
| CN103678519A (en) | Mixed storage system and mixed storage method for supporting Hive DML (data manipulation language) enhancement | |
| Das et al. | Plan before you execute: A cost-based query optimizer for attributed graph databases | |
| Ketsman et al. | Distribution policies for datalog | |
| EP3743821A1 (en) | Wide key hash table for a graphics processing unit | |
| Djenouri et al. | GPU-based swarm intelligence for Association Rule Mining in big databases | |
| WO2022247869A1 (en) | Method for searching for data, apparatus, and device | |
| Deng et al. | Label propagation on k-partite graphs with heterophily | |
| Phan | Cloud Databases for Internet-of-Things Data | |
| US9607021B2 (en) | Loading data with complex relationships | |
| Kim et al. | DSP-CC-: I/O efficient parallel computation of connected components in billion-scale networks | |
| Aghazadeh et al. | Space-and time-efficient long-lived test-and-set objects | |
| Miura et al. | An FPGA-based Accelerator for Regular Path Queries over Edge-labeled Graphs | |
| Du et al. | EthMB+: A Tamper-Proof Data Query Model Based on B+ Tree and Merkle Tree | |
| Čerešňák et al. | Improvement of Data Searching in MongoDB with the Use of Oracle Database | |
| Bhattarai et al. | Mnemonic: A Parallel Subgraph Matching System for Streaming Graphs | |
| Sumrall | Path indexing for efficient path query processing in graph databases | |
| Wang et al. | A Blockchain Query Optimization Method Based on Hybrid Indexes | |
| CN117786164A (en) | Method and device for data export in distributed protogram database |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| GR01 | Patent grant | ||
| GR01 | Patent grant |