CN108595720A - A kind of block chain spatiotemporal data warehouse method, system and electronic equipment - Google Patents

A kind of block chain spatiotemporal data warehouse method, system and electronic equipment Download PDF

Info

Publication number
CN108595720A
CN108595720A CN201810765882.9A CN201810765882A CN108595720A CN 108595720 A CN108595720 A CN 108595720A CN 201810765882 A CN201810765882 A CN 201810765882A CN 108595720 A CN108595720 A CN 108595720A
Authority
CN
China
Prior art keywords
block
time
data
block chain
time range
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
Application number
CN201810765882.9A
Other languages
Chinese (zh)
Other versions
CN108595720B (en
Inventor
曲强
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Shenzhen Institute of Advanced Technology of CAS
Original Assignee
Shenzhen Institute of Advanced Technology of CAS
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Shenzhen Institute of Advanced Technology of CAS filed Critical Shenzhen Institute of Advanced Technology of CAS
Priority to CN201810765882.9A priority Critical patent/CN108595720B/en
Publication of CN108595720A publication Critical patent/CN108595720A/en
Priority to PCT/CN2018/114374 priority patent/WO2020010763A1/en
Application granted granted Critical
Publication of CN108595720B publication Critical patent/CN108595720B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Data Mining & Analysis (AREA)
  • Databases & Information Systems (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

This application involves a kind of block chain spatiotemporal data warehouse method, system and electronic equipments.The method includes:Step a:Space-time data in block catenary system is inserted into based on Merkle trees in the tree index structure that kd trees are combined, and is stored in block chain module;For the block chain mould each block in the block, time metamessage is introduced in build;Step b:The given corresponding time range of space-time data and spatial dimension, the block for meeting the time range is searched out using the time metamessage in each block build in the block chain module in the topological structure G of directed acyclic graph;Step c:The root node information for meeting the tree index structure being combined with kd trees based on the Merkle trees in the block build of time range described in reading, searches out the key data for meeting the spatial dimension, and corresponding space-time data is obtained further according to the key data.The application is very efficient, can accomplish that being rapidly returned to for " online " meets to the result of provisioning request.

Description

A kind of block chain spatiotemporal data warehouse method, system and electronic equipment
Technical field
The application belongs to internet database technical field, more particularly to a kind of block chain spatiotemporal data warehouse method is System and electronic equipment.
Background technology
Block chain technology, also referred to as distributed account book technology, is a kind of internet database technology, is distributed data The new application pattern of the computer technologies such as storage, point-to-point transmission, common recognition mechanism, Encryption Algorithm.Block chain is with bit A kind of completely new the decentralization architecture and Distributed Calculation for becoming increasingly popular and gradually rising of the digital encryptions currency such as coin Normal form.Due to block chain have many advantages, such as decentralization, time series data, collective safeguard, it is secure and trusted, in recent years, it is wide It applies generally in the industries such as finance, medical treatment, education, industrial quarters is also exploring the more application scenarios of block chain with 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 of the tracking article in transportational process.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 times are 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 using the areas Merkle Shu Dui Transaction Information in the block, 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 includes then that authenticated block creates 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.
In conclusion existing block chain technology has the disadvantage that:1) it, does not support efficiently to manage space-time data Reason includes effectively being stored to space-time data and the efficient inquiry 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 It imitates and takes, be 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 space-time data these multidimensional datas 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.
Invention content
This application provides a kind of block chain spatiotemporal data warehouse method, system and electronic equipments, it is intended at least certain One of above-mentioned technical problem in the prior art is solved in degree.
To solve the above-mentioned problems, this application provides following technical solutions:
A kind of block chain spatiotemporal data warehouse method, includes the following steps:
Step a:Space-time data in block catenary system is inserted into the tree index being combined with kd trees based on Merkle trees In structure, and it is stored in block chain module;For the block chain mould each block in the block, 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 being combined with kd trees based on the Merkle trees 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;
Wherein, the set of node of the topological structure G is V, and the side of the topological structure G integrates as E.
The technical solution that the embodiment of the present application is taken further includes:It is described using every in block chain module in the step b Time metamessage in a block build searched out in the topological structure G of directed acyclic graph meet time range block it is specific For:The block of the directed acyclic graph is searched for by the time range and is realized with breadth-first algorithm, G pairs of the topological structure There are multiple source node s in each v ∈ V, started a query at by the source node s, inquiry later is considered to trace current point Nearest front nodal.
The technical solution that the embodiment of the present application is taken further includes:It is described using every in block chain module in the step b Time metamessage in a block build searches out the block for meeting the time range in the topological structure G of directed acyclic graph It specifically includes:
Step b1:Given time range beta, the current newest verification area returned using GetRobustAccepted functions Block, bring into operation breadth-first algorithm;
Step b2:In the operational process of the breadth-first algorithm, if the time metamessage in block build is in institute It states in time range β, then the block is put into result set;
Step b3:When searching tempon of the block outside the time range β or in all next block builds At the beginning of the end time of information is respectively less than the time range β, then operation breadth-first algorithm is terminated.
The technical solution that the embodiment of the present application is taken further includes:In the step c, the reading meets time range The root node information of the tree index structure being combined with kd trees based on the Merkle trees in block build, is searched out and is met The key data of spatial dimension specifically includes:Obtain from the block build for meeting time range based on the Merkle trees and The root node for the tree index structure that kd trees are combined, down along a simple path always by institute since the root node Spatial dimension is stated to be compared with tree node;If the spatial dimension is bigger than tree node, the path enters the right son of tree Tree, if the spatial dimension is smaller than tree node, the path enters the left subtree of tree, until be accessed one meet it is described The hypermatrix of spatial dimension, and the Hash Value Data in the hypermatrix is returned.
The technical solution that the embodiment of the present application is taken further includes:It is described to be corresponded to according to key data in the step c Space-time data be specially:It is found based on Merkle Patricia-trie skills in the block build for meeting time range The root node of the key-value pair index of art, and indexed according to the key-value pair based on the Merkle Patricia-trie technologies, it will The cryptographic Hash data are converted to original space-time data, and return to original space-time data.
Another technical solution that the embodiment of the present application is taken is:A kind of block chain spatiotemporal data warehouse system, including:
Block chain module:For memory block data;
Data insertion module:It is connect with the block chain module, for the space-time data in block catenary system to be inserted into base In Merkle trees in the tree index structure that kd trees are combined, and it is stored in the block chain module;For the block Chain mould each block in the block introduces time metamessage in build;
Time range search module:It is connect with the block chain module, for giving the corresponding time range of space-time data And spatial dimension, the topology using the time metamessage in each block build in the block chain module in directed acyclic graph are tied The block for meeting the time range is searched out in structure G;
Spatial dimension search module:It is connect with the time range search module, described meets time range for reading Block build in the tree index structure being combined with kd trees based on the Merkle trees root node information, search out symbol The key data in the spatial dimension is closed, corresponding space-time data is obtained further according to the key data;
Wherein, the set of node of the topological structure G is V, and the side of the topological structure G integrates as E.
The technical solution that the embodiment of the present application is taken further includes:The time range search module utilizes in block chain module Time metamessage in each block build searches out the block tool for meeting time range in the topological structure G of directed acyclic graph Body is:The block of the directed acyclic graph is searched for by the time range and is realized with breadth-first algorithm, the topological structure G There are multiple source node s for each v ∈ V, started a query at by the source node s, consider that inquiry later, retrospect is current The nearest front nodal of node.
The technical solution that the embodiment of the present application is taken further includes:The time range search module utilizes in block chain module Time metamessage in each block build searches out in the topological structure G (V, E) of directed acyclic graph meets time range Block specifically includes:Given time range beta, the current newest verification block returned using GetRobustAccepted functions, Bring into operation breadth-first algorithm;In the operational process of the breadth-first algorithm, if the tempon letter in block build The block is then put into result set by breath in the time range β;When search block outside the time range β or At the beginning of the end time of time metamessage in all next block builds is respectively less than the time range β, then eventually Only run breadth-first algorithm.
The technical solution that the embodiment of the present application is taken further includes:The spatial dimension search module reading meets time range Block build in the tree index structure being combined with kd trees based on Merkle trees root node information, search out and meet sky Between key data in range specifically include:Obtain from the block build for meeting time range based on the Merkle trees and The root node for the tree index structure that kd trees are combined, down along a simple path always by institute since the root node Spatial dimension is stated to be compared with tree node;If the spatial dimension is bigger than tree node, the path enters the right son of tree Tree, if the spatial dimension is smaller than tree node, the path enters the left subtree of tree, until be accessed one meet it is described The hypermatrix of spatial dimension, and the Hash Value Data in the hypermatrix is returned.
The technical solution that the embodiment of the present application is taken further includes:The spatial dimension search module obtains pair according to key data The space-time data answered is specially:It is found based on Merkle Patricia-trie in the block build for meeting time range The root node of the key-value pair index of technology, and indexed according to the key-value pair based on the Merkle Patricia-trie technologies, The cryptographic Hash data are converted into original space-time data, and return to original space-time data.
The another technical solution that the embodiment of the present application is taken is:A kind of electronic equipment, including:
At least one processor;And
The memory being connect at least one processor communication;Wherein,
The memory is stored with the instruction that can be executed by one processor, and described instruction is by least one place It manages device to execute, so that at least one processor is able to carry out the following behaviour of above-mentioned block chain spatiotemporal data warehouse method Make:
Step a:Space-time data in block catenary system is inserted into the tree index being combined with kd trees based on Merkle trees In structure, and it is stored in block chain module;For the block chain mould each block in the block, 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 being combined with kd trees based on the Merkle trees 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.
Compared with the existing technology, the advantageous effect that the embodiment of the present application generates is:When the block chain of the embodiment of the present application Empty data query method, system and electronic equipment are by the way that Merkle trees to be combined to form new tree index with oriented with kd trees Space-time data on acyclic graph structures in memory block catenary system is based on this, is screened in directed acyclic graph and meets time range Block, and inquiry meets the data of spatial dimension in the block after screening.Compared with the existing technology, the embodiment of the present application Advantage 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 verification 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 is combined with kd trees 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 each area data in the 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 trees are combined with kd trees is established, and for each space-time data, utilizes Merkle Patricia- Trie makes 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.
Description of the drawings
Fig. 1 is the flow chart of the block chain spatiotemporal data warehouse method of the embodiment of the present application;
Fig. 2 is the directed acyclic graph of the embodiment of the present application;
Fig. 3 is the flow chart of the time range search of the embodiment of the present application;
Fig. 4 is the flow chart of the spatial dimension search of the embodiment of the present application;
Fig. 5 is the response exemplary plot that space-time unique inquiry is carried out on directed acyclic graph;
Fig. 6 is the structural schematic diagram of the block chain spatiotemporal data warehouse system of the embodiment of the present application;
Fig. 7 is the hardware device structural schematic diagram of block chain spatiotemporal data warehouse method provided by the embodiments of the present application.
Specific implementation mode
It is with reference to the accompanying drawings and embodiments, right in order to make the object, technical solution and advantage of the application be 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 flow chart of the block chain spatiotemporal data warehouse method of the embodiment of the present application.The embodiment of the present application Block chain spatiotemporal data warehouse method include the following steps:
Step 100:In block chain block renewal process, the space-time data in block catenary system is inserted into and is based on Merkle Tree is stored in block chain module in the tree index structure that kd trees are combined;Meanwhile it is in the block every for block chain mould A block introduces time metamessage in build;
In step 100, in the structure in block chain, the application is used based on Merkle trees and kd tree phases space-time data In conjunction with tree index structure.Wherein, Merkle trees are the tree constructions for storing cryptographic Hash, and leaf is the Hash of data Value, and non-leaf nodes is the cryptographic Hash of its correspondence child node series strings.And kd trees be one kind for multidimensional theorem in Euclid space The binary tree for dividing construction also represents a division of the k dimension spaces constituted to k dimension data set, that is, is each saved in setting The hypermatrix of the corresponding k dimensions of point.In conjunction with the data in the two, that is, kd tree nodes Hash processing is carried out according to Merkle tree rules. Merkle Patricia-trie then are used to store the key-value pair of space-time data, convenient for the key assignments obtained by tree index structure Navigate to initial data rapidly.For the time metamessage being added in each block head, for recording space-time data in the block 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 trees are combined with kd trees can navigate to corresponding data in block.
Step 200:During spatiotemporal data warehouse, the corresponding time range of space-time data and spatial dimension, profit are given It is searched in the topological structure G (V, E) of directed acyclic graph (DAG) with the time metamessage in each block build in block chain module Rope goes out to meet the block of time range;Wherein, the set of node of topological structure G is 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 networks, It is identified per transaction, has needed to be linked to existing and newer transaction in a network and 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 2.
In order to realize that rapid time search, the application introduce the time metamessage included in each build on DAG. Given time range beta searches out the block of the condition of satisfaction on DAG topological structures G (V, E) according to β first.As shown in Fig. 2, opening up Flutterring structure G, (the node v) for belonging to set of node V has multiple source node s for each v ∈ V.Source node s is in directed acyclic graph The node that middle in-degree is 0.For each node v in topological structure G, they are and subsequent by subsequent node verification Node is verified by more subsequent node again.And so on, it is known that the block node for being newly joined topological structure G is without after What continuous node verified them, so they are source node s to be verified.Using source node s, the front can have been traced Authenticated node can facilitate and be traversed to the topological structure G of entire directed acyclic graph.
It is started a query at by source node s, considers inquiry later the nearest front nodal of retrospect present node.To respectively having To the block of acyclic figure, temporally range searching is realized with breadth-first algorithm (BFS).It is the application reality referring specifically to Fig. 3 Apply the flow chart of the time range search of example.Time range search for the step of include:
Step 201:Given time range beta=(time started, the end time) utilizes GetRobustAccepted (G) letter The current newest verification block that number 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, [Bheader.start time, Bheader.end time] ∩ [β .starttime,Then will 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 trees with Then the root node information for the tree index structure that kd trees are combined accesses entire Merkle trees and is combined with kd trees from top to bottom Tree index structure, search out the key data met in spatial dimension, pass through Merkle Patricia- further according to key data Trie technologies obtain 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 inquiries such as all data in the regions l in the period ".The main process of spatial dimension search is traversal of tree process, please specifically be joined Fig. 4 is read, is the flow chart of the spatial dimension search of the embodiment of the present application.Spatial dimension search for the step of include:
Step 301:The tree being combined with kd trees based on Merkle trees is obtained 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 a 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, need to find based on Merkle in build The root node of the key-value pair index of Patricia-trie technologies;
Step 304:According to the key-value pair index based on Merkle Patricia-trie technologies, 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 to meet the space-time data of spatial-temporal query requirement.Fig. 5 is that space-time unique inquiry is carried out on directed acyclic graph Respond exemplary plot.First, 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.
Referring to Fig. 6, 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 include block chain module, Data insertion module, time range search module and space model Enclose search module.
Block chain module:For memory block data;
Data insertion module:It connect, is used in block chain block renewal process, by block catenary system with block chain module In space-time data be inserted into based on Merkle trees in the tree index structure that kd trees are combined, and be stored in block chain module In;Meanwhile for block chain mould each block in the block, time metamessage is introduced in build;In the embodiment of the present application, space-time Data use the tree index structure being combined with kd trees based on Merkle trees in the structure in block chain.Wherein, Merkle trees are the tree constructions for storing cryptographic Hash, and leaf is the cryptographic Hash of data, and non-leaf nodes is its correspondence The cryptographic Hash of node series strings.And kd trees are a kind of binary trees for multidimensional theorem in Euclid space segmentation construction, are also represented A division to the k dimension spaces that k dimension data set is constituted, that is, each node corresponds to the hypermatrix of k dimensions in setting.In conjunction with Data in the two, that is, kd tree nodes carry out Hash processing according to Merkle tree rules.Merkle Patricia-trie are then used for The key-value pair of space-time data is stored, the key assignments convenient for being obtained by tree index structure navigates to rapidly initial data.For every The time metamessage being added in a block head, the time interval for recording space-time data in the block can lead to when queried It crosses given time range and is quickly found out the block for meeting the time range, the tree-shaped rope being combined with kd trees according to Merkle trees Guiding structure can navigate to corresponding data in block.
Time range search module:It is connect with block chain module, for during spatiotemporal data warehouse, giving space-time number According to corresponding time range and spatial dimension, using the time metamessage in each block build in block chain module in oriented nothing The block for meeting time range is searched out in the topological structure G (V, E) of ring figure (DAG);In the embodiment of the present application, in block chain skill In art, the directed acyclic graph (DAG) for needing the verification time shorter is selected, it can improve the efficiency of block chain so that energy in network It is enough to go out block parallel, and it is smaller to verify required time.In DAG networks, it is identified per transaction, needs to be linked in net Present in network and newer transaction is done link and is confirmed, the width of such network keeps within a certain range, to allow new Transaction have faster acknowledging time.
In order to realize that rapid time search, the application introduce the time metamessage included in each build on DAG. Given time range beta searches out the block of the condition of satisfaction on DAG topological structures G (V, E) according to β first.G pairs of topological structure There are multiple source node s (node to be verified in directed acyclic graph is newly added) in each v ∈ V, started a query at by source node, The nearest front nodal of retrospect current point is considered inquiry later.To the block of each directed acyclic graph temporally range searching It is realized with breadth-first algorithm (BFS).Specifically, the time range way of search of time range search module is:Given time Range beta=(time started, end time), the current newest verification area returned using GetRobustAccepted (G) function Block, thus bring into operation BFS;In the implementation procedure of BFS, if the time metamessage in block build is in given time model It encloses in β, that is, [Bheader.start time, Bheader.end time] ∩ [β .starttime, 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:It is connect with time range search module, for reading each area for meeting time range The root node information of the tree index structure being combined with kd trees based on Merkle trees in block build, is then accessed from top to bottom The tree index structure that entire Merkle trees are combined with kd trees, searches out the key data met in spatial dimension, further according to key Data obtain corresponding original space-time data by Merkle Patricia-trie technologies;The application is proposed for space-time data Efficient block chain query response method, makes it to support such as " all data in the regions l in the s periods " inquiry.
Specifically, the spatial dimension way of search of spatial dimension search module is:It is based on from the build of block The root node for the tree index structure that Merkle trees are combined with kd trees, down along a simple path one since root node Directly given spatial dimension is compared with tree node;If given spatial dimension is bigger than tree node, path enters the right side of tree Subtree, if given spatial dimension is smaller than tree node, path enters the left subtree of tree, meets space model until being accessed one The hypermatrix enclosed, and the data in hypermatrix are returned;For the data of return, because being cryptographic Hash, need in build Find the root node of the key-value pair index based on Merkle Patricia-trie technologies;According to based on Merkle Patricia- The key-value pair of trie technologies indexes, and cryptographic Hash data is converted to original space-time data, and return to original space-time data.
The application 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 inquiries, ball-point inquiries, range inquiries and bounded knn inquiries, Obtained result is in response to speed and meets " online " inquiry.
Fig. 7 is the hardware device structural schematic diagram of block chain spatiotemporal data warehouse method provided by the embodiments of the present application.Such as Shown in Fig. 7, which includes one or more processors and memory.By taking 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. 7 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 to execute various function application and the data processing of electronic equipment Reason method.
Memory may include storing program area and storage data field, wherein storing program area can storage program area, extremely A few required application program of function;Storage data field can store 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 not limited to internet, enterprise Intranet, LAN, 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 modules are stored 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:Space-time data in block catenary system is inserted into the tree index being combined with kd trees based on Merkle trees In structure, and it is stored in block chain module;For the block chain mould each block in the block, 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 being combined with kd trees based on the Merkle trees 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 said goods can perform the method that the embodiment of the present application is provided, and has the corresponding function 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 media, 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:Space-time data in block catenary system is inserted into the tree index being combined with kd trees based on Merkle trees In structure, and it is stored in block chain module;For the block chain mould each block in the block, 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 being combined with kd trees based on the Merkle trees 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:Space-time data in block catenary system is inserted into the tree index being combined with kd trees based on Merkle trees In structure, and it is stored in block chain module;For the block chain mould each block in the block, 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 being combined with kd trees based on the Merkle trees 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 block chain spatiotemporal data warehouse method, system and electronic equipment of the embodiment of the present application are by by Merkle trees and kd Tree is combined to form new tree index with the space-time data in the memory block catenary system on directed acyclic graph structures, is based on this, Screening meets the block of time range in directed acyclic graph, and inquiry meets the number of spatial dimension in the block after screening According to.Compared with the existing technology, 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 verification 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 is combined with kd trees 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 each area data in the 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 trees are combined with kd trees is established, and for each space-time data, utilizes Merkle Patricia- Trie makes 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 enables professional and technical personnel in the field to realize or use the application. Various modifications to these embodiments will be apparent to those skilled in the art, defined herein General Principle can in other embodiments be realized in the case where not departing from spirit herein or range.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 range of point.

Claims (11)

1. a kind of block chain spatiotemporal data warehouse method, which is characterized in that include the following steps:
Step a:Space-time data in block catenary system is inserted into the tree index structure being combined with kd trees based on Merkle trees In, and be stored in block chain module;For the block chain mould each block in the block, tempon letter is introduced in build Breath;
Step b:The given corresponding time range of space-time data and spatial dimension, utilize each block block in the block chain module Time metamessage in head searches out the block for meeting the time range in the topological structure G of directed acyclic graph;
Step c:Meet the tree being combined with kd trees based on the Merkle trees in the block build of time range described in reading The root node information of type index structure searches out the key data for meeting the spatial dimension, is obtained pair further according to the key data The space-time data answered;
Wherein, the set of node of the topological structure G is V, and the side of the topological structure G integrates as E.
2. block chain spatiotemporal data warehouse method according to claim 1, which is characterized in that described in the step b It is searched out and is met in the topological structure G of directed acyclic graph using the time metamessage in each block build in block chain module The block of time range is specially:The block of the directed acyclic graph is searched for by the time range with breadth-first algorithm reality Existing, the topological structure G has multiple source node s for each v ∈ V, is started a query at by the source node s, to looking into later Ask the nearest front nodal for considering retrospect present node.
3. block chain spatiotemporal data warehouse method according to claim 2, which is characterized in that described in the step b It is searched out and is met in the topological structure G of directed acyclic graph using the time metamessage in each block build in block chain module The block of the time range specifically includes:
Step b1:Given time range beta, the current newest verification block returned using GetRobustAccepted functions, is opened Begin operation breadth-first algorithm;
Step b2:In the operational process of the breadth-first algorithm, if the time metamessage in block build is when described Between in range beta, then the block is put into result set;
Step b3:When searching time metamessage of the block outside the time range β or in all next block builds End time be respectively less than the time range β at the beginning of, then terminate operation breadth-first algorithm.
4. block chain spatiotemporal data warehouse method according to claim 3, which is characterized in that described in the step c Read the root for meeting the tree index structure being combined with kd trees based on the Merkle trees in the block build of time range Nodal information searches out and meets the key data of spatial dimension and specifically include:From the block build for meeting time range To the root node for the tree index structure being combined with kd trees based on the Merkle trees, since the root node down along The spatial dimension is compared always by one simple path with tree node;If the spatial dimension is bigger than tree node, The path enters the right subtree of tree, if the spatial dimension is smaller than tree node, the path enters the left subtree of tree, directly To being accessed a hypermatrix for meeting the spatial dimension, and the Hash Value Data in the hypermatrix is returned.
5. block chain spatiotemporal data warehouse method according to claim 4, which is characterized in that described in the step c Obtaining corresponding space-time data according to key data is specially:It finds and is based in the block build for meeting time range The root node of the key-value pair index of Merkle Patricia-trie technologies, and according to based on the Merkle Patricia- The key-value pair of trie technologies indexes, and the cryptographic Hash data is converted to original space-time data, and return to original space-time data.
6. a kind of block chain spatiotemporal data warehouse system, which is characterized in that including:
Block chain module:For memory block data;
Data insertion module:It is connect with the block chain module, for the space-time data insertion in block catenary system to be based on Merkle trees are stored in the block chain module in the tree index structure that kd trees are combined;For the block chain Mould each block in the block introduces time metamessage in build;
Time range search module:It is connect with the block chain module, for giving the corresponding time range of space-time data and sky Between range, using the time metamessage in each block build in the block chain module directed acyclic graph topological structure G In search out the block for meeting the time range;
Spatial dimension search module:It is connect with the time range search module, for reading the area for meeting time range The root node information of the tree index structure being combined with kd trees based on the Merkle trees in block build, is searched out and meets institute The key data in spatial dimension is stated, corresponding space-time data is obtained further according to the key data;
Wherein, the set of node of the topological structure G is V, and the side of the topological structure G integrates as E.
7. block chain spatiotemporal data warehouse system according to claim 6, which is characterized in that the time range searches for mould Block searches out symbol using the time metamessage in each block build in block chain module in the topological structure G of directed acyclic graph Close time range block be specially:The block of the directed acyclic graph is searched for by the time range with breadth-first algorithm It realizes, the topological structure G has multiple source node s for each v ∈ V, is started a query at by the source node s, to later Inquiry considers the nearest front nodal of retrospect current point.
8. block chain spatiotemporal data warehouse system according to claim 7, which is characterized in that the time range searches for mould Block searches out symbol using the time metamessage in each block build in block chain module in the topological structure G of directed acyclic graph The block for closing time range specifically includes:Given time range beta, using GetRobustAccepted functions return it is current most New verification block, bring into operation breadth-first algorithm;In the operational process of the breadth-first algorithm, if block build In time metamessage in the time range β, then the block is put into result set;When searching block in the time The end time of time metamessage outside range beta or in all next block builds is respectively less than opening for the time range β Begin the time, then terminates operation breadth-first algorithm.
9. block chain spatiotemporal data warehouse system according to claim 8, which is characterized in that the spatial dimension searches for mould Block reads the tree index structure being combined with kd trees based on the Merkle trees met in the block build of time range Root node information searches out the key data met in spatial dimension and specifically includes:From the block build for meeting time range In obtain the root node for the tree index structure being combined with kd trees based on the Merkle trees, since the root node down The spatial dimension is compared with tree node always along a simple path;If the spatial dimension compares tree node Greatly, then the path enters the right subtree of tree, if the spatial dimension is smaller than tree node, the path enters the left son of tree Tree returns until a hypermatrix for meeting the spatial dimension is accessed, and by the Hash Value Data in the hypermatrix.
10. block chain spatiotemporal data warehouse system according to claim 9, which is characterized in that the spatial dimension search Module obtains corresponding space-time data according to key data:It finds and is based in the block build for meeting time range The root node of the key-value pair index of Merkle Patricia-trie technologies, and according to based on the Merkle Patricia- The key-value pair of trie technologies indexes, and the cryptographic Hash data is converted to original space-time data, and return to original space-time data.
11. a kind of electronic equipment, including:
At least one processor;And
The memory being connect at least one processor communication;Wherein,
The memory is stored with the instruction that can be executed by one processor, and described instruction is by least one processor It executes, so that at least one processor is able to carry out above-mentioned 1 to 5 any one of them block chain spatiotemporal data warehouse method Following operation:
Step a:Space-time data in block catenary system is inserted into the tree index structure being combined with kd trees based on Merkle trees In, and be stored in block chain module;For the block chain mould each block in the block, tempon letter is introduced in build Breath;
Step b:The given corresponding time range of space-time data and spatial dimension, utilize each block block in the block chain module Time metamessage in head searches out the block for meeting the time range in the topological structure G of directed acyclic graph;
Step c:Meet the tree being combined with kd trees based on the Merkle trees in the block build of time range described in reading The root node information of type index structure searches out the key data for meeting the spatial dimension, is obtained pair further according to the key data The space-time data answered.
CN201810765882.9A 2018-07-12 2018-07-12 Block chain space-time data query method, system and electronic equipment Active CN108595720B (en)

Priority Applications (2)

Application Number Priority Date Filing Date Title
CN201810765882.9A CN108595720B (en) 2018-07-12 2018-07-12 Block chain space-time data query method, system and electronic equipment
PCT/CN2018/114374 WO2020010763A1 (en) 2018-07-12 2018-11-07 Blockchain spatio-temporal data querying method and system, and electronic apparatus

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201810765882.9A CN108595720B (en) 2018-07-12 2018-07-12 Block chain space-time data query method, system and electronic equipment

Publications (2)

Publication Number Publication Date
CN108595720A true CN108595720A (en) 2018-09-28
CN108595720B CN108595720B (en) 2020-05-19

Family

ID=63618197

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201810765882.9A Active CN108595720B (en) 2018-07-12 2018-07-12 Block chain space-time data query method, system and electronic equipment

Country Status (2)

Country Link
CN (1) CN108595720B (en)
WO (1) WO2020010763A1 (en)

Cited By (20)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109460406A (en) * 2018-10-15 2019-03-12 咪咕文化科技有限公司 A kind of data processing method and device
CN109614823A (en) * 2018-10-26 2019-04-12 阿里巴巴集团控股有限公司 Data processing method, device and equipment
CN109697249A (en) * 2018-12-07 2019-04-30 深圳市云歌人工智能技术有限公司 Search for method, system and the storage medium of target object and issue object
CN109885615A (en) * 2019-01-24 2019-06-14 华东师范大学 A kind of range query towards the light client of block chain based on index can verify that querying method
CN110008249A (en) * 2019-01-31 2019-07-12 阿里巴巴集团控股有限公司 A kind of time-based data query method, device and equipment
CN110008720A (en) * 2019-03-19 2019-07-12 周口师范学院 Internet of Things dynamic data source tracing method and device based on alliance's chain
CN110163007A (en) * 2019-04-23 2019-08-23 西安邮电大学 Data integrity verification method, equipment and storage medium based on block chain
CN110569246A (en) * 2019-07-23 2019-12-13 腾讯科技(深圳)有限公司 block chain node information synchronization method and device, computer equipment and storage medium
CN110602148A (en) * 2019-10-10 2019-12-20 深圳前海微众银行股份有限公司 Method and device for generating state tree of block and verifying data on chain
WO2020010763A1 (en) * 2018-07-12 2020-01-16 中国科学院深圳先进技术研究院 Blockchain spatio-temporal data querying method and system, and electronic apparatus
CN111080288A (en) * 2019-10-18 2020-04-28 湖南天河国云科技有限公司 Block chain consensus achieving method and device based on directed acyclic graph
CN111614721A (en) * 2020-04-14 2020-09-01 梁伟 Multi-dimensional block chain network and method and device for generating multi-dimensional block chain network
CN111861459A (en) * 2019-04-28 2020-10-30 常州一仙智能科技有限公司 Iota account book optimization system and method based on DPoS consensus algorithm
US10853341B2 (en) 2019-06-28 2020-12-01 Advanced New Technologies Co., Ltd. Blockchain based hierarchical data storage
CN112307010A (en) * 2019-07-29 2021-02-02 创新先进技术有限公司 Data storage method, device and equipment
CN112951357A (en) * 2021-03-23 2021-06-11 电子科技大学 Block chain-based virtual medical resource transverse expansion method
WO2021148904A1 (en) * 2020-01-23 2021-07-29 International Business Machines Corporation Index structure for blockchain ledger
TWI737152B (en) * 2019-06-28 2021-08-21 開曼群島商創新先進技術有限公司 Block chain-based hierarchical storage method and device, and electronic equipment
CN113901142A (en) * 2021-10-13 2022-01-07 辽宁大学 Space-time data-oriented block chain architecture and range query processing method
CN114756603A (en) * 2022-05-23 2022-07-15 天津大学 High-efficiency verifiable query method for lightweight block chain

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111832059B (en) * 2020-09-16 2020-12-29 北京长隆讯飞科技有限公司 Space big data management method and system based on cloud service
CN117453982A (en) * 2023-09-12 2024-01-26 武汉世纪科怡科技发展有限公司 File management file classification system

Citations (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104750708A (en) * 2013-12-27 2015-07-01 华为技术有限公司 Spatio-temporal data index building and searching methods, a spatio-temporal data index building and searching device and spatio-temporal data index building and searching equipment
CN106095952A (en) * 2016-06-15 2016-11-09 公安部第三研究所 In space-time unique based on key assignments cloud storage, magnanimity crosses car record method for quickly querying
CN106227833A (en) * 2016-07-26 2016-12-14 宁圣金融信息服务(上海)有限公司 Block chaining search engine method, system and device
CN106682825A (en) * 2016-12-22 2017-05-17 南京邮电大学 System and method for evaluating credit of Social Internet of Things based on block chain
CN107247773A (en) * 2017-06-07 2017-10-13 北京邮电大学 A kind of method that inquiry is traded in distributed data base based on block chain
CN107423368A (en) * 2017-06-29 2017-12-01 中国测绘科学研究院 A kind of space-time data indexing means in non-relational database
WO2017218984A1 (en) * 2016-06-16 2017-12-21 The Bank Of New York Mellon Ensuring data integrity of executed transactions
CN107730176A (en) * 2017-10-18 2018-02-23 上海唯链信息科技有限公司 A kind of goods logistic information inquiry system and method based on block chain
CN107729371A (en) * 2017-09-12 2018-02-23 深圳先进技术研究院 The data directory and querying method of block chain, device, equipment and storage medium

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
AU2016101183A4 (en) * 2016-07-20 2016-09-22 Platform Secured Pty Ltd Network System Innovation Method using blockchain identity based single and multi facial, voice and other bio recognition encryption protocols from existing binary packets to blockchain blocks where the actual member/ user in the blockchain becomes the fully encrypted and shielded block
CN106295406A (en) * 2016-08-13 2017-01-04 深圳市樊溪电子有限公司 A kind of block chain that is used for is from safe storage system and method thereof
CN107807951B (en) * 2017-09-18 2020-10-13 联动优势科技有限公司 Block chain generation method, data verification method, node and system
CN108595720B (en) * 2018-07-12 2020-05-19 中国科学院深圳先进技术研究院 Block chain space-time data query method, system and electronic equipment

Patent Citations (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104750708A (en) * 2013-12-27 2015-07-01 华为技术有限公司 Spatio-temporal data index building and searching methods, a spatio-temporal data index building and searching device and spatio-temporal data index building and searching equipment
CN106095952A (en) * 2016-06-15 2016-11-09 公安部第三研究所 In space-time unique based on key assignments cloud storage, magnanimity crosses car record method for quickly querying
WO2017218984A1 (en) * 2016-06-16 2017-12-21 The Bank Of New York Mellon Ensuring data integrity of executed transactions
CN106227833A (en) * 2016-07-26 2016-12-14 宁圣金融信息服务(上海)有限公司 Block chaining search engine method, system and device
CN106682825A (en) * 2016-12-22 2017-05-17 南京邮电大学 System and method for evaluating credit of Social Internet of Things based on block chain
CN107247773A (en) * 2017-06-07 2017-10-13 北京邮电大学 A kind of method that inquiry is traded in distributed data base based on block chain
CN107423368A (en) * 2017-06-29 2017-12-01 中国测绘科学研究院 A kind of space-time data indexing means in non-relational database
CN107729371A (en) * 2017-09-12 2018-02-23 深圳先进技术研究院 The data directory and querying method of block chain, device, equipment and storage medium
CN107730176A (en) * 2017-10-18 2018-02-23 上海唯链信息科技有限公司 A kind of goods logistic information inquiry system and method based on block chain

Cited By (36)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2020010763A1 (en) * 2018-07-12 2020-01-16 中国科学院深圳先进技术研究院 Blockchain spatio-temporal data querying method and system, and electronic apparatus
CN109460406A (en) * 2018-10-15 2019-03-12 咪咕文化科技有限公司 A kind of data processing method and device
US11314754B2 (en) 2018-10-26 2022-04-26 Advanced New Technologies Co., Ltd. Data processing method, apparatus, and device
US11216476B2 (en) 2018-10-26 2022-01-04 Advanced New Technologies Co., Ltd. Data processing method, apparatus, and device
CN109614823A (en) * 2018-10-26 2019-04-12 阿里巴巴集团控股有限公司 Data processing method, device and equipment
CN109697249A (en) * 2018-12-07 2019-04-30 深圳市云歌人工智能技术有限公司 Search for method, system and the storage medium of target object and issue object
CN109885615B (en) * 2019-01-24 2020-09-22 华东师范大学 Index-based block chain light client-oriented range query verifiable query method
CN109885615A (en) * 2019-01-24 2019-06-14 华东师范大学 A kind of range query towards the light client of block chain based on index can verify that querying method
CN110008249B (en) * 2019-01-31 2023-08-08 创新先进技术有限公司 Time-based data query method, device and equipment
CN110008249A (en) * 2019-01-31 2019-07-12 阿里巴巴集团控股有限公司 A kind of time-based data query method, device and equipment
CN110008720B (en) * 2019-03-19 2020-10-30 周口师范学院 Dynamic data tracing method and device for Internet of things based on alliance chain
CN110008720A (en) * 2019-03-19 2019-07-12 周口师范学院 Internet of Things dynamic data source tracing method and device based on alliance's chain
CN110163007B (en) * 2019-04-23 2021-05-04 西安邮电大学 Block chain-based data integrity verification method, equipment and storage medium
CN110163007A (en) * 2019-04-23 2019-08-23 西安邮电大学 Data integrity verification method, equipment and storage medium based on block chain
CN111861459A (en) * 2019-04-28 2020-10-30 常州一仙智能科技有限公司 Iota account book optimization system and method based on DPoS consensus algorithm
US11288247B2 (en) 2019-06-28 2022-03-29 Advanced New Technologies Co., Ltd. Blockchain based hierarchical data storage
US10853341B2 (en) 2019-06-28 2020-12-01 Advanced New Technologies Co., Ltd. Blockchain based hierarchical data storage
TWI737152B (en) * 2019-06-28 2021-08-21 開曼群島商創新先進技術有限公司 Block chain-based hierarchical storage method and device, and electronic equipment
US11030175B2 (en) 2019-06-28 2021-06-08 Advanced New Technologies Co., Ltd. Blockchain based hierarchical data storage
CN110569246A (en) * 2019-07-23 2019-12-13 腾讯科技(深圳)有限公司 block chain node information synchronization method and device, computer equipment and storage medium
CN112307010A (en) * 2019-07-29 2021-02-02 创新先进技术有限公司 Data storage method, device and equipment
CN112307010B (en) * 2019-07-29 2024-04-16 创新先进技术有限公司 Data storage method, device and equipment
CN110602148B (en) * 2019-10-10 2021-07-06 深圳前海微众银行股份有限公司 Method and device for generating state tree of block and verifying data on chain
CN110602148A (en) * 2019-10-10 2019-12-20 深圳前海微众银行股份有限公司 Method and device for generating state tree of block and verifying data on chain
CN111080288B (en) * 2019-10-18 2023-08-18 湖南天河国云科技有限公司 Block chain consensus achieving method and device based on directed acyclic graph
CN111080288A (en) * 2019-10-18 2020-04-28 湖南天河国云科技有限公司 Block chain consensus achieving method and device based on directed acyclic graph
US11269863B2 (en) 2020-01-23 2022-03-08 International Business Machines Corporation Index structure for blockchain ledger
GB2607780A (en) * 2020-01-23 2022-12-14 Ibm Index structure for blockchain ledger
WO2021148904A1 (en) * 2020-01-23 2021-07-29 International Business Machines Corporation Index structure for blockchain ledger
CN111614721B (en) * 2020-04-14 2022-11-22 梁伟 Multi-dimensional block chain network, and method and device for generating multi-dimensional block chain network
CN111614721A (en) * 2020-04-14 2020-09-01 梁伟 Multi-dimensional block chain network and method and device for generating multi-dimensional block chain network
CN112951357A (en) * 2021-03-23 2021-06-11 电子科技大学 Block chain-based virtual medical resource transverse expansion method
CN112951357B (en) * 2021-03-23 2023-05-09 电子科技大学 Virtual medical resource lateral expansion method based on blockchain
CN113901142A (en) * 2021-10-13 2022-01-07 辽宁大学 Space-time data-oriented block chain architecture and range query processing method
CN113901142B (en) * 2021-10-13 2024-05-07 辽宁大学 Space-time data-oriented block chain architecture and range query processing method
CN114756603A (en) * 2022-05-23 2022-07-15 天津大学 High-efficiency verifiable query method for lightweight block chain

Also Published As

Publication number Publication date
WO2020010763A1 (en) 2020-01-16
CN108595720B (en) 2020-05-19

Similar Documents

Publication Publication Date Title
CN108595720A (en) A kind of block chain spatiotemporal data warehouse method, system and electronic equipment
CN105989088B (en) Learning device under digitized environment
CN103180826B (en) Object data set is managed in the data flow diagram for represent computer program
Dourish No SQL: The shifting materialities of database technology
CN111324577B (en) Yml file reading and writing method and device
US20180232351A1 (en) Joining web data with spreadsheet data using examples
CN109145055A (en) A kind of method of data synchronization and system based on Flink
CN208781225U (en) A kind of block chain spatiotemporal data warehouse system and electronic equipment
Raj Neo4j high performance
Hunter et al. Updating probabilistic epistemic states in persuasion dialogues
Das et al. Plan before you execute: A cost-based query optimizer for attributed graph databases
Freund et al. A formalization of membrane systems with dynamically evolving structures
Mota et al. A compact timed state space approach for the analysis of manufacturing systems: key algorithmic improvements
US11803573B2 (en) Systems and methods for a multi-hierarchy physical storage architecture for managing program and outcome data
CN112784899A (en) Method, device and equipment for mining frequent pattern of power transformation operation and maintenance knowledge and storage medium
Deng et al. Label propagation on k-partite graphs with heterophily
Sun Big Data 4.0: The Era of Big Intelligence
Ma et al. State-based episodic memory for multi-agent reinforcement learning
Gongye et al. A simple detection and generation algorithm for simple circuits in directed graph based on depth-first traversal
CN114356403A (en) Configuration data processing method, device and system based on low-code application development
Andrés-Martínez Unbounded loops in quantum programs: categories and weak while loops
Stojmenovic Listing combinatorial objects in parallel
CN116737763B (en) Structured query statement execution method, device, computer equipment and storage medium
US20180150194A1 (en) Three dimensional hierarchical data display
Sultana et al. Querying KEGG pathways in logic

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant