CN102169504A - Database indexing method for monitoring satellite ground equipment - Google Patents
Database indexing method for monitoring satellite ground equipment Download PDFInfo
- Publication number
- CN102169504A CN102169504A CN 201110119671 CN201110119671A CN102169504A CN 102169504 A CN102169504 A CN 102169504A CN 201110119671 CN201110119671 CN 201110119671 CN 201110119671 A CN201110119671 A CN 201110119671A CN 102169504 A CN102169504 A CN 102169504A
- Authority
- CN
- China
- Prior art keywords
- tree
- leaf node
- index
- node
- collection point
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Abstract
The invention discloses a database indexing method for monitoring satellite ground equipment. In the method, a hash table, B<+> tree and digital compression tree mixed index is used to replace a common hash table and B<+> tree index mechanism in a real-time database according to the characteristics and retrieval requirements of real-time data in the process of monitoring the satellite ground equipment, so that index key compression and sequential storage are achieved, and real-time insertion and sequential inquiry of records are ensured.
Description
Technical field
The invention belongs to the database design technical field, relate to a kind of database index method that is used for the satellite ground monitoring of tools.
Background technology
Processing such as the satellite ground equipment monitoring system need be gathered mass data information, transmission, analysis-by-synthesis, calculating.Form as can be seen from supervisory system, data are ties of each functional module of contact.Along with the development of satellite ground application system, the functional requirement of uphole equipment supervisory system also is on the increase, is strengthened, and data volume also constantly enlarges, and the relation between the data also becomes increasingly complex.Therefore database technology need be introduced the satellite ground monitoring of tools, manage, handle data in the monitor procedure with database technology.But data distinguishing feature is to have time response in the satellite ground monitoring of tools, and effective time be of short duration, out-of-dately then lost efficacy.And with the relational database be the design object of the traditional database of representative be service data correctness, guarantee the low-cost of system and friendly user interface be provided.This Database Systems are effective, successful to traditional commercial affairs and affairs type application, but are difficult to be competent at for the real time data of frontier and the application requirements of Real-time Transaction.So, needing binding data storehouse technology and real-time technique, research has the real-time dataBase system of explicit timing restriction.
Index is as the storage engines of real-time data base, and the quality of its performance directly influences stability, reliability, the real-time of real-time data base.In the satellite ground monitoring of tools, real-time data base will face super amount real time data, up-to-date real time data must deposit database within a certain period of time in, and outmoded relatively historical data must retrieve corresponding value within a certain period of time when given key word.The characteristics of this super amount real time data do not considered in the tradition index, cause its index to insert and the real-time of inquiry on be difficult to reach requirement.
Summary of the invention
Technology of the present invention is dealt with problems and is: at the deficiencies in the prior art, proposed a kind of database index method that is used for the satellite ground monitoring of tools.Employing the invention solves the efficient storage of a large amount of relevant devices state real time datas in the satellite ground monitoring of tools and inquiry in order.
Technical solution of the present invention is:
A kind of database index method that is used for the satellite ground monitoring of tools among the present invention may further comprise the steps:
(1) to satellite ground monitored device set device collection point, and the equipment collection point is identified with device descriptor, the satellite ground watch-dog is being carried out in the process of real-time data acquisition, and setting up with the device descriptor is the Hash table of key word and corresponding to the B of each equipment collection point
+Tree changes step (2) over to; Described Hash table is used for navigating to B with device descriptor corresponding equipment collection point according to device descriptor
+Tree;
(2) gathering constantly, the device descriptor in the data of obtaining according to the slave unit collection point navigates to the B of equipment collection point by Hash table
+The root node of tree; Again constantly, determine the B of equipment collection point according to the collection in the data of obtaining
+The leaf node of tree changes step (3) over to;
(3) check B in the step (2)
+Whether the leaf node of tree is full of, if the leaf node underfill then will be gathered data storage constantly in leaf node corresponding to step (2); If leaf node is full of, then constantly set up the digital compression tree according to gathering, and with the data conversion storage stored in the leaf node in newly-established digital compression tree; If whole digital compression trees of leaf node all are full of, then change step (4) over to;
(4) to B
+The leaf node of tree divides, and forms new leaf node, and newly arrived data are successively carried out the operation of step (2) (3), sets up index.
In described step (3), adopt a kind of 256 rank compressed digital trees.
The present invention compared with prior art has following advantage:
The present invention adopts Hash table, B according to the characteristics and the retrieval requirement of real time data in the monitoring of tools of ground
+Tree and Judy array numeral tree hybrid index replace Hash table, B commonly used in the real-time data base
+Tree index mechanism reaches index key compression and sequential storage, and guarantees the real-time insertion of record and inquiry in order.
1) when to locking equipment collection point descriptor, the retrieval characteristic of Hash table can navigate to the B at place, equipment collection point fast
+Tree, B
+The equilibrium response of tree has significantly reduced the inquiry in the real-time data acquisition moment and has inserted needed disk addressing number of times, has guaranteed the real-time insertion and the fast query of record.
2) Judy array digital compression tree is fit to the LINEAR CONTINUOUS insertion of index, and effectively the key word of compressed index helps reducing the storage space that index itself takies.
3) Judy array digital compression tree is left in the continuous page, can utilize the handle up advantage of continuous data of disk to read the shared page of Judy array, after in case the page that reads is loaded into internal memory, can utilize the random character visit numeral tree record of internal memory again, this has also guaranteed the real-time insertion and the fast query of record.
Description of drawings
Fig. 1 is converted into narrow node pointer synoptic diagram for Judy array node pointer;
Fig. 2 is split into low layer leaf node synoptic diagram for the linear leaf node of Judy array;
Fig. 3 indexes narrow node pointer synoptic diagram for Judy array the outsider inserts;
Fig. 4 is a database index synoptic diagram of the present invention.
Embodiment
The invention will be further described below in conjunction with accompanying drawing.
If record in the fast access table needs to write down in the his-and-hers watches and sets up index.This paper Hash table, B
+Tree and Judy array digital compression are set and are set up index, and index key is the equipment collection point descriptor and the data acquisition moment, and index value is the object identifier of corresponding real time record.Be illustrated in figure 4 as database index synoptic diagram of the present invention, embodiment is as follows:
(1) when setting up index, be that key word is set up Hash table and corresponding to the B of each equipment collection point at first with the device descriptor of collection point for the real time record of certain collection point
+Tree.
(2) then with the collection of real time record constantly as key word at B
+Insert index in the tree.The B of this paper
+Two kinds of index are arranged in the leaf node: a kind of is index immediately, directly related with record, in leaf node, be stored as and (gather constantly, the object identifier of record) form, another kind is compressed tree index (Judyarray), point to a compressed tree, in leaf node, be stored as (gathering minimum value constantly in the compressed tree, the object identifier of compressed tree) form.
B when (3) initial
+The height of tree is 1, and along with index inserts node successively, this node will overflow.In database table, insert a new Judy array digital compression tree record (described Judy array digital compression tree is 256 rank) when overflowing, Judy array digital compression tree is advanced in whole index unloadings of leaf node, and will (gather minimum value constantly in the compressed tree, digital compression tree record object identifier) and insert B as a compressed tree index
+In the leaf node.
(4) when inserting index, check whether the index unloading to be advanced among the Judy array earlier.If Judyarray less than, then deposit Judy array in, otherwise this index directly is stored in B as index immediately
+In the leaf node of tree.Along with index inserts successively, B
+Tree node may overflow, when overflowing with these index unloadings immediately in a new Judy array, and new Judy array index inserted B
+In the leaf node.
(5) to highly surpassing 1 B
+Tree, index always is inserted in B
+The leaf intranodal, when leaf node overflowed and index unloading immediately can be advanced Judy array, leaf node may need to merge the brotgher of node because of the degree of filling of less than 50% or introduce external index from the brotgher of node, and this is operated with common B
+Tree.
(6) insertion successively of index an index finally can occur and both can't deposit into Judy array, also can't insert B as index immediately
+This situation of leaf node, i.e. B
+The leaf node has been full of really, with B
+The tree node division, splitting operation is with common B
+The splitting operation of tree.
B
+The visible list of references of insertion process of tree: Making B
+Tree cache conscious in mainmemory.In Proceedings of ACMSIGMOD Conference, 2000. following processes have been described immediately index, and how the process of Judy array compressed digital tree is advanced in unloading:
1) empty root pointer points to the Judy array numeral tree of not storing any index.
When 2) inserting the 1st to 31 index, root pointer points to single tree root leaf node (the tree root leaf node is with linear different with the bitmap leaf node, but similar is in linear leaf node).According to index number difference, the tree root leaf node need take 2,4,6,8,12,16,24,32,48,64 word spaces respectively.
3) when the tree root leaf node overflows, promptly insert the index number more than or equal to 32 o'clock, leaf node is converted into the branch node, branch node storage some " node pointers ", " node pointer " points to lower floor's branch node or leaf node or directly stores index.
4) when " node pointer immediately " when overflowing, it is converted to common " node pointer ", should " node pointer " point to linear leaf node.When the more index of further insertion, it may be converted to " node pointer " that points to the bitmap leaf node (have only when linear leaf node store be 1 byte index the time just may be converted to the bitmap leaf node).
5) when the insertion index causes leaf node to overflow, whether the algorithm inspection can be stored in current leaf node with index in the leaf node and the new index compression of inserting, because the index word joint number reduces, leaf node can hold more index.At this moment its " father node pointer " will be converted to " narrow node pointer " or will be converted to " node pointer " of " narrower " when " father node pointer " originally is exactly " narrow node pointer ", and Fig. 1 has showed that numeral tree on 32 bit platforms a certain " node pointer " transfers the process of " narrow node pointer " to.
6) along with more insertions of index, when the linear leaf node that causes storing 2-4 byte (at 32 bit platforms) index overflows,, it becomes the linear leaf node of " narrow node pointer " indication if can not reducing self level, can generate a new branch node so, new node is inserted between father's " node pointer " and linear leaf node, at this moment linear leaf node can be split at least two nodes, shows as Fig. 2.The new generally speaking branch node that inserts will be the linear branched node, if but the index in the previous linear leaf node when having big stochastic distribution character, the new branch node that inserts may be a bitmap type branch node.
7) when inserting the leaf node newly index " narrow node pointer " indication or branch node, if new index is " the outsider " (being that new index is outside the scope that " narrow node pointer " can be represented) to " narrow node pointer " indication node, algorithm generates a new linear branched node, be inserted between " narrow node pointer " and " narrow node pointer " indication node, the new index that inserts will leave in the new linear branched node as one " node pointer immediately ", and this stylish linear branched node has two branches.Fig. 3 has showed inserted the process that newly indexes " narrow node pointer " on 64 bit platform.
The unspecified part of the present invention belongs to general knowledge as well known to those skilled in the art.
Claims (2)
1. database index method that is used for the satellite ground monitoring of tools is characterized in that may further comprise the steps:
(1) to satellite ground monitored device set device collection point, and the equipment collection point is identified with device descriptor, the satellite ground watch-dog is being carried out in the process of real-time data acquisition, and setting up with the device descriptor is the Hash table of key word and corresponding to the B of each equipment collection point
+Tree changes step (2) over to; Described Hash table is used for navigating to B with device descriptor corresponding equipment collection point according to device descriptor
+Tree;
(2) gathering constantly, the device descriptor in the data of obtaining according to the slave unit collection point navigates to the B of equipment collection point by Hash table
+The root node of tree; Again constantly, determine the B of equipment collection point according to the collection in the data of obtaining
+The leaf node of tree changes step (3) over to;
(3) check B in the step (2)
+Whether the leaf node of tree is full of, if the leaf node underfill then will be gathered data storage constantly in leaf node corresponding to step (2); If leaf node is full of, then constantly set up the digital compression tree according to gathering, and with the data conversion storage stored in the leaf node in newly-established digital compression tree; If whole digital compression trees of leaf node all are full of, then change step (4) over to;
(4) to B
+The leaf node of tree divides, and forms new leaf node, and newly arrived data are successively carried out the operation of step (2) (3), sets up index.
2. a kind of database index method that is used for the satellite ground monitoring of tools according to claim 1 is characterized in that: adopt a kind of 256 exponent number word compressed tree in described step (3).
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2011101196716A CN102169504B (en) | 2011-05-10 | 2011-05-10 | Database indexing method for monitoring satellite ground equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2011101196716A CN102169504B (en) | 2011-05-10 | 2011-05-10 | Database indexing method for monitoring satellite ground equipment |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102169504A true CN102169504A (en) | 2011-08-31 |
| CN102169504B CN102169504B (en) | 2012-11-14 |
Family
ID=44490666
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2011101196716A Active CN102169504B (en) | 2011-05-10 | 2011-05-10 | Database indexing method for monitoring satellite ground equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102169504B (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102841945A (en) * | 2012-08-27 | 2012-12-26 | 广西大学 | Dynamic successive tree index cutting method based on query expansion likelihood model |
| CN103995855A (en) * | 2014-05-14 | 2014-08-20 | 华为技术有限公司 | Method and device for storing data |
| CN112948466A (en) * | 2021-03-15 | 2021-06-11 | 北京微纳星空科技有限公司 | Satellite data processing method and device, electronic equipment and storage medium |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6286004B1 (en) * | 1997-12-12 | 2001-09-04 | Ricoh Company, Ltd. | Distributed type of database system, consistency managing method for the same, and a computer-readable recording medium with a program for making a computer execute each step of the method stored therein |
| WO2003032201A1 (en) * | 2001-10-09 | 2003-04-17 | Wildblue Communications, Inc. | Performance enhancing proxy for high latency data |
| CN1885060A (en) * | 2005-06-20 | 2006-12-27 | 英华达(上海)电子有限公司 | Method for automatically loading map on GPS according to global satellite positioning signals |
-
2011
- 2011-05-10 CN CN2011101196716A patent/CN102169504B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6286004B1 (en) * | 1997-12-12 | 2001-09-04 | Ricoh Company, Ltd. | Distributed type of database system, consistency managing method for the same, and a computer-readable recording medium with a program for making a computer execute each step of the method stored therein |
| WO2003032201A1 (en) * | 2001-10-09 | 2003-04-17 | Wildblue Communications, Inc. | Performance enhancing proxy for high latency data |
| CN1885060A (en) * | 2005-06-20 | 2006-12-27 | 英华达(上海)电子有限公司 | Method for automatically loading map on GPS according to global satellite positioning signals |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102841945A (en) * | 2012-08-27 | 2012-12-26 | 广西大学 | Dynamic successive tree index cutting method based on query expansion likelihood model |
| CN102841945B (en) * | 2012-08-27 | 2015-06-17 | 广西大学 | Dynamic successive tree index cutting method based on query expansion likelihood model |
| CN103995855A (en) * | 2014-05-14 | 2014-08-20 | 华为技术有限公司 | Method and device for storing data |
| CN103995855B (en) * | 2014-05-14 | 2017-03-08 | 华为技术有限公司 | The method and apparatus of data storage |
| CN112948466A (en) * | 2021-03-15 | 2021-06-11 | 北京微纳星空科技有限公司 | Satellite data processing method and device, electronic equipment and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102169504B (en) | 2012-11-14 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107168657B (en) | Virtual disk hierarchical cache design method based on distributed block storage | |
| CN107423422B (en) | Spatial data distributed storage and search method and system based on grid | |
| US9754012B2 (en) | Efficient storage of data allowing for multiple level granularity retrieval | |
| CN103106286B (en) | Method and device for managing metadata | |
| CN102867071B (en) | Management method for massive network management historical data | |
| CN103294710B (en) | A kind of data access method and device | |
| CN109376156B (en) | Method for reading hybrid index with storage awareness | |
| CN104317800A (en) | Hybrid storage system and method for mass intelligent power utilization data | |
| CN106909641B (en) | Real-time data memory | |
| CN101944119B (en) | Real-time event management method for intelligent electronic equipment | |
| CN103020204A (en) | Method and system for carrying out multi-dimensional regional inquiry on distribution type sequence table | |
| CN104750859A (en) | Network storing method | |
| CN108021717B (en) | Method for implementing lightweight embedded file system | |
| CN103412916A (en) | Methods and device for multi-dimensionally storing and retrieving data of monitoring system | |
| CN110275920A (en) | Data query method, apparatus, electronic equipment and computer readable storage medium | |
| CN108052551A (en) | A kind of method for a large amount of time series datas of storage realized on REDIS | |
| CN105303456A (en) | Method for processing monitoring data of electric power transmission equipment | |
| CN107741947B (en) | Method for storing and acquiring random number key based on HDFS file system | |
| CN102508913A (en) | Cloud computing system with data cube storage index structure | |
| CN101707633A (en) | Message-oriented middleware persistent message storing method based on file system | |
| CN103092848A (en) | Method for storing and retrieving pictures | |
| CN102722584B (en) | Data storage system and method | |
| CN103905540A (en) | Object storage data distribution mechanism based on two-sage Hash | |
| CN106649722B (en) | Monitoring system high-frequency data storage and query method | |
| CN103793493A (en) | Method and system for processing car-mounted terminal mass data |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant |