CN111190930B - Fire-fighting equipment historical data positioning system and positioning method integrating hash and block - Google Patents

Fire-fighting equipment historical data positioning system and positioning method integrating hash and block Download PDF

Info

Publication number
CN111190930B
CN111190930B CN201911386098.8A CN201911386098A CN111190930B CN 111190930 B CN111190930 B CN 111190930B CN 201911386098 A CN201911386098 A CN 201911386098A CN 111190930 B CN111190930 B CN 111190930B
Authority
CN
China
Prior art keywords
data
fire
data block
fighting equipment
hash
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
Application number
CN201911386098.8A
Other languages
Chinese (zh)
Other versions
CN111190930A (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.)
Hangzhou Tpson Technology Co ltd
Original Assignee
Hangzhou Tpson Technology Co ltd
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 Hangzhou Tpson Technology Co ltd filed Critical Hangzhou Tpson Technology Co ltd
Priority to CN201911386098.8A priority Critical patent/CN111190930B/en
Publication of CN111190930A publication Critical patent/CN111190930A/en
Application granted granted Critical
Publication of CN111190930B publication Critical patent/CN111190930B/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
    • G06F16/20Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/24Querying
    • G06F16/245Query processing
    • G06F16/2455Query execution
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/22Indexing; Data structures therefor; Storage structures
    • G06F16/2219Large Object storage; Management thereof
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/22Indexing; Data structures therefor; Storage structures
    • G06F16/2228Indexing structures
    • G06F16/2255Hash tables

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)
  • Software Systems (AREA)
  • Computational Linguistics (AREA)
  • Fire Alarms (AREA)

Abstract

The invention relates to a fire-fighting equipment historical data positioning system and a positioning method integrating hash and block, wherein any data grid in a hash table corresponds to any fire-fighting equipment, any data grid in the hash table is matched with a plurality of data blocks, and the data of different sensors of the corresponding fire-fighting equipment are stored in the plurality of data blocks; acquiring fire-fighting equipment, establishing a corresponding relation among a hash table, data grids and the fire-fighting equipment according to the hash value, and establishing a corresponding relation among the data grids and data blocks of the sensor; and calculating a hash value of the current fire-fighting equipment, finding a corresponding data grid and a plurality of data blocks in the hash table, and extracting data based on time. According to the invention, through a hierarchical pointer relationship, the extraction speed of the historical data of the equipment is greatly improved, the acquisition speed and analysis performance of the fire fighting big data are ensured, a reliable big data source is provided, and the problem of rapidly and accurately positioning detailed information of the occurrence of alarm data or fault data of a certain piece of equipment in TB level data is solved.

Description

Fire-fighting equipment historical data positioning system and positioning method integrating hash and block
Technical Field
The present invention relates to computing; calculating; the technical field of counting, in particular to a fire fighting equipment historical data positioning system and a fire fighting equipment historical data positioning method integrating hash and blocking.
Background
Along with the large-scale application of the internet of things in the fire control field, the TB-level equipment data become normal, and when the data needs to be acquired, a great amount of time is consumed for searching a specific historical data of a specific piece of equipment in the huge amount of data, and meanwhile, the performance of a computer is greatly influenced.
The prior art has the advantages that the data is cached in the memory to be accelerated, but in fact, the data volume of the TB level can lead to the tension and even breakdown of the system memory, the data positioning engineering volume is large, the positioning speed is low, the working hours are greatly prolonged, and the service life of the system is shortened.
Disclosure of Invention
The invention solves the problems of the prior art that massive data are arranged in a memory, the subsequent searching is convenient, the system memory is tense and even crashed, the data positioning engineering quantity is large, the positioning speed is low, and the service life of the system is shortened when the positioning speed is extremely prolonged, and provides an optimized fusion hash and block fire-fighting equipment historical data positioning system and a positioning method, thereby solving the problem that the detailed information of certain equipment alarm data or fault data is quickly and accurately positioned in TB-level data along with the accumulation of fire-fighting equipment data.
The technical scheme adopted by the invention is that the fire fighting equipment historical data positioning system integrating hash and block comprises:
the hash tables are used for storing hash values of different fire-fighting equipment;
and a plurality of data blocks for storing data of different sensors of different fire fighting equipment;
any data grid in the hash table corresponds to any fire fighting equipment;
any data grid in the hash table is matched with a plurality of data blocks.
Preferably, indexes are arranged between any data grid in the hash table and the matched data blocks.
Preferably, the index is a head pointer and a tail pointer, the head pointer and the tail pointer point to a first data block and a last data block of a plurality of data blocks respectively, and the plurality of data blocks are sequentially connected.
Preferably, any device adds a sensor, then adds a new data block after the current last data block for recording the data of the added sensor, and the tail pointer points to the new last data block.
Preferably, either device reduces the sensor:
if the data block is not the sensor corresponding to the first data block and the last data block, the data block corresponding to the sensor is directly discarded, and the data blocks pointed by the tail pointer and the head pointer are unchanged;
if the first data block is the current first data block, marking the first data block, moving the head pointer backwards by one bit, discarding the marked data block, and setting the current pointed position of the head pointer as the new first data block;
if the last data block is the last data block, marking the last data block, advancing the tail pointer by one bit, discarding the marked data block, and setting the current pointed position of the tail pointer as the new last data block.
Preferably, the index comprises a pointer and an offset value, wherein the pointer is matched with the first data block or the last data block of the plurality of data blocks, and the sum of the offset value and 1 is equal to the number of the sensors of the current fire-fighting equipment; the data blocks are sequentially connected.
Preferably, any device adds a sensor, then the offset value is increased by 1, and a new data block is added after the current last data block or before the first data block for recording the data of the added sensor.
Preferably, either device reduces the sensor:
if the sensor corresponding to the first data block or the last data block pointed by the non-current index is not pointed, directly discarding the data block corresponding to the sensor, and subtracting 1 from the offset value;
if the sensor corresponding to the first data block or the last data block pointed by the current index is used, marking the first data block or the last data block, shifting the index backwards or forwards by one bit, taking the currently pointed data block as a new first data block or last data block, discarding marked data, and subtracting 1 from the offset value.
Preferably, any one of the data blocks corresponds to data of one sensor, and the data of the sensors in any one of the data blocks are sequentially arranged in time sequence.
The positioning method of the fire-fighting equipment historical data positioning system integrating hash and block comprises the following steps:
step 1: acquiring all fire-fighting equipment needing data tracking and positioning;
step 2: calculating hash values by using IDs of all fire-fighting equipment, establishing a plurality of hash tables according to the hash values, and corresponding any fire-fighting equipment by any data grid;
step 3: establishing an index by any data grid, and pointing to data blocks of a plurality of sensors corresponding to any fire-fighting equipment;
step 4: when any sensor data of any fire-fighting equipment needs to be positioned, calculating a hash value of the ID of the current fire-fighting equipment, searching a hash table, and finding a corresponding data grid;
step 5: based on the index corresponding to the data grid, finding a plurality of data blocks of the current fire-fighting equipment;
step 6: based on a preset index relation, finding out a data block needing to acquire data from the data grids;
step 7: data is extracted based on time.
The invention relates to an optimized fire-fighting equipment historical data positioning system and a positioning method integrating hash and blocking, which are characterized in that a plurality of hash tables for storing hash values of different fire-fighting equipment and a plurality of data blocks for storing data of different sensors of different fire-fighting equipment are established, any data grid in the hash tables corresponds to any fire-fighting equipment, and any data grid in the hash tables is matched with the data blocks; in the application process, acquiring all fire-fighting equipment needing data tracking and positioning, calculating corresponding hash values, establishing a plurality of hash tables according to the hash values, establishing corresponding relations between data grids and the fire-fighting equipment, and establishing corresponding relations between the data grids and data blocks of a plurality of sensors of the fire-fighting equipment; when any sensor data of any fire-fighting equipment is required to be positioned, calculating a hash value of an ID of the current fire-fighting equipment, searching a hash table, finding a corresponding data grid, further finding a plurality of data blocks of the current fire-fighting equipment, finding the data blocks needing to acquire data in the plurality of data grids based on a preset index relation, and extracting the data based on time.
The invention provides a rapid positioning method and a rapid positioning system for massive fire-fighting equipment historical data, which greatly improve the extraction speed of the equipment historical data by establishing a hierarchical pointer relationship, ensure the acquisition speed and analysis performance of the fire-fighting big data, provide a reliable big data source for a manager, and solve the problem of rapid and accurate positioning of detailed information of certain equipment alarm data or fault data in TB level data along with the accumulation of fire-fighting equipment data.
Drawings
FIG. 1 is a schematic structural diagram of embodiment 1 of the present invention;
FIG. 2 is a schematic structural diagram of embodiment 2 of the present invention;
in fig. 1 and 2, a fire-fighting device is taken as an example, and an arrow indicates a direction in which data points;
fig. 3 is a flow chart of the method of the present invention.
Detailed Description
The present invention will be described in further detail with reference to examples, but the scope of the present invention is not limited thereto.
The invention relates to a fire-fighting equipment historical data positioning system integrating hash and blocking, which comprises:
the hash tables are used for storing hash values of different fire-fighting equipment;
and a plurality of data blocks for storing data of different sensors of different fire fighting equipment;
any data grid in the hash table corresponds to any fire fighting equipment;
any data grid in the hash table is matched with a plurality of data blocks.
According to the invention, through establishing a plurality of hash tables for storing hash values of different fire-fighting equipment and a plurality of data blocks for storing data of different sensors of different fire-fighting equipment, any data grid in the hash tables corresponds to any fire-fighting equipment, and any data grid in the hash tables is matched with the plurality of data blocks.
According to the invention, by acquiring all fire-fighting equipment needing data tracking and positioning and calculating corresponding hash values, a plurality of hash tables are established according to the hash values, the corresponding relation between data grids and the fire-fighting equipment is established, and the corresponding relation between the data grids and the data blocks of a plurality of sensors of the fire-fighting equipment is established; when any sensor data of any fire-fighting equipment is required to be positioned, calculating a hash value of an ID of the current fire-fighting equipment, searching a hash table, finding a corresponding data grid, further finding a plurality of data blocks of the current fire-fighting equipment, finding the data blocks needing to acquire data in the plurality of data grids based on a preset index relation, and extracting the data based on time.
The invention provides a rapid positioning method and a rapid positioning system for massive fire-fighting equipment historical data, which greatly improve the extraction speed of the equipment historical data by establishing a hierarchical pointer relationship, ensure the acquisition speed and analysis performance of the fire-fighting big data, provide a reliable big data source for a manager, and solve the problem of rapid and accurate positioning of detailed information of certain equipment alarm data or fault data in TB level data along with the accumulation of fire-fighting equipment data.
An index is arranged between any data grid in the hash table and a plurality of matched data blocks.
In the invention, the index is arranged between the data lattice and the data block of the hash table, so that the data lattice can be conveniently and rapidly positioned to a plurality of corresponding data blocks for storing data.
In the present invention, at least two embodiments are included.
Example 1
The index is a head pointer and a tail pointer, the head pointer and the tail pointer point to a first data block and a last data block of a plurality of data blocks respectively, and the plurality of data blocks are connected in sequence.
Any device adds a sensor, then adds a new data block after the current last data block for recording the data of the added sensor, and the tail pointer points to the new last data block.
Either device reduces the sensor:
if the data block is not the sensor corresponding to the first data block and the last data block, the data block corresponding to the sensor is directly discarded, and the data blocks pointed by the tail pointer and the head pointer are unchanged;
if the first data block is the current first data block, marking the first data block, moving the head pointer backwards by one bit, discarding the marked data block, and setting the current pointed position of the head pointer as the new first data block;
if the last data block is the last data block, marking the last data block, advancing the tail pointer by one bit, discarding the marked data block, and setting the current pointed position of the tail pointer as the new last data block.
In this embodiment, the head pointer and the tail pointer define a plurality of data blocks corresponding to a certain data cell, and the data blocks are sequentially connected.
In this embodiment, if the sensor is to be added, the sensor is only required to be added after the tail pointer, and the addition is completed by moving the tail pointer backwards.
In this embodiment, when the sensors need to be reduced, if the data blocks corresponding to the head pointer or the tail pointer need to be reduced, the positions of the head pointer and the tail pointer need to be moved backward or forward, so as to ensure that the head pointer and the tail pointer still point to the data blocks of all the sensors corresponding to the current data grid; besides, only the data blocks need to be deleted directly, the positions of the head pointer and the tail pointer are unchanged, and the front data block and the rear data block of the deleted data blocks are connected.
Example 2
The index comprises a pointer and an offset value, wherein the pointer is matched with the first data block or the last data block of the data blocks, and the sum of the offset value and 1 is equal to the number of sensors of the current fire-fighting equipment; the data blocks are sequentially connected.
Any device adds a sensor, the offset value is increased by 1, and a new data block is added after the current last data block or before the first data block for recording the data of the added sensor.
Either device reduces the sensor:
if the sensor corresponding to the first data block or the last data block pointed by the non-current index is not pointed, directly discarding the data block corresponding to the sensor, and subtracting 1 from the offset value;
if the sensor corresponding to the first data block or the last data block pointed by the current index is used, marking the first data block or the last data block, shifting the index backwards or forwards by one bit, taking the currently pointed data block as a new first data block or last data block, discarding marked data, and subtracting 1 from the offset value.
In this embodiment, only one pointer is needed, and the offset value is set, where the pointer is only needed to align with the first or last data block, and the attribution division of all the data blocks is completed by adjusting the offset value.
In this embodiment, when the sensor needs to be added, the offset value is added at the end of the chain of data blocks, after the last data block when the pointer points to the first data block, and before the first data block when the pointer points to the last data block, and the offset value should be modified accordingly.
In this embodiment, when the sensor needs to be reduced, the basic principle is the same as that of embodiment 1, and the offset value needs to be modified accordingly.
Any one of the data blocks corresponds to the data of one sensor, and the data of the sensors in any one of the data blocks are sequentially arranged in time sequence.
In the present invention, in principle, the data records in each data block may be arranged according to a time sequence, so as to facilitate subsequent queries.
The invention also relates to a positioning method of the fire fighting equipment historical data positioning system fusing hash and block, which comprises the following steps:
step 1: acquiring all fire-fighting equipment needing data tracking and positioning;
step 2: calculating hash values by using IDs of all fire-fighting equipment, establishing a plurality of hash tables according to the hash values, and corresponding any fire-fighting equipment by any data grid;
step 3: establishing an index by any data grid, and pointing to data blocks of a plurality of sensors corresponding to any fire-fighting equipment;
step 4: when any sensor data of any fire-fighting equipment needs to be positioned, calculating a hash value of the ID of the current fire-fighting equipment, searching a hash table, and finding a corresponding data grid;
step 5: based on the index corresponding to the data grid, finding a plurality of data blocks of the current fire-fighting equipment;
step 6: based on a preset index relation, finding out a data block needing to acquire data from the data grids;
step 7: data is extracted based on time.
In the invention, the hash value obtained by ID calculation of the corresponding fire-fighting equipment is stored in the data grid.
In the invention, the index of the data grid points to a plurality of data blocks corresponding to a plurality of sensors of the current fire-fighting equipment.
In the invention, when new fire-fighting equipment needing data tracking and positioning exists, the hash table with idle data grids is directly distributed.
According to the invention, by establishing a plurality of hash tables for storing hash values of different fire-fighting equipment and a plurality of data blocks for storing data of different sensors of different fire-fighting equipment, any data grid in the hash tables corresponds to any fire-fighting equipment, and any data grid in the hash tables is matched with the plurality of data blocks; in the application process, acquiring all fire-fighting equipment needing data tracking and positioning, calculating corresponding hash values, establishing a plurality of hash tables according to the hash values, establishing corresponding relations between data grids and the fire-fighting equipment, and establishing corresponding relations between the data grids and data blocks of a plurality of sensors of the fire-fighting equipment; when any sensor data of any fire-fighting equipment is required to be positioned, calculating a hash value of an ID of the current fire-fighting equipment, searching a hash table, finding a corresponding data grid, further finding a plurality of data blocks of the current fire-fighting equipment, finding the data blocks needing to acquire data in the plurality of data grids based on a preset index relation, and extracting the data based on time.
The invention provides a rapid positioning method and a rapid positioning system for massive fire-fighting equipment historical data, which greatly improve the extraction speed of the equipment historical data by establishing a hierarchical pointer relationship, ensure the acquisition speed and analysis performance of the fire-fighting big data, provide a reliable big data source for a manager, and solve the problem of rapid and accurate positioning of detailed information of certain equipment alarm data or fault data in TB level data along with the accumulation of fire-fighting equipment data.

Claims (7)

1. A fire-fighting equipment historical data positioning system integrating hash and block is characterized in that: the system comprises:
the hash tables are used for storing hash values of different fire-fighting equipment;
and a plurality of data blocks for storing data of different sensors of different fire fighting equipment;
any data grid in the hash table corresponds to any fire fighting equipment;
indexes are arranged between any data grid in the hash table and a plurality of matched data blocks;
the index is a head pointer and a tail pointer, the head pointer and the tail pointer point to a first data block and a last data block of a plurality of data blocks respectively, the plurality of data blocks are connected in sequence,
or the index comprises a pointer and an offset value, wherein the pointer is matched with the first data block or the last data block of the data blocks, and the sum of the offset value and 1 is equal to the number of the sensors of the current fire-fighting equipment; the data blocks are sequentially connected.
2. The fused hash and chunk fire protection equipment history data locating system of claim 1 wherein: any device adds a sensor, then adds a new data block after the current last data block for recording the data of the added sensor, and the tail pointer points to the new last data block.
3. The fused hash and chunk fire protection equipment history data locating system of claim 1 wherein: either device reduces the sensor:
if the data block is not the sensor corresponding to the first data block and the last data block, the data block corresponding to the sensor is directly discarded, and the data blocks pointed by the tail pointer and the head pointer are unchanged;
if the first data block is the current first data block, marking the first data block, moving the head pointer backwards by one bit, discarding the marked data block, and setting the current pointed position of the head pointer as the new first data block;
if the last data block is the last data block, marking the last data block, advancing the tail pointer by one bit, discarding the marked data block, and setting the current pointed position of the tail pointer as the new last data block.
4. The fused hash and chunk fire protection equipment history data locating system of claim 1 wherein: any device adds a sensor, the offset value is increased by 1, and a new data block is added after the current last data block or before the first data block for recording the data of the added sensor.
5. The fused hash and chunk fire protection equipment history data locating system of claim 1 wherein: either device reduces the sensor:
if the sensor corresponding to the first data block or the last data block pointed by the non-current index is not pointed, directly discarding the data block corresponding to the sensor, and subtracting 1 from the offset value;
if the sensor corresponding to the first data block or the last data block pointed by the current index is used, marking the first data block or the last data block, shifting the index backwards or forwards by one bit, taking the currently pointed data block as a new first data block or last data block, discarding marked data, and subtracting 1 from the offset value.
6. The fused hash and chunk fire protection equipment history data locating system of claim 1 wherein: any one of the data blocks corresponds to the data of one sensor, and the data of the sensors in any one of the data blocks are sequentially arranged in time sequence.
7. A positioning method of the fire fighting equipment history data positioning system integrating hash and block according to one of claims 1 to 6, which is characterized in that: the method comprises the following steps:
step 1: acquiring all fire-fighting equipment needing data tracking and positioning;
step 2: calculating hash values by using IDs of all fire-fighting equipment, establishing a plurality of hash tables according to the hash values, and corresponding any fire-fighting equipment by any data grid;
step 3: establishing an index by any data grid, and pointing to data blocks of a plurality of sensors corresponding to any fire-fighting equipment;
step 4: when any sensor data of any fire-fighting equipment needs to be positioned, calculating a hash value of the ID of the current fire-fighting equipment, searching a hash table, and finding a corresponding data grid;
step 5: based on the index corresponding to the data grid, finding a plurality of data blocks of the current fire-fighting equipment;
step 6: based on a preset index relation, finding out a data block needing to acquire data from the data grids;
step 7: data is extracted based on time.
CN201911386098.8A 2019-12-29 2019-12-29 Fire-fighting equipment historical data positioning system and positioning method integrating hash and block Active CN111190930B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201911386098.8A CN111190930B (en) 2019-12-29 2019-12-29 Fire-fighting equipment historical data positioning system and positioning method integrating hash and block

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201911386098.8A CN111190930B (en) 2019-12-29 2019-12-29 Fire-fighting equipment historical data positioning system and positioning method integrating hash and block

Publications (2)

Publication Number Publication Date
CN111190930A CN111190930A (en) 2020-05-22
CN111190930B true CN111190930B (en) 2023-11-28

Family

ID=70707798

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201911386098.8A Active CN111190930B (en) 2019-12-29 2019-12-29 Fire-fighting equipment historical data positioning system and positioning method integrating hash and block

Country Status (1)

Country Link
CN (1) CN111190930B (en)

Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2006099524A (en) * 2004-09-30 2006-04-13 Nec Commun Syst Ltd Data structure and data search method
CN102682116A (en) * 2012-05-14 2012-09-19 中兴通讯股份有限公司 Method and device for processing table items based on Hash table
CN102779180A (en) * 2012-06-29 2012-11-14 华为技术有限公司 Operation processing method of data storage system and data storage system
CN103116615A (en) * 2013-01-28 2013-05-22 袁华强 Data index method and server based edition vector
US8751763B1 (en) * 2013-03-13 2014-06-10 Nimbus Data Systems, Inc. Low-overhead deduplication within a block-based data storage
DE202016105474U1 (en) * 2016-09-30 2016-11-17 Jumo Gmbh & Co. Kg Device for tamper-proof registration of measured values
CN106227741A (en) * 2016-07-12 2016-12-14 国家计算机网络与信息安全管理中心 A kind of extensive URL matching process based on multilevel hash index chained list
CN110069496A (en) * 2019-03-20 2019-07-30 韶关学院 A kind of Novel chain type Hash table construction method and device

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10545832B2 (en) * 2016-03-01 2020-01-28 International Business Machines Corporation Similarity based deduplication for secondary storage

Patent Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2006099524A (en) * 2004-09-30 2006-04-13 Nec Commun Syst Ltd Data structure and data search method
CN102682116A (en) * 2012-05-14 2012-09-19 中兴通讯股份有限公司 Method and device for processing table items based on Hash table
CN102779180A (en) * 2012-06-29 2012-11-14 华为技术有限公司 Operation processing method of data storage system and data storage system
CN103116615A (en) * 2013-01-28 2013-05-22 袁华强 Data index method and server based edition vector
US8751763B1 (en) * 2013-03-13 2014-06-10 Nimbus Data Systems, Inc. Low-overhead deduplication within a block-based data storage
CN106227741A (en) * 2016-07-12 2016-12-14 国家计算机网络与信息安全管理中心 A kind of extensive URL matching process based on multilevel hash index chained list
DE202016105474U1 (en) * 2016-09-30 2016-11-17 Jumo Gmbh & Co. Kg Device for tamper-proof registration of measured values
CN110069496A (en) * 2019-03-20 2019-07-30 韶关学院 A kind of Novel chain type Hash table construction method and device

Also Published As

Publication number Publication date
CN111190930A (en) 2020-05-22

Similar Documents

Publication Publication Date Title
US20180137134A1 (en) Data snapshot acquisition method and system
US11232073B2 (en) Method and apparatus for file compaction in key-value store system
CN111262756B (en) High-speed network elephant flow accurate measurement method and device
CN107704604B (en) Message persistence method, server and computer readable storage medium
EP3349126A1 (en) Method, device, storage medium, and apparatus for automatically discovering fuel station poi
CN104346384A (en) Method and device for processing small files
JP2020057416A (en) Method and device for processing data blocks in distributed database
CN104834648A (en) Log query method and device
CN112597345B (en) Automatic acquisition and matching method for laboratory data
CN104636401B (en) A kind of method and device of SCADA system data rewind
CN111722962A (en) Storage system and method for CDP data
CN111190930B (en) Fire-fighting equipment historical data positioning system and positioning method integrating hash and block
CN113084388A (en) Welding quality detection method, system, device and storage medium
CN112579820B (en) Time hopping video data processing method, device, medium and electronic equipment
CN104063245A (en) Memory analysis and optimization method and system based on garbage collection
CN105930839B (en) A kind of pillar of electrification rail contacting net bar intelligent identification Method
CN108762717B (en) Meter reading success recording method, statistical method and recruitment method based on Bit-map
CN117009610A (en) K line graph visualization system and method based on power data
CN111127700A (en) System index monitoring system for automatically driving automobile
CN109658985A (en) A kind of the de-redundancy optimization method and system of gene reference sequence
CN104461764B (en) A kind of FPGA configuration file generation method of built-in CRC check code
CN113946627A (en) Data accuracy detection early warning system and method under data real-time synchronization scene
CN111367775B (en) Problem node positioning method, computer device, and computer-readable storage medium
CN104734726A (en) Time series data online compression method supporting editing
CN108388665B (en) Method for inquiring and acquiring new data insertion position in data

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