CN110321353A - A kind of multidimensional space data indexing means based on half decomposition strategy - Google Patents

A kind of multidimensional space data indexing means based on half decomposition strategy Download PDF

Info

Publication number
CN110321353A
CN110321353A CN201910610784.2A CN201910610784A CN110321353A CN 110321353 A CN110321353 A CN 110321353A CN 201910610784 A CN201910610784 A CN 201910610784A CN 110321353 A CN110321353 A CN 110321353A
Authority
CN
China
Prior art keywords
node
hyperspace
code
spatial object
spatial
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN201910610784.2A
Other languages
Chinese (zh)
Other versions
CN110321353B (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.)
China University of Geosciences
Original Assignee
China University of Geosciences
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 China University of Geosciences filed Critical China University of Geosciences
Priority to CN201910610784.2A priority Critical patent/CN110321353B/en
Publication of CN110321353A publication Critical patent/CN110321353A/en
Application granted granted Critical
Publication of CN110321353B publication Critical patent/CN110321353B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/22—Indexing; Data structures therefor; Storage structures
    • G06F16/2228—Indexing structures
    • G06F16/2255—Hash tables
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/22—Indexing; Data structures therefor; Storage structures
    • G06F16/2228—Indexing structures
    • G06F16/2264—Multidimensional index structures
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/29—Geographical information databases

Landscapes

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

Abstract

The present invention provides a kind of multidimensional space data indexing means based on half decomposition strategy, tree construction process is decomposed including creation half, it is passed to a hyperspace node Node, judge spatial object geometry quantity, it carries out space and divides generated subspace, the most subspace of selection spatial object generates new hyperspace node LeafNode, and the segment space object in Node is moved to LeafNode, calculates LeafNode depth.A kind of use being reduced memory space based on the multidimensional space data indexing means of half decomposition strategy provided by the invention is reduced disk I/O number, can efficiently carry out the management of multidimensional space data, ensure the fluency of spatial database.

Description

A kind of multidimensional space data indexing means based on half decomposition strategy
Technical field
The present invention relates to a kind of multidimensional space data indexing means based on half decomposition strategy, belong to spatial information management skill Art field.
Background technique
Spatial index is the key that quick-searching data in spatial database, is to the data bit confidence being stored on medium The description of breath is the efficiency for improving system to data acquisition.Multidimensional space data has spatial distribution not under big data Uniformly, the features such as data volume is huge, structure is complicated, it is high to the retrieval performance requirement of spatial data, it is a huge challenge. In recent years there has been proposed a large amount of spatio-temporal index structure come support processing multidimensional space data spatial-temporal query, but still without The recall precision of method guarantee High dimensional space data.Can it be current that more efficient multidimensional space data indexing means thus be found People's urgent problem under big data era.
Currently, common spatial data index structure is mainly using tree index structure, there has been proposed a large amount of Spatio-temporal index structure supports the spatial-temporal query of multidimensional space data, these index structures are mostly from B-tree and R tree.Wherein Using R tree as representative to spatial data using space division mode, itself and its spatial data index knot that derives from Structure indicates to carry out representation space range using minimum boundary rectangle, and by the way that some other data parameterizations to be handled to multidimensional number According to.However its bounding rectangles, always greater than the range of hyperspace object itself, overlap problem is difficult to solve on high-dimensional, It is lower to update efficiency.Some common tree structures, such as quaternary tree and Octree, they are widely used in various fields, Including fields such as computational geometry, image procossings, but by the non-uniform feature of multi-dimensional data declustering, tree is unbalanced, shadow Ring tree depth, in addition set in itself be a kind of level structure, and these tree intermediate node itself often do not include space pair As when the depth of tree is deeper, intermediate node is more, these intermediate nodes for not including spatial object will generate huge storage The performance limitation in space, tree is serious.In addition to these, some indexes based on grid, such as LUGRID, GPR tree etc. use It inertia insertion and deletes to handle different inquiries, adds additional memory resident layer, but can not fundamentally promoted Search efficiency.In addition there are a kind of decomposition trees, by decomposition space generated subspace, and then intermediate node are omitted, but by Do not include intermediate node in it, can not judge that its lower layer space whether there is, need to be traversed for entire Hash table, inefficiency, separately It is outer by the way of decomposing completely, a large amount of leaf node, a large amount of committed memories and disk space can be generated, and be inserted into, deleting Remove, range query operation when need IO times more number.
In conclusion the hyperspace index technology of Most current is all difficult to have due to the influence of high dimensional data feature Higher efficiency is difficult to be applied well in actual multidimensional space data management kind.It is therefore desirable to propose one kind more Add efficient multidimensional space data indexing means.
Summary of the invention
In order to solve the deficiencies in the prior art, the present invention provides a kind of multidimensional space data ropes based on half decomposition strategy Draw method, the method reduce the uses of memory space, reduce disk I/O number, can efficiently carry out the pipe of multidimensional space data Reason, has ensured the fluency of spatial database.
The present invention is that technical solution used by solving its technical problem is: being provided a kind of based on the more of half decomposition strategy Tree construction process is decomposed in dimension space data index method, including creation half, specifically includes the following steps:
(a1) a hyperspace node Node is passed to half decomposition tree T ' of initialization；
(a2) judge whether the spatial object collective number of hyperspace node Node exceeds preset KB limit, if Without departing from, the data in hyperspace node Node are write back in disk, terminate creation process；Otherwise step is continued to execute (a3)；(a3) to hyperspace node Node according to the successive along the equalization for carrying out spatial dimension to each dimension is drawn of dimension Point, generate 2 or more subspaces；(a4) judge the spatial object quantity in every sub-spaces, the son for selecting spatial object most Space S ubNodemax, generate new hyperspace node LeafNode；
(a3) equalization of spatial dimension is carried out to each dimension according to the sequencing of dimension to hyperspace node Node It divides, generates 2 or more subspaces；
(a4) judge the spatial object quantity in every sub-spaces, the subspace SubNode for selecting spatial object mostmax, Generate new hyperspace node LeafNode；
(a5) by hyperspace node Node about SubNodemaxSpatial object be added in LeafNode, simultaneously Remove SubNode in hyperspace node NodemaxSpatial object；
(a6) return step (1), until the spatial object number of former space nodes Node and newly-generated LeafNode node Amount is no more than maximum limitation, enters step (a7)
(a7) depth _ depth of the LeafNode in half decomposition tree is calculated using shifting function；
(a8) _ depth is compared with the depth depth of full decomposition tree T, biggish number is taken to be assigned to depth；
(a9) return step (a1).
A kind of multidimensional space data indexing means based on half decomposition strategy provided by the invention further include insertion data mistake Journey, specifically includes the following steps:
(b1) a spatial object Object being inserted into is passed to half decomposition tree T '1；
(b2) Object is calculated1The integer coding of the hyperspace belonging to the bosom of half decomposition tree T ', is denoted as Code1；
(b3) using integer coding shifting function to Code1Shifting function is carried out upwards in turn, when searching in Hash table To Code1When, stop shifting function；
(b4) according to Code1Spatial object is read in disk, generation integer coding is Code1The first hyperspace section Point Node1；
(b5) by Object1It is added to Node1Spatial object set in；
(b6) to Node1Execute step (a1)~(a9) described in half decompose policing action, wherein by step (a1)~ (a9) Node in replaces with Node1It executes.
A kind of multidimensional space data indexing means based on half decomposition strategy provided by the invention further include inquiry data mistake Journey, specifically includes the following steps:
(c1) it is passed to a hyperspace range Envelope to be checked；
(c2) integer coding for calculating Envelope hyperspace belonging to the bosom of half decomposition tree T ', is denoted as Code2；
(c3) if Code2It is 0, illustrates that the corresponding hyperspace of half decomposition tree T ' cannot save from damage comprising search space, be Intersection or phase are from if mutually from directly return is empty；If intersection, enables Code2For the coding of the root node of half decomposition tree T ', execute Step (c5)；If otherwise Code2It is not 0, executes step (c4)；
(c4) judge Code2It whether there is in Hash table, there is no upper layer coding is obtained using integer shifting function, directly It include Code to Hash table2, read the Code2Data in magnetic disk, generation integer coding be Code2The second hyperspace node Node2, by Node2In spatial object set make comparisons with Envelope, add data into result after, return the result, terminate Program；If Code2Exist in Hash table, executes step (c5)；
(c5) Code is read2Corresponding data in magnetic disk generates Code2Corresponding hyperspace node Node2, by Node2 In spatial object make comparisons with the spatial dimension of Envelope, the spatial object for belonging to Envelope is added in result；
(c6) hyperspace node Node is decomposed2, 2 or more subspaces are generated, the corresponding integer of every sub-spaces is compiled Code traverses integer coding, judges, comprising then return step (c5), otherwise to enter step whether comprising the integer coding in Hash table Suddenly (c7)；
(c7) node data in releasing memory terminates inquiry by query result there is no returning.
A kind of multidimensional space data indexing means based on half decomposition strategy provided by the invention further include inquiry data mistake Journey, specifically includes the following steps:
(d1) it is passed to a spatial object to be deleted, is denoted as Object3；
(d2) Object is calculated3The integer coding of the hyperspace belonging to the bosom of half decomposition tree T ', is denoted as Code3；
(d3) if Code3Equal to 0, then Object3Not in the maximum hyperspace corresponding to half decomposition tree, terminate to delete Except process；Otherwise following operation is continued to execute:
(d4) using integer coding shifting function to Code3Shifting function is carried out upwards in turn, when searching in Hash table To Code3When, stop shifting function；
(d5) according to Code3Spatial object Object is read in disk3, generation integer coding is Code3Third multidimensional Space nodes Node3；
(d6) Node is successively traversed3Spatial Objects set searches whether that there are one and Object3Corresponding space pair Spatial object as attribute, if not finding, end operation discharges Node3Node；If finding, from spatial object set Delete the spatial object；
(d7) judge Node3Spatial object collective number whether be 0, if not 0, by Node3Data write back disk； Otherwise operation below is executed；
(d8) Node is set3Dimension be n, repunit i is from 0 to n2, by Code3It is obtained after shifted left n plus i Node3Subspace integer coding LeafCode3If finding LeafCode in Hash table3, end loop, modify disk in Node3Data；Conversely, also not finding LeafCode in Hash table when being recycled to end3, then Node is discharged3In disk The disk space occupied.
The present invention is based on beneficial effects possessed by its technical solution to be:
(1) it is provided by the invention it is a kind of based on the multidimensional space data indexing means of half decomposition strategy with half decomposition strategy come The spatial object scheduling for dispatching hyperspace and its subspace, can largely reduce hyperspace node, reduce memory and external memory The use in space efficiently reduces the number of disk I/O, promotes the efficiency of management of multidimensional space data；
(2) it is provided by the invention it is a kind of based on the multidimensional space data indexing means of half decomposition strategy using integer coding come The spatial dimension for defining hyperspace eliminates the range data storage to hyperspace, saves space to the maximum extent；
(3) it is provided by the invention it is a kind of based on the multidimensional space data indexing means of half decomposition strategy by Hash table come really The existence for determining hyperspace avoids the subordinate dependence of the front and back node of tree, can effectively promote the operation of program Speed；
(4) a kind of multidimensional space data indexing means based on half decomposition strategy provided by the invention adapt to different multidimensional Data are not limited by dimension, can be promoted and applied in various multidimensional space data management.
Detailed description of the invention
Fig. 1 is the node example figure of full decomposition tree.
Fig. 2 is the corresponding Hash table of full decomposition tree.
Fig. 3 is the node example figure of half decomposition tree.
Fig. 4 is the corresponding Hash table of half decomposition tree.
Fig. 5 is the flow diagram that tree construction process is decomposed in present invention creation half.
Fig. 6 is the flow diagram of present invention insertion data procedures.
Fig. 7 is the flow diagram of present invention inquiry data procedures.
Fig. 8 is the flow diagram that the present invention deletes data procedures.
Specific embodiment
Present invention will be further explained below with reference to the attached drawings and examples.
The present invention provides a kind of multidimensional space data indexing means based on half decomposition strategy, have the following characteristics that
(1) range that hyperspace locating for multidimensional subspace is defined by the way of integer coding, can be compiled by integer Code calculates the range of hyperspace, and memory space is saved in the data area storage of provinces and regions the more dimension space；It is shifted by integer Operation can also determine the starting integer coding of its subspace to determine upper space integer coding according to integer shifting function；
(2) integer coding is stored using Hash table, hyperspace and its subspace number can be quickly reflected by Hash table According to existence, avoid the subordinate dependence of the front and back node of tree, can effectively promote the speed of service of program；
(3) each dimension of hyperspace is divided according to sequencing respectively using space equalization division principle, The subspace for generating 2 or more, determines integer coding using the sequencing of each dimension；
(4) the most subspace of half decomposition policy selection spatial object generates new child node, removes upper space neutron The included spatial object in space；
(5) the spatial object scheduling that hyperspace and its subspace are dispatched using half decomposition strategy, can be reduced a large amount of Hyperspace node, reduce the use of memory and external space, the effectively number of less disk I/O promotes hyperspace number According to the efficiency of management；
(6) method includes that creation half decomposes tree construction process, insertion data procedures, inquiry data procedures, deletes data mistake Journey, referring to Fig. 5, tree construction process is decomposed in creation half, specifically includes the following steps:
(a1) a hyperspace node Node is passed to half decomposition tree T ' of initialization；
(a2) judge whether the spatial object collective number of hyperspace node Node exceeds preset KB limit, if Without departing from, the data in hyperspace node Node are write back in disk, terminate creation process；Otherwise step is continued to execute (a3)；(a3) to hyperspace node Node according to the successive along the equalization for carrying out spatial dimension to each dimension is drawn of dimension Point, generate 2 or more subspaces；(a4) judge the spatial object quantity in every sub-spaces, the son for selecting spatial object most Space S ubNodemax, generate new hyperspace node LeafNode；
(a3) equalization of spatial dimension is carried out to each dimension according to the sequencing of dimension to hyperspace node Node It divides, generates 2 or more subspaces；
(a4) judge the spatial object quantity in every sub-spaces, the subspace SubNode for selecting spatial object mostmax, Generate new hyperspace node LeafNode；
(a5) by hyperspace node Node about SubNodemaxSpatial object be added in LeafNode, simultaneously Remove SubNode in hyperspace node NodemaxSpatial object；
(a6) return step (1), until the spatial object number of former space nodes Node and newly-generated LeafNode node Amount is no more than maximum limitation, enters step (a7)
(a7) depth _ depth of the LeafNode in half decomposition tree is calculated using shifting function；
(a8) _ depth is compared with the depth depth of full decomposition tree T, biggish number is taken to be assigned to depth；
(a9) return step (a1).
Referring to Fig. 6, insertion data procedures specifically includes the following steps:
(b1) a spatial object Object being inserted into is passed to half decomposition tree T '1；
(b2) Object is calculated1The integer coding of the hyperspace belonging to the bosom of half decomposition tree T ', is denoted as Code1；
(b3) using integer coding shifting function to Code1Shifting function is carried out upwards in turn, when searching in Hash table To Code1When, stop shifting function；
(b4) according to Code1Spatial object is read in disk, generation integer coding is Code1The first hyperspace section Point Node1；
(b5) by Object1It is added to Node1Spatial object set in；
(b6) to Node1Execute step (a1)~(a9) described in half decompose policing action, wherein by step (a1)~ (a9) Node in replaces with Node1It executes.
Referring to Fig. 7, inquiry data procedures specifically includes the following steps:
(c1) it is passed to a hyperspace range Envelope to be checked；
(c2) integer coding for calculating Envelope hyperspace belonging to the bosom of half decomposition tree T ', is denoted as Code2；
(c3) if Code2It is 0, illustrates that the corresponding hyperspace of half decomposition tree T ' cannot save from damage comprising search space, be Intersection or phase are from if mutually from directly return is empty；If intersection, enables Code2For the coding of the root node of half decomposition tree T ', execute Step (c5)；If otherwise Code2It is not 0, executes step (c4)；
(c4) judge Code2It whether there is in Hash table, there is no upper layer coding is obtained using integer shifting function, directly It include Code to Hash table2, read the Code2Data in magnetic disk, generation integer coding be Code2The second hyperspace node Node2, by Node2In spatial object set make comparisons with Envelope, add data into result after, return the result, terminate Program；If Code2Exist in Hash table, executes step (c5)；
(c5) Code is read2Corresponding data in magnetic disk generates Code2Corresponding hyperspace node Node2, by Node2 In spatial object make comparisons with the spatial dimension of Envelope, the spatial object for belonging to Envelope is added in result；
(c6) hyperspace node Node is decomposed2, 2 or more subspaces are generated, the corresponding integer of every sub-spaces is compiled Code traverses integer coding, judges, comprising then return step (c5), otherwise to enter step whether comprising the integer coding in Hash table Suddenly (c7)；
(c7) node data in releasing memory terminates inquiry by query result there is no returning.
Referring to Fig. 8, delete data procedures specifically includes the following steps:
(d1) it is passed to a spatial object to be deleted, is denoted as Object3；
(d2) Object is calculated3The integer coding of the hyperspace belonging to the bosom of half decomposition tree T ', is denoted as Code3；
(d3) if Code3Equal to 0, then Object3Not in the maximum hyperspace corresponding to half decomposition tree, terminate to delete Except process；Otherwise following operation is continued to execute:
(d4) using integer coding shifting function to Code3Shifting function is carried out upwards in turn, when searching in Hash table To Code3When, stop shifting function；
(d5) according to Code3Spatial object Object is read in disk3, generation integer coding is Code3Third multidimensional Space nodes Node3；
(d6) Node is successively traversed3Spatial Objects set searches whether that there are one and Object3Corresponding space pair Spatial object as attribute, if not finding, end operation discharges Node3Node；If finding, from spatial object set Delete the spatial object；
(d7) judge Node3Spatial object collective number whether be 0, if not 0, by Node3Data write back disk； Otherwise operation below is executed；
(d8) Node is set3Dimension be n, repunit i is from 0 to n2, by Code3It is obtained after shifted left n plus i Node3Subspace integer coding LeafCode3If finding LeafCode in Hash table3, end loop, modify disk in Node3Data；Conversely, also not finding LeafCode in Hash table when being recycled to end3, then Node is discharged3In disk The disk space occupied.
A kind of multidimensional space data indexing means based on half decomposition strategy provided by the invention use the side of integer coding Formula defines the position of hyperspace locating for multidimensional subspace, can pass through the range that integer coding calculates hyperspace；By whole Shifting function is counted to determine upper space integer coding, the starting integer of its subspace can also be determined according to integer shifting function Coding；The innermost integer in corresponding half decomposition tree of some specific hyperspace in tree can be calculated according to hyperspace range Coding, the disk storage position of multidimensional space data is determined using integer coding, is stored integer coding using Hash table, is passed through Kazakhstan Uncommon table reflects the existence of hyperspace and its subspace data；The sky of hyperspace is carried out using each dimension equipartition principle Between it is impartial divide, its number is determined using the sequencing of each dimension；From the bosom of half point skill, coding is looked into upwards in turn Upper space is looked for, determines that it selects the suitable hyperspace node to carry out the insertion of spatial object in the existence of Hash table； When the spatial object quantity of hyperspace node reaches to greatest extent, using half decomposition strategy, selection decomposite possess compared with The subspace of more spatial objects becomes new node, removes the spatial object in upper space about subspace.
Referring to Figures 1 and 2 for using the tree construction and corresponding Hash table decomposed entirely, reference Fig. 3 and Fig. 4, for using half The tree construction of decomposition and corresponding Hash table, the number in node are integer coding, are spatial object quantity in bracket, it is assumed that one A node stores up to 32 spatial objects, then full decomposition tree is needed using 12 nodes, and half decomposition tree only has 3 sections Point；When searching 0x18 range of nodes data, full decomposition tree needs to be traversed for its subspace, needs 7 disk access, and partly Decomposition tree only needs to access 0x18 and 0x182, it is only necessary to disk access twice.Additionally, due to intermediate node is lacked, it is being inserted into, is deleting When removing, searching decomposition tree it is upward search less than when need to be traversed for entire Hash table, and half decomposition tree does not need.
A kind of multidimensional space data indexing means based on half decomposition strategy provided by the invention reduce memory space It uses, reduces disk I/O number, can efficiently carry out the management of multidimensional space data, ensure the fluency of spatial database.

Claims (4)

1. a kind of multidimensional space data indexing means based on half decomposition strategy, it is characterised in that decompose tree construction including creation half Process, specifically includes the following steps:
(a1) a hyperspace node Node is passed to half decomposition tree T ' of initialization；
(a2) judge whether the spatial object collective number of hyperspace node Node exceeds preset KB limit, if not surpassing Out, the data in hyperspace node Node are write back in disk, terminates creation process；Otherwise step (a3) is continued to execute； (a3) to hyperspace node Node according to the successive along the equalization for carrying out spatial dimension to each dimension divides, raw of dimension At 2 or more subspaces；(a4) judge the spatial object quantity in every sub-spaces, the subspace for selecting spatial object most SubNodemax, generate new hyperspace node LeafNode；
(a3) to hyperspace node Node according to the sequencing of dimension, the equalization for carrying out spatial dimension to each dimension is drawn Point, generate 2 or more subspaces；
(a4) judge the spatial object quantity in every sub-spaces, the subspace SubNode for selecting spatial object mostmax, generate New hyperspace node LeafNode；
(a5) by hyperspace node Node about SubNodemaxSpatial object be added in LeafNode, remove simultaneously SubNode in hyperspace node NodemaxSpatial object；
(a6) return step (1), until the spatial object quantity of former space nodes Node and newly-generated LeafNode node are equal It is limited no more than maximum, enters step (a7)
(a7) depth _ depth of the LeafNode in half decomposition tree is calculated using shifting function；
(a8) _ depth is compared with the depth depth of full decomposition tree T, biggish number is taken to be assigned to depth；
(a9) return step (a1).
2. the multidimensional space data indexing means according to claim 1 based on half decomposition strategy, it is characterised in that also wrap Insertion data procedures are included, specifically includes the following steps:
(b1) a spatial object Object being inserted into is passed to half decomposition tree T '1；
(b2) Object is calculated1The integer coding of the hyperspace belonging to the bosom of half decomposition tree T ', is denoted as Code1；
(b3) using integer coding shifting function to Code1Shifting function is carried out upwards in turn, when finding in Hash table Code1When, stop shifting function；
(b4) according to Code1Spatial object is read in disk, generation integer coding is Code1The first hyperspace node Node1；
(b5) by Object1It is added to Node1Spatial object set in；
(b6) to Node1Half decomposition policing action described in step (a1)~(a9) is executed, wherein by step (a1)~(a9) Node replaces with Node1It executes.
3. the multidimensional space data indexing means according to claim 1 based on half decomposition strategy, it is characterised in that also wrap Inquiry data procedures are included, specifically includes the following steps:
(c1) it is passed to a hyperspace range Envelope to be checked；
(c2) integer coding for calculating Envelope hyperspace belonging to the bosom of half decomposition tree T ', is denoted as Code2；
(c3) if Code2Be 0, illustrate that the corresponding hyperspace of half decomposition tree T ' cannot save from damage comprising search space, for intersection or Person is mutually from if mutually from directly return is empty；If intersection, enables Code2For the coding of the root node of half decomposition tree T ', step is executed (c5)；If otherwise Code2It is not 0, executes step (c4)；
(c4) judge Code2It whether there is in Hash table, there is no upper layer coding is obtained using integer shifting function, until breathing out Uncommon table includes Code2, read the Code2Data in magnetic disk, generation integer coding be Code2The second hyperspace node Node2, by Node2In spatial object set make comparisons with Envelope, add data into result after, return the result, terminate Program；If Code2Exist in Hash table, executes step (c5)；
(c5) Code is read2Corresponding data in magnetic disk generates Code2Corresponding hyperspace node Node2, by Node2In Spatial object is made comparisons with the spatial dimension of Envelope, and the spatial object for belonging to Envelope is added in result；
(c6) hyperspace node Node is decomposed2, 2 or more subspaces are generated, every sub-spaces correspond to an integer coding, time Integer coding is gone through, judges whether otherwise enter step comprising the integer coding comprising then return step (c5) in Hash table (c7)；
(c7) node data in releasing memory terminates inquiry by query result there is no returning.
4. the multidimensional space data indexing means according to claim 1 based on half decomposition strategy, it is characterised in that also wrap Deletion data procedures are included, specifically includes the following steps:
(d1) it is passed to a spatial object to be deleted, is denoted as Object3；
(d2) Object is calculated3The integer coding of the hyperspace belonging to the bosom of half decomposition tree T ', is denoted as Code3；
(d3) if Code3Equal to 0, then Object3Not in the maximum hyperspace corresponding to half decomposition tree, end was deleted Journey；Otherwise following operation is continued to execute:
(d4) using integer coding shifting function to Code3Shifting function is carried out upwards in turn, when finding in Hash table Code3When, stop shifting function；
(d5) according to Code3Spatial object Object is read in disk3, generation integer coding is Code3Third hyperspace Node Node3；
(d6) Node is successively traversed3Spatial Objects set searches whether that there are one and Object3Corresponding spatial object category Property the same spatial object, if not finding, end operation discharges Node3Node；If finding, deleted from spatial object set The spatial object；
(d7) judge Node3Spatial object collective number whether be 0, if not 0, by Node3Data write back disk；Otherwise Execute operation below；
(d8) Node is set3Dimension be n, repunit i is from 0 to n2, by Code3Node is obtained plus i after shifted left n3's The integer coding LeafCode of subspace3If finding LeafCode in Hash table3, end loop, modify disk in Node3 Data；Conversely, also not finding LeafCode in Hash table when being recycled to end3, then Node is discharged3It is occupied in disk Disk space.
CN201910610784.2A 2019-07-08 2019-07-08 Multi-dimensional spatial data indexing method based on semi-decomposition strategy Active CN110321353B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201910610784.2A CN110321353B (en) 2019-07-08 2019-07-08 Multi-dimensional spatial data indexing method based on semi-decomposition strategy

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201910610784.2A CN110321353B (en) 2019-07-08 2019-07-08 Multi-dimensional spatial data indexing method based on semi-decomposition strategy

Publications (2)

Publication Number Publication Date
CN110321353A true CN110321353A (en) 2019-10-11
CN110321353B CN110321353B (en) 2022-12-13

Family

ID=68123094

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201910610784.2A Active CN110321353B (en) 2019-07-08 2019-07-08 Multi-dimensional spatial data indexing method based on semi-decomposition strategy

Country Status (1)

Country Link
CN (1) CN110321353B (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111814328A (en) * 2020-07-07 2020-10-23 浙江工业大学 Modeling and query method of space-time data cube with flight area

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2000200342A (en) * 1999-01-06 2000-07-18 Nippon Telegr & Teleph Corp <Ntt> Multidimensional space data structure, method for updating and searching multidimensional space data, recording medium recording the structure and recording medium recording program for executing the method
CN102609530A (en) * 2012-02-14 2012-07-25 江苏新大诚信息技术有限公司 Space database indexing method of regional double-tree structure
CN103279972A (en) * 2013-05-08 2013-09-04 中国科学院软件研究所 Parallel multidimensional self-adaption sampling and reconstructing method based on KD tree

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2000200342A (en) * 1999-01-06 2000-07-18 Nippon Telegr & Teleph Corp <Ntt> Multidimensional space data structure, method for updating and searching multidimensional space data, recording medium recording the structure and recording medium recording program for executing the method
CN102609530A (en) * 2012-02-14 2012-07-25 江苏新大诚信息技术有限公司 Space database indexing method of regional double-tree structure
CN103279972A (en) * 2013-05-08 2013-09-04 中国科学院软件研究所 Parallel multidimensional self-adaption sampling and reconstructing method based on KD tree

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111814328A (en) * 2020-07-07 2020-10-23 浙江工业大学 Modeling and query method of space-time data cube with flight area

Also Published As

Publication number Publication date
CN110321353B (en) 2022-12-13

Similar Documents

Publication Publication Date Title
Yiu et al. The B dual-Tree: indexing moving objects by space filling curves in the dual space
Pfoser et al. Novel approaches to the indexing of moving object trajectories.
CN107402955B (en) Method and apparatus for determining index grid of geo-fence
Hjaltason et al. Distance browsing in spatial databases
Bertino et al. Indexing techniques for advanced database systems
Papadias et al. Progressive skyline computation in database systems
Hjaltason et al. Index-driven similarity search in metric spaces (survey article)
Pelanis et al. Indexing the past, present, and anticipated future positions of moving objects
US6105018A (en) Minimum leaf spanning tree
CN110765331B (en) Method and system for retrieving space-time data
US9317529B2 (en) Memory-efficient spatial histogram construction
CN112035586A (en) Spatial range query method based on extensible learning index
CN110321353A (en) A kind of multidimensional space data indexing means based on half decomposition strategy
Cheng et al. ETKDS: An efficient algorithm of Top-K high utility itemsets mining over data streams under sliding window model
CN114168591A (en) Method for searching tree structure data path node
CN109254962B (en) Index optimization method and device based on T-tree and storage medium
Ghanem et al. Bulk operations for space-partitioning trees
CN112214488A (en) European style spatial data index tree and construction and retrieval method
JP3938815B2 (en) Node creation method, image search method, and recording medium
JP4440246B2 (en) Spatial index method
Huang et al. A grid and density based fast spatial clustering algorithm
Papadias et al. Constraint-based processing of multiway spatial joins
CN110347676A (en) Uncertain temporal data management and querying method based on relationship R tree
CN113407669B (en) Semantic track query method based on activity influence
CN114049387A (en) Tree skeleton extraction method based on 3D point cloud

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