CN101093501A - Method for querying high performance, transparent distributed spatial database - Google Patents
Method for querying high performance, transparent distributed spatial database Download PDFInfo
- Publication number
- CN101093501A CN101093501A CN 200710052872 CN200710052872A CN101093501A CN 101093501 A CN101093501 A CN 101093501A CN 200710052872 CN200710052872 CN 200710052872 CN 200710052872 A CN200710052872 A CN 200710052872A CN 101093501 A CN101093501 A CN 101093501A
- Authority
- CN
- China
- Prior art keywords
- fragment
- space
- query
- spatial
- inquiry
- 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
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
Description
Claims (2)
- One kind efficient, transparent distributed spatial database querying method, pass through query decomposition, the data localization, global query optimization, four levels of local query optimization are realized, it is characterized in that: at the cross-border seamless inquiry problem of the distributed spatial database of cutting apart burst, earlier the attended operation of space fragment is classified, spatial topotaxy operation and spatial analysis operation based on the OpenGIS standard definition, the spatial topotaxy operation is divided into from operating with non-from operation, spatial analysis operation is divided into buffer operation and non-buffer operation, and the connected mode of space fragment is divided into four classes according to spatial topotaxy operation and spatial analysis operation: first kind space fragment be connected be non-buffering inquire about non-from connection; The second space-like fragment connect be non-buffering inquiry from connection; It is the non-from connection of band buffering inquiry that the 3rd space-like fragment connects; The 4th space-like fragment connect be the inquiry of band buffering from connection, this classification has been set up spatial topotaxy operation, spatial analysis operation and the incidence relation between the space fragment is connected, on this basis, following rule is satisfied in the cross-border attended operation of dissimilar space fragment:I. satisfy two space fragments of first kind connected mode and must hand over rectangle intersection with the minimum outsourcing rectangle of these two space fragment partitioning boundaries;II. the minimum outsourcing rectangle of the d buffer zone expansion of a space fragment relation does not exceed the d expansion of the minimum outsourcing rectangle of this space fragment partitioning boundary, and the d expanded definition of so-called minimum outsourcing rectangle is as follows: the lower left corner and the upper right corner coordinate of establishing the minimum outsourcing rectangle of a spatial object are respectively (x Min, y Min), (x Max, y Max), then the d of the minimum outsourcing rectangle of this object expansion is that the lower left corner and upper right corner coordinate are respectively (x Min-d, y Min-d), (x Max+ d, y Max+ d) rectangle, wherein d is an arithmetic number;III. two intersegmental the 3rd space-likes of spatial pieces connect, if satisfy the 3rd class connected mode of space fragment between main leaf section object and auxilliary fragment objects, the object that then satisfies the 3rd space-like topological relation in the main leaf section intersects with the d expansion of the minimum outsourcing rectangle of auxilliary fragment or two d expansions of minimum outsourcing rectangle, main leaf section wherein, auxilliary fragment, the definition of two d expansions is as follows respectively: the fragment that comprises buffer operation in two fragments that participate in connecting is called the main leaf section, then another fragment claims auxilliary fragment, if on two fragments that participate in connecting buffer operation is arranged all, if buffer zone is respectively d1, d2, then choose one wantonly as the main leaf section, another is as auxilliary fragment, carry out the d1+d2 expansion of minimum outsourcing rectangle to any one fragment this moment, is called two d expansions of fragment;Based on these three rules, 7 rules that fragment cross-border connection in space is optimized are proposed, remove rule comprising following 3:(1) if the minimum outsourcing rectangle of the partitioning boundary of two space fragments that participation connects is non-intersect, then the intersegmental first kind of these two spatial pieces connects removal;(2) non-conterminous space fragment first kind connection is removed;(3) expand non-intersect if cut apart the broad sense d of two space fragments of burst, then intersegmental the 3rd class of these two spatial pieces connects removal, the broad sense d expanded definition of so-called junction fragment is as follows: participate in the fragment X that buffering connects, its broad sense d expansion table is shown MBR (X) _ d EIf, do fragment again after the advanced row buffering operation of the object among the X and connect, then d equals the buffer zone distance, i.e. MBR (X) _ d E=MBR (X) _ d connects if the object among the X directly carries out fragment, then regards d=0 as, at this moment MBR (X) _ d E=MBR (X);And following 4 connection transformation rules:(4) on two space fragment X, Y, carry out the cross-border θ of the first kind Sp-1 EdConnect, be converted to earlier and hand over rectangle to ask friendship to filter, and then carry out first kind spatial join operation θ based on X, the minimum outsourcing rectangle of Y partitioning boundary carrying out on X, the Y Sp-1, that is:(5) if the minimum outsourcing rectangle of the partitioning boundary of two space fragments that participation connects is non-intersect, then the second intersegmental class of these two spatial pieces connects the cartesian product that is converted into these two fragments;(6) on two space fragment X, Y, carry out the cross-border connection of the 3rd class θ Sp-3 Ed, be converted to and on X, carry out earlier the 3rd space-like topology filtration θ MBR (Y) _ d f(X), filter result is carried out the d buffering, and then carry out the 3rd space-like attended operation θ Sp-3, promptly(7) the broad sense d expansion of two space fragments of participation connection is non-intersect, and then these two intersegmental connections of spatial pieces are converted into the cartesian product of these two space fragments.
- 2. a kind of efficient, transparent distributed spatial database querying method according to claim 1 is characterized in that: the concrete steps that query decomposition, data localization, global query optimization, four levels of local query optimization are realized are as follows:Query decomposition: the inquiry problem is converted to a relational algebra expression formula that is defined on the holotopy, query decomposition was four steps: the first step is write inquiry as normalized form, second step was that the standardization query statement is carried out the correctness analysis, the 3rd step was to inquire about abbreviation, the 4th step was that query statement is rewritten as an algebraically inquiry, query rewrite is divided into two sub-steps: the one, query conversion is become relational algebra, and the 2nd, relational algebra inquiry reconstruct;Data localization: by DATA DISTRIBUTION information locating query data, the fragment that relates in determining to inquire about, inquiry on the holotopy is specialized, inquire about specific to localization or on the space fragment on changing with advancing, relational algebra expression formula on the holotopy is transformed to relational expression on respective segments, utilize 7 rules of the cross-border connection optimization of space fragment to optimize space querying, removing the unnecessary non-conterminous space fragment first kind according to the cross-border connection principle of optimality of space fragment (1) and (2) is connected, connect the principle of optimality (3) according to the space fragment and remove intersegmental the 3rd class connection of sheet, and whether adjacent by from the global catalog of space, obtaining fragment, information such as the minimum outsourcing rectangle of fragment are judged the optimization of using four kinds of which kind of principles of optimality that connects in the transformation rule to carry out space fragment connection;Global query optimization: be bordering on optimized implementation strategy by seeking one, promptly find out the optimum operation order of burst inquiry, a relational algebra inquiry optimization of output, on the fragment;Local query optimization: on each website, carry out subquery by each website that has query fragment, adopt the integrated system algorithm to be optimized by the DBMS on this website.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CNB2007100528722A CN100573524C (en) | 2007-07-31 | 2007-07-31 | A kind of efficient, transparent distributed spatial database querying method |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CNB2007100528722A CN100573524C (en) | 2007-07-31 | 2007-07-31 | A kind of efficient, transparent distributed spatial database querying method |
Publications (2)
Publication Number | Publication Date |
---|---|
CN101093501A true CN101093501A (en) | 2007-12-26 |
CN100573524C CN100573524C (en) | 2009-12-23 |
Family
ID=38991765
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CNB2007100528722A Expired - Fee Related CN100573524C (en) | 2007-07-31 | 2007-07-31 | A kind of efficient, transparent distributed spatial database querying method |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN100573524C (en) |
Cited By (12)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN101984433A (en) * | 2010-11-12 | 2011-03-09 | 浙江大学 | Convexity based multiple spots far and near querying method |
CN102362276A (en) * | 2009-04-01 | 2012-02-22 | 赛贝斯股份有限公司 | Testing efficiency and stability of a database query engine |
CN103324724A (en) * | 2013-06-26 | 2013-09-25 | 华为技术有限公司 | Method and device for processing data |
CN104903894A (en) * | 2013-01-07 | 2015-09-09 | 脸谱公司 | System and method for distributed database query engines |
CN105608086A (en) * | 2014-11-17 | 2016-05-25 | 中兴通讯股份有限公司 | Transaction processing method and device of distributed database system |
CN105809735A (en) * | 2016-03-11 | 2016-07-27 | 武汉大学 | Topology maintenance method based on three-dimensional geometric body combination |
WO2017049913A1 (en) * | 2015-09-23 | 2017-03-30 | 中兴通讯股份有限公司 | Database execution method and device |
CN103714073B (en) * | 2012-09-29 | 2017-04-12 | 国际商业机器公司 | Method and device for querying data |
CN106886674A (en) * | 2016-08-24 | 2017-06-23 | 阿里巴巴集团控股有限公司 | A kind of geographical position Distance Batch computational methods and device |
CN108228663A (en) * | 2016-12-21 | 2018-06-29 | 杭州海康威视数字技术股份有限公司 | A kind of paging search method and device |
CN110968615A (en) * | 2018-09-30 | 2020-04-07 | 北京国双科技有限公司 | Data query method and device |
CN111522816A (en) * | 2020-04-16 | 2020-08-11 | 云和恩墨(北京)信息技术有限公司 | Data processing method, device, terminal and medium based on database engine |
-
2007
- 2007-07-31 CN CNB2007100528722A patent/CN100573524C/en not_active Expired - Fee Related
Cited By (24)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN102362276A (en) * | 2009-04-01 | 2012-02-22 | 赛贝斯股份有限公司 | Testing efficiency and stability of a database query engine |
CN102362276B (en) * | 2009-04-01 | 2015-04-22 | 赛贝斯股份有限公司 | Testing efficiency and stability of a database query engine |
CN101984433B (en) * | 2010-11-12 | 2012-11-21 | 浙江大学 | Convexity based multiple spots far neighbor querying method |
CN101984433A (en) * | 2010-11-12 | 2011-03-09 | 浙江大学 | Convexity based multiple spots far and near querying method |
CN103714073B (en) * | 2012-09-29 | 2017-04-12 | 国际商业机器公司 | Method and device for querying data |
CN104903894B (en) * | 2013-01-07 | 2018-12-28 | 脸谱公司 | System and method for distributed networks database query engine |
CN104903894A (en) * | 2013-01-07 | 2015-09-09 | 脸谱公司 | System and method for distributed database query engines |
US11347761B1 (en) | 2013-01-07 | 2022-05-31 | Meta Platforms, Inc. | System and methods for distributed database query engines |
US10698913B2 (en) | 2013-01-07 | 2020-06-30 | Facebook, Inc. | System and methods for distributed database query engines |
US10210221B2 (en) | 2013-01-07 | 2019-02-19 | Facebook, Inc. | System and method for distributed database query engines |
CN103324724A (en) * | 2013-06-26 | 2013-09-25 | 华为技术有限公司 | Method and device for processing data |
CN103324724B (en) * | 2013-06-26 | 2017-02-08 | 华为技术有限公司 | Method and device for processing data |
CN105608086A (en) * | 2014-11-17 | 2016-05-25 | 中兴通讯股份有限公司 | Transaction processing method and device of distributed database system |
CN105608086B (en) * | 2014-11-17 | 2021-07-27 | 中兴通讯股份有限公司 | Transaction processing method and device for distributed database system |
WO2016078423A1 (en) * | 2014-11-17 | 2016-05-26 | 中兴通讯股份有限公司 | Transaction processing method and apparatus for distributed database system |
WO2017049913A1 (en) * | 2015-09-23 | 2017-03-30 | 中兴通讯股份有限公司 | Database execution method and device |
CN105809735A (en) * | 2016-03-11 | 2016-07-27 | 武汉大学 | Topology maintenance method based on three-dimensional geometric body combination |
CN106886674A (en) * | 2016-08-24 | 2017-06-23 | 阿里巴巴集团控股有限公司 | A kind of geographical position Distance Batch computational methods and device |
CN106886674B (en) * | 2016-08-24 | 2019-07-23 | 阿里巴巴集团控股有限公司 | A kind of geographical location Distance Batch calculation method and device |
CN108228663A (en) * | 2016-12-21 | 2018-06-29 | 杭州海康威视数字技术股份有限公司 | A kind of paging search method and device |
CN110968615A (en) * | 2018-09-30 | 2020-04-07 | 北京国双科技有限公司 | Data query method and device |
CN110968615B (en) * | 2018-09-30 | 2023-05-23 | 北京国双科技有限公司 | Data query method and device |
CN111522816A (en) * | 2020-04-16 | 2020-08-11 | 云和恩墨(北京)信息技术有限公司 | Data processing method, device, terminal and medium based on database engine |
CN111522816B (en) * | 2020-04-16 | 2021-04-30 | 云和恩墨(北京)信息技术有限公司 | Data processing method, device, terminal and medium based on database engine |
Also Published As
Publication number | Publication date |
---|---|
CN100573524C (en) | 2009-12-23 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN100573524C (en) | A kind of efficient, transparent distributed spatial database querying method | |
CN103064875B (en) | A kind of spatial service data distributed enquiring method | |
US8655877B2 (en) | System and program for joining source table rows with target table rows | |
CN104391948B (en) | The data normalization construction method and system of data warehouse | |
JPH07319923A (en) | Method and equipment for processing of parallel database of multiprocessor computer system | |
CN101436192A (en) | Method and apparatus for optimizing inquiry aiming at vertical storage type database | |
CN104392010A (en) | Subgraph matching query method | |
CN104240017A (en) | Networking management method for urban rail transit line net | |
CN110502509A (en) | A kind of traffic big data cleaning method and relevant apparatus based on Hadoop Yu Spark frame | |
CN109710638A (en) | A kind of multi-query optimization method on federation type distribution RDF data library | |
CN101710336A (en) | Method for accelerating data processing by using relational middleware | |
CN111881160A (en) | Distributed query optimization method based on equivalent expansion method of relational algebra | |
CN102004771B (en) | Method for querying reverse neighbors of moving object based on dynamic cutting | |
CN113312342A (en) | Scientific and technological resource integration system based on multi-source database | |
CN112967021A (en) | Enterprise-promoting policy intelligent matching system based on big data | |
US20180121532A1 (en) | Data table partitioning management method and apparatus | |
WO2018090557A1 (en) | Method and device for querying data table | |
CN103377236B (en) | A kind of Connection inquiring method and system for distributed data base | |
CN101515284A (en) | Parallel space topology analyzing method based on discrete grid | |
CN105955209A (en) | Manufacturing industry factory equipment layout method based on data mining | |
CN110716933B (en) | Novel urban rail train big data-oriented high-flexibility distributed index method | |
Alom et al. | Query processing and optimization in distributed database systems | |
CN107491544A (en) | A kind of data processing platform (DPP) for strengthening non-relational database analysis ability | |
Zhang et al. | Hybrid Subgraph Matching Framework Powered by Sketch Tree for Distributed Systems | |
CN103942294B (en) | The query planning method of searching mass data in intelligent transportation field |
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 | ||
ASS | Succession or assignment of patent right |
Owner name: CHANGSHU ZIJIN INTELLECTUAL PROPERTY SERVICE CO., Free format text: FORMER OWNER: WUHAN UNIVERSITY Effective date: 20121225 |
|
C41 | Transfer of patent application or patent right or utility model | ||
COR | Change of bibliographic data |
Free format text: CORRECT: ADDRESS; FROM: 430072 WUHAN, HUBEI PROVINCE TO: 215500 SUZHOU, JIANGSU PROVINCE |
|
TR01 | Transfer of patent right |
Effective date of registration: 20121225 Address after: 215500 Changshou City South East Economic Development Zone, Jiangsu, Jin Road, No. 8 Patentee after: Changshu Zijin Intellectual Property Service Co., Ltd. Address before: 430072 Hubei city of Wuhan province Wuchang Luojiashan Patentee before: Wuhan University |
|
C41 | Transfer of patent application or patent right or utility model | ||
TR01 | Transfer of patent right |
Effective date of registration: 20160406 Address after: 215500 No. 8, Jin Du Road, Changshou City hi tech Industrial Development Zone, Jiangsu, China Patentee after: Changshu Nanjing Normal University Development Research Academy Institute Co., Ltd. Address before: 215500 Changshou City South East Economic Development Zone, Jiangsu, Jin Road, No. 8 Patentee before: Changshu Zijin Intellectual Property Service Co., Ltd. |
|
CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20091223 Termination date: 20180731 |
|
CF01 | Termination of patent right due to non-payment of annual fee |