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
- module
- data
- block
- 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
- 230000015654 memory Effects 0.000 claims abstract description 14
- 238000003780 insertion Methods 0.000 claims abstract description 7
- 230000037431 insertion Effects 0.000 claims abstract description 7
- 230000005055 memory storage Effects 0.000 claims description 2
- 238000000034 method Methods 0.000 description 32
- 238000005516 engineering process Methods 0.000 description 15
- 230000008569 process Effects 0.000 description 12
- 238000012795 verification Methods 0.000 description 11
- 230000004044 response Effects 0.000 description 10
- 230000007547 defect Effects 0.000 description 4
- 238000012545 processing Methods 0.000 description 4
- 238000004590 computer program Methods 0.000 description 3
- 238000013523 data management Methods 0.000 description 3
- 238000010586 diagram Methods 0.000 description 3
- 230000006870 function Effects 0.000 description 3
- 230000002123 temporal effect Effects 0.000 description 3
- 238000012360 testing method Methods 0.000 description 3
- 238000005192 partition Methods 0.000 description 2
- 238000000638 solvent extraction Methods 0.000 description 2
- 238000010200 validation analysis Methods 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 238000013500 data storage Methods 0.000 description 1
- 238000002474 experimental method Methods 0.000 description 1
- 238000012423 maintenance Methods 0.000 description 1
- 238000007726 management method Methods 0.000 description 1
- 230000007246 mechanism Effects 0.000 description 1
- 238000010295 mobile communication Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000003672 processing method Methods 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 239000007787 solid Substances 0.000 description 1
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 the technical field of internet databases, and particularly relates to a block chain space-time data query system and electronic equipment.
Background
The block chain technology, also called as distributed book technology, is a novel application mode of computer technologies such as distributed data storage, point-to-point transmission, consensus mechanism, encryption algorithm, and the like. The blockchain is a brand new decentralized infrastructure and distributed computing paradigm that has been gradually created with the increasing popularity of digital cryptocurrency, such as bitcoin. Because the block chain has the advantages of decentralization, time sequence data, collective maintenance, safety, credibility and the like, in recent years, the block chain has been widely applied to industries such as finance, medical treatment, education and the like, and the industrial and academic circles are also exploring more application scenes of the block chain. The advent of blockchain technology has spurred the creation of a large number of new applications in various fields including spatiotemporal data management, for example, considering supply chain scenarios in which items are tracked during transportation. The demand during transportation not only requires constant updates of spatiotemporal information, but should also support rapid queries of spatiotemporal data, such as listing all data at l at time t, or all data at l from time t1 to time t 2. However, the current block chain technology cannot efficiently respond to the query of the spatio-temporal data, and the efficient query research on the spatio-temporal data has been attracting attention in the database, and if the efficient spatio-temporal data query can be performed on the block chain, the block chain technology has wide application prospects.
The block chain utilizes a Merkle tree to hash the transaction data in blocks, wherein each block comprises a block head and a block body, the block head is used for linking to the previous block to provide integrity for the block chain, and the block body comprises a data record in the process of creating the verified block. When data in the block chain needs to be inquired, the transaction data of the current block can be inquired through the block body, and the previous block of the current block in the block chain can be found through the block head. At present, for data query in a certain data mode in a block chain, it is necessary to query the transaction data in the block body of the block from the latest added block in the block chain, and then trace back to the previous block through the block head for query, and so on, and traverse the transaction data of the whole block chain.
In summary, the prior art block chain technology has the following disadvantages: 1) the method does not support the efficient management of the time and space data, and comprises the effective storage of the time and space data and the efficient query of the time and space data; 2) the query of the current block chain on the data needs to be performed on a block by a block, wherein the block is newly added to the block chain, and the block is traced back to the previous block through the block head of the current block chain; 3) the current block chain data query response method is not suitable for querying frequently-changed space-time data; 4) there is also no index to the spatial coordinate data to speed up the whole process; 5) in the block chain system, more than one complex index is often needed to build an index for the multidimensional data of the space-time data, which is not only very tedious but also has a large overhead.
Disclosure of Invention
The present application provides a block chain spatiotemporal data query system and an electronic device, which aim to solve at least one of the above technical problems in the prior art to a certain extent.
In order to solve the above problems, the present application provides the following technical solutions:
a system for block chain spatiotemporal data query, comprising:
a block chain module: for storing block data;
a data insertion module: the block chain module is electrically connected with the block chain module;
the time range searching module: the block chain module is electrically connected with the block chain module;
a spatial range search module: the time range searching module is electrically connected with the block chain module;
and the topological structure G of the directed acyclic graph in the block chain module is set as two parts of a node set V and an edge set E.
Preferably, time meta-information is set in the header of each block in the block chain module;
the topology G has a number of source nodes s for each V e V.
Preferably, the root node information in the block header is based on a tree index structure combining a Merkle tree and a kd-tree; and the root node is respectively connected with the root node of the right subtree and the root node of the left subtree.
In order to solve the above technical problem, an embodiment of the present application further provides an electronic device, including: at least one processor; and a memory communicatively coupled to the at least one processor; wherein,
the memory storage is provided with the block chain module, and the processor is provided with the data insertion module, the time range searching module and the space range searching module.
Compared with the prior art, the embodiment of the application has the advantages that: the block chain spatiotemporal data query system and the electronic equipment in the embodiment of the application form a new tree index by combining the Merkle tree and the kd tree to store spatiotemporal data in the block chain system on a directed acyclic graph structure, and based on the new tree index, blocks conforming to a time range are screened in the directed acyclic graph, and data conforming to a space range are queried in the screened blocks. Compared with the prior art, the embodiment of the application has the advantages that:
1. according to the method, the storage structure of the block chain is adjusted to the corresponding block chain module for inquiring the block chain module, the block chain module is designed for space-time data, and the block chain module can accord with the application scene of the block chain on the space-time data management;
2. according to the method, specific time meta-information is added into the head of each block and is used for recording the time interval of the spatio-temporal data in the block, the block meeting the limit can be quickly found through given time limit during query, corresponding data in the block can be positioned according to the index combining the Merkle tree and the kd tree, and the defects that each query response in the prior art needs to traverse each block and the data in each block is read very inefficiently are overcome;
3. the defect that a block chain system is difficult to establish a non-complex index structure for multidimensional data is overcome, a tree index structure combining a Merkle tree and a kd tree is established for spatial data, and key values obtained through the tree index can be used for quickly positioning original data;
4. aiming at the situation that the space-time data is more applied to frequent updating, the data structure in the block chain module adopts a directed acyclic graph structure (DAG) with faster verification time, and the verification time of the structure is superior to that of a chain structure.
Drawings
FIG. 1 is a block chain spatiotemporal data query system according to an embodiment of the present application;
FIG. 2 is a block chain spatiotemporal data query system according to an embodiment of the present application;
FIG. 3 is a directed acyclic graph of an embodiment of the present application;
FIG. 4 is a diagram of an example of a response to a spatiotemporal scope query performed on a directed acyclic graph in accordance with an embodiment of the present application;
FIG. 5 is a flow diagram of a block chain spatiotemporal data query system according to an embodiment of the present application;
FIG. 6 is a flow chart of a time range search of an embodiment of the present application;
fig. 7 is a flowchart of a spatial range search provided by an embodiment of the present application.
Detailed Description
In order to make the objects, technical solutions and advantages of the present application more apparent, the present application is described in further detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the present application and are not intended to limit the present application.
Please refer to fig. 1, which is a block chain spatiotemporal data query system according to an embodiment of the present application. The block chain space-time data query system comprises: the device comprises a block chain module for storing block data and a data insertion module electrically connected with the block chain module; the time range searching module is electrically connected with the block chain module; the space range searching module is electrically connected with the block chain module through the time range searching module; the topological structure G of the directed acyclic graph in the block chain module is set as two parts of a node set V and an edge set E.
Preferably, time meta-information is set in each block header in the block chain module to facilitate the retrieval of the time range searching module;
as shown in fig. 3, the topology G has a plurality of source nodes s for each V e V (node V belonging to the node set V). The source node s is a node having an in-degree of 0 in the directed acyclic graph. For each node v in the topology G, they are verified by subsequent nodes, which are in turn verified by further subsequent nodes. By analogy, it can be known that the block nodes newly added to the topology G have no subsequent nodes to verify them, so they are the source nodes s to be verified. By utilizing the source node s, the previously verified nodes can be traced back, and the whole topological structure G of the directed acyclic graph can be conveniently traversed.
Preferably, the root node information in the block header is based on a tree index structure combining a Merkle tree and a kd tree; the root node is respectively connected with the root node of the right subtree and the root node of the left subtree.
Specifically, the data insertion module: the block chain module is also used for inserting the spatio-temporal data in the block chain system into a tree index structure based on the combination of a Merkle tree and a kd tree in the updating process of the block chain blocks and storing the spatio-temporal data in the block chain module; meanwhile, for each block in the block chain module, time meta-information is introduced in the block header; in the embodiment of the application, the structure of the spatio-temporal data in the block chain adopts a tree index structure based on the combination of a Merkle tree and a kd tree. Wherein, the Merkle tree is a tree structure for storing hash values, the leaves thereof are hash values of data, and the non-leaf nodes are hash values of the series strings of the corresponding child nodes thereof. And the kd-tree is a binary tree constructed for multi-dimensional euclidean space partitioning and also represents a partition of k-dimensional space formed by k-dimensional data sets, i.e. each node in the tree corresponds to a k-dimensional hyper-rectangle. And combining the two, namely the data in the kd tree nodes, and carrying out hash processing according to the Merkle tree rule. The Merkle Patricia-trie is used for storing key value pairs of the space-time data, and the key values obtained through the tree index structure can be conveniently and quickly positioned to the original data. And for the time meta-information added into each block header, the time interval for recording the spatio-temporal data in the block, when in query, the block which is in accordance with the time range can be quickly found through a given time range, and corresponding data in the block can be positioned according to a tree index structure which combines a Merkle tree and a kd tree.
The time range searching module: the method is also used for setting a time range and a space range corresponding to the spatio-temporal data in the spatio-temporal data query process, and searching blocks conforming to the time range in the topological structure G (V, E) of the Directed Acyclic Graph (DAG) by using the time meta-information in the block headers of the blocks in the block chain module; in the embodiment of the application, in the block chain technology, a Directed Acyclic Graph (DAG) with shorter verification time is selected, so that the efficiency of the block chain can be improved, blocks can be output in parallel in a network, and the verification time is shorter. In a DAG network, each transaction is validated requiring a link to a more recent transaction that already exists in the network, such that the width of the network remains within a certain range, allowing the new transaction to have a faster validation time.
Given a time horizon β, first search for tiles satisfying a condition according to β on a DAG topology G (V, E). As shown in FIG. 3, topology G has multiple source nodes s (i.e., new) for each V ∈ V (i.e., new)The method comprises the steps of adding nodes to be verified in a directed acyclic graph), starting query by a source node, and considering the nearest previous node of a current point for subsequent query, wherein the blocks of each directed acyclic graph are searched in a time range by a breadth-first algorithm (BFS), concretely, the time range searching mode of a time range searching module is that a given time range β is equal to a given time range (starting time and ending time), the current latest verification block returned by a GetRecustAccepted (G) function is utilized, so that the BFS is started to run, and in the execution process of the BFS, if the time meta-information in the block header is within a given time range β, namely,the tile is placed in the result set and when the searched tile is outside the time range β or the end time of the time meta-information in all the next tile headers is less than the start time of β, the running BFS is terminated.
A spatial range search module: the system is also used for reading root node information of a tree index structure based on combination of a Merkle tree and a kd tree in each block head conforming to the time range, then accessing the whole tree index structure based on combination of the Merkle tree and the kd tree from top to bottom, searching key data conforming to the space range, and then obtaining corresponding original space-time data through a Merkle Patricia-trie technology according to the key data; the method provides an efficient block chain query response method aiming at space-time data, so that queries such as all data of a region in an s time period can be supported.
Further, the spatial range search module has a spatial range search mode: after the time range searching module finishes searching, a root node of a tree index structure based on the combination of a Merkle tree and a kd tree is obtained from the block head of the block, and a given space range is compared with tree nodes all the time from the root node to the lower part along a simple path; if the given space range is larger than the tree node, the path enters the right subtree of the tree, if the given space range is smaller than the tree node, the path enters the left subtree of the tree until a hyper-rectangle conforming to the space range is accessed, and data in the hyper-rectangle is returned; for the returned data, because the returned data are all hash values, a root node of the key-value pair index based on the Merkle Patricia-trie technology needs to be found in the block header; and converting the hash value data into original space-time data according to the key value pair index based on the Merkle Patricia-trie technology, and returning the original space-time data.
According to the method, a special test network is established on the tangle (based on the directed acyclic graph) of iota, and the space-time data on Pokemon Go is used for testing, so that the user can inquire the space-time data meeting the conditions on line in the test network by using the method provided by the application, and the inquiry response time is very fast. For the query mode, the experiment adopts a plurality of mainstream query modes: knn query, ball-point query, range query and bound knn query, the obtained results are all that the response speed satisfies the query of "online".
FIG. 2 is a block chain spatiotemporal data query system according to an embodiment of the present disclosure. As shown in fig. 7, the apparatus includes one or more processors and memory. Taking a processor as an example, the apparatus may further include: an input system and an output system.
The processor, memory, input system, and output system may be connected by a bus or other means, such as by a bus connection in fig. 2.
The memory, which is a non-transitory computer readable storage medium, may be used to store non-transitory software programs, non-transitory computer executable programs, and modules. The processor executes various functional applications and data processing of the electronic device, i.e., implements the processing method of the above-described method embodiment, by executing the non-transitory software program, instructions and modules stored in the memory.
The memory may include a storage program area and a storage data area, wherein the storage program area may store an operating system, an application program required for at least one function; the storage data area may store data and the like. Further, the memory may include high speed random access memory, and may also include non-transitory memory, such as at least one disk storage device, flash memory device, or other non-transitory solid state storage device. In some embodiments, the memory optionally includes memory located remotely from the processor, and these remote memories may be connected to the processing system over a network. Examples of such networks include, but are not limited to, the internet, intranets, local area networks, mobile communication networks, and combinations thereof.
The input system may receive input numeric or character information and generate a signal input. The output system may include a display device such as a display screen.
The one or more modules are stored in the memory and, when executed by the one or more processors, perform the following for any of the above method embodiments:
step a: inserting the spatiotemporal data in the block chain system into a tree index structure based on the combination of a Merkle tree and a kd tree, and storing the spatiotemporal data in a block chain module; for each block in the blockchain module, introducing temporal meta-information in a block header;
step b: giving a time range and a space range corresponding to the spatio-temporal data, and searching blocks conforming to the time range in a topological structure G of the directed acyclic graph by using time meta-information in each block head in the block chain module;
step c: and reading root node information of a tree index structure based on the combination of the Merkle tree and the kd tree in the block header conforming to the time range, searching key data conforming to the space range, and obtaining corresponding space-time data according to the key data.
The product can execute the method provided by the embodiment of the application, and has the corresponding functional modules and beneficial effects of the execution method. For technical details that are not described in detail in this embodiment, reference may be made to the methods provided in the embodiments of the present application.
Embodiments of the present application provide a non-transitory (non-volatile) computer storage medium having stored thereon computer-executable instructions that may perform the following operations:
step a: inserting the spatiotemporal data in the block chain system into a tree index structure based on the combination of a Merkle tree and a kd tree, and storing the spatiotemporal data in a block chain module; for each block in the blockchain module, introducing temporal meta-information in a block header;
step b: giving a time range and a space range corresponding to the spatio-temporal data, and searching blocks conforming to the time range in a topological structure G of the directed acyclic graph by using time meta-information in each block head in the block chain module;
step c: and reading root node information of a tree index structure based on the combination of the Merkle tree and the kd tree in the block header conforming to the time range, searching key data conforming to the space range, and obtaining corresponding space-time data according to the key data.
Embodiments of the present application provide a computer program product comprising a computer program stored on a non-transitory computer readable storage medium, the computer program comprising program instructions that, when executed by a computer, cause the computer to perform the following:
step a: inserting the spatiotemporal data in the block chain system into a tree index structure based on the combination of a Merkle tree and a kd tree, and storing the spatiotemporal data in a block chain module; for each block in the blockchain module, introducing temporal meta-information in a block header;
step b: giving a time range and a space range corresponding to the spatio-temporal data, and searching blocks conforming to the time range in a topological structure G of the directed acyclic graph by using time meta-information in each block head in the block chain module;
step c: and reading root node information of a tree index structure based on the combination of the Merkle tree and the kd tree in the block header conforming to the time range, searching key data conforming to the space range, and obtaining corresponding space-time data according to the key data.
Please refer to fig. 5, which is a flowchart illustrating a block chain spatiotemporal data query system according to an embodiment of the present application. The block chain space-time data query system comprises the following steps:
step 100: in the updating process of the block chain blocks, inserting the spatio-temporal data in the block chain system into a tree index structure based on the combination of a Merkle tree and a kd tree, and storing the spatio-temporal data in a block chain module; meanwhile, for each block in the block chain module, time meta-information is introduced in the block header;
in step 100, the spatio-temporal data is structurally in a block chain, and a tree index structure based on the combination of a Merkle tree and a kd tree is adopted in the application. Wherein, the Merkle tree is a tree structure for storing hash values, the leaves thereof are hash values of data, and the non-leaf nodes are hash values of the series strings of the corresponding child nodes thereof. And the kd-tree is a binary tree constructed for multi-dimensional euclidean space partitioning and also represents a partition of k-dimensional space formed by k-dimensional data sets, i.e. each node in the tree corresponds to a k-dimensional hyper-rectangle. And combining the two, namely the data in the kd tree nodes, and carrying out hash processing according to the Merkle tree rule. The Merkle Patricia-trie is used for storing key value pairs of the space-time data, and the key values obtained through the tree index structure can be conveniently and quickly positioned to the original data. And for the time meta-information added into each block header, the time interval for recording the spatio-temporal data in the block, when in query, the block which is in accordance with the time range can be quickly found through a given time range, and corresponding data in the block can be positioned according to a tree index structure which combines a Merkle tree and a kd tree.
Step 200: in the process of spatio-temporal data query, a time range and a space range corresponding to spatio-temporal data are given, and blocks conforming to the time range are searched in a topological structure G (V, E) of a Directed Acyclic Graph (DAG) by utilizing time meta-information in each block head in a block chain module; the node set of the topological structure G is V, and the edge set of the topological structure G is E.
In step 200, in the block chain technology, a Directed Acyclic Graph (DAG) with shorter verification time is selected, which can improve the efficiency of the block chain, so that blocks can be output in parallel in the network, and the verification time is shorter. In a DAG network, each transaction is validated requiring a link to a more recent transaction that already exists in the network, such that the width of the network remains within a certain range, allowing the new transaction to have a faster validation time. A directed acyclic graph is shown in fig. 3.
Given a time horizon β, firstly, searching blocks satisfying conditions on a DAG topology G (V, E) according to β. As shown in FIG. 3, the topology G has a plurality of source nodes s for each V E V (namely the source nodes s are nodes to be verified newly added into the directed acyclic graph topology G), starting a query by the source nodes, and considering the nodes nearest to the current point for the subsequent query.
Specifically, please refer to fig. 6, which is a flowchart illustrating time range searching according to an embodiment of the present disclosure. The step of time range searching comprises:
step 201, given a time range β (start time, end time), using a getrobustaccepted (g) function to return the current latest verification block, thereby starting to run BFS;
step 202, during the execution of BFS, if the time meta information in the chunk header is within a given time range β, i.e., putting the block into a result set;
and step 203, when the searched blocks are out of the time range β or the end time of the time meta-information in all the next block headers is less than the start time of β, terminating the operation of BFS.
Step 300: for each block which accords with the time range, reading root node information of a tree index structure based on the combination of a Merkle tree and a kd tree in the block head of each block, then accessing the whole tree index structure based on the combination of the Merkle tree and the kd tree from top to bottom, searching key data which accords with the space range, and obtaining corresponding original space-time data through a Merkle Patricia-trie technology according to the key data;
in step 300, the present application proposes an efficient block chain query response method for spatio-temporal data, so that it can support queries such as "all data in a region l in a time period s".
The main process of the spatial range search is a tree traversal process, and specifically, refer to fig. 7, which is a flowchart of the spatial range search according to the embodiment of the present application. The step of spatial range search comprises:
step 301: obtaining a root node of a tree index structure based on the combination of a Merkle tree and a kd-Tree from a block head of a block conforming to a time range, and comparing a given space range with tree nodes all the time from the root node downwards along a simple path;
step 302: if the given space range is larger than the tree node, the path enters the right subtree of the tree, if the given space range is smaller than the tree node, the path enters the left subtree of the tree until a hyper-rectangle conforming to the space range is accessed, and data in the hyper-rectangle is returned;
step 303: for the returned data, because the returned data are all hash values, a root node of the key-value pair index based on the MerklePatricia-trie technology needs to be found in the block header;
step 304: and converting the hash value data into original space-time data according to the key value pair index based on the Merkle Patricia-trie technology, and returning the original space-time data.
Note that the spatial range search process will process all blocks that fit a given time range once, and the resulting returned data is the spatio-temporal data that fits the spatio-temporal query requirements. FIG. 4 is a diagram of an example of a response to a spatiotemporal range query performed on a directed acyclic graph. Firstly, obtaining blocks in a given time range according to the given time range, then, searching a corresponding hyper-rectangle in each block according to the given space range, and returning a data result in the hyper-rectangle.
The block chain spatiotemporal data query system and the electronic equipment in the embodiment of the application form a new tree index by combining the Merkle tree and the kd tree to store spatiotemporal data in the block chain system on a directed acyclic graph structure, and based on the new tree index, blocks conforming to a time range are screened in the directed acyclic graph, and data conforming to a space range are queried in the screened blocks. Compared with the prior art, the embodiment of the application has the advantages that:
1. the method is designed aiming at the spatio-temporal data from the adjustment of the storage structure of the block chain to the query of the block chain system on the data, and can accord with the application scene of the block chain on the spatio-temporal data management;
2. the space-time data query method is very efficient, results meeting given requirements can be returned rapidly in an 'on-line mode', the speed from generation to verification of the blocks is greatly improved, the designed efficient indexes are all light in weight, the occupied space is small, and the requirements of space-time block chains are met;
3. the query response process is simple and convenient to realize, and can be suitable for various mainstream spatio-temporal data queries such as knn and range query;
4. according to the method, specific time meta-information is added into the head of each block and is used for recording the time interval of the spatio-temporal data in the block, the block meeting the limit can be quickly found through given time limit during query, corresponding data in the block can be positioned according to the index combining the Merkle tree and the kd tree, and the defects that each query response in the prior art needs to traverse each block and the data in each block is read very inefficiently are overcome;
5. the method improves the defect that a block chain system is difficult to establish a non-complex index structure for multidimensional data, establishes a tree index combining a Merkle tree and a kd tree aiming at spatial data, and makes key value pairs by utilizing Merkle Patricia-trie for each time-space data, so that the key values obtained through the tree index can be conveniently and quickly positioned to original data;
6. aiming at the situation that the space-time data is mostly applied to frequent updating, the block chain adopts a directed acyclic graph structure (DAG) with faster verification time, and the verification time of the structure is superior to that of a chain structure.
The previous description of the disclosed embodiments is provided to enable any person skilled in the art to make or use the present application. Various modifications to these embodiments will be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other embodiments without departing from the spirit or scope of the application. Thus, the present application is not intended to be limited to the embodiments shown herein but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.
Claims (4)
1. A system for block chain spatiotemporal data query, comprising:
a block chain module: for storing block data;
a data insertion module: the block chain module is electrically connected with the block chain module;
the time range searching module: the block chain module is electrically connected with the block chain module;
a spatial range search module: the time range searching module is electrically connected with the block chain module;
and the topological structure G of the directed acyclic graph in the block chain module is set as two parts of a node set V and an edge set E.
2. The system according to claim 1, wherein time meta-information is set in each blockhead of the blockchain module;
the topology G has a number of source nodes s for each V e V.
3. The system of claim 2, wherein the root node information in the chunk header is based on a tree index structure combining a Merkle tree and a kd-tree; and the root node is respectively connected with the root node of the right subtree and the root node of the left subtree.
4. An electronic device, comprising: at least one processor; and a memory communicatively coupled to the at least one processor; wherein,
the memory storage is provided with a blockchain module according to any one of claims 1 to 3, and the processor is provided with a data insertion module, a time range search module and a space range search module according to any one of claims 1 to 3.
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 (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112039823A (en) * | 2019-06-03 | 2020-12-04 | 厦门本能管家科技有限公司 | Instant random block output method and system for block chain |
| CN113495881A (en) * | 2020-03-19 | 2021-10-12 | 中科星图股份有限公司 | Method and system for mass tile data migration and format conversion |
| 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 (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112039823A (en) * | 2019-06-03 | 2020-12-04 | 厦门本能管家科技有限公司 | Instant random block output method and system for block chain |
| 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 |
| CN113495881A (en) * | 2020-03-19 | 2021-10-12 | 中科星图股份有限公司 | Method and system for mass tile data migration and format conversion |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108595720B (en) | Block chain space-time data query method, system and electronic equipment | |
| CN208781225U (en) | A kind of block chain spatiotemporal data warehouse system and electronic equipment | |
| US11520780B2 (en) | Distributed database systems and structures | |
| US11762876B2 (en) | Data normalization using data edge platform | |
| CN106663056B (en) | Metadata index search in a file system | |
| CN103577123B (en) | A kind of small documents optimization based on HDFS stores method | |
| CN111324577B (en) | Yml file reading and writing method and device | |
| CN112287182A (en) | Graph data storage and processing method and device and computer storage medium | |
| CN105706078A (en) | Automatic definition of entity collections | |
| US11126622B1 (en) | Methods and apparatus for efficiently scaling result caching | |
| CN112800067A (en) | Range query method and device, computer readable storage medium and electronic equipment | |
| CN113704248B (en) | Block chain query optimization method based on external index | |
| US20200226153A1 (en) | Execution of queries in relational databases | |
| CN116561382A (en) | Data processing method, device, equipment and storage medium of graph database | |
| Phan | Cloud Databases for Internet-of-Things Data | |
| CN114048219A (en) | Graph database updating method and device | |
| US20170031909A1 (en) | Locality-sensitive hashing for algebraic expressions | |
| CN114416741A (en) | KV data writing and reading method and device based on multi-level index and storage medium | |
| CN113779025A (en) | Optimization method, system and application of classified data retrieval efficiency in block chain | |
| CN113468383A (en) | Family relation map searching method and device, electronic equipment and storage medium | |
| CN115221360A (en) | Tree structure configuration method and system | |
| US11797485B2 (en) | Frameworks for data source representation and compression | |
| Čerešňák et al. | Improvement of Data Searching in MongoDB with the Use of Oracle Database | |
| Blume et al. | Towards an incremental schema-level index for distributed linked open data graphs | |
| KR20240041205A (en) | KEY-VALUE database system using decentralized addressing P2P storage as a file system, its method and computer program |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| GR01 | Patent grant | ||
| GR01 | Patent grant |