Early separated filter/refinement strategies and multi-way spatial joins for spatial query optimization공간 질의 최적화를 위한 여과/정제의 조기 분리 전략과 다중 공간 조인

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 587
  • Download : 0
Due to the high complexity and large volume of spatial data, a spatial query has been processed in two steps, called the filter step and the refinement step. However, the two-step processing of the spatial query has been considered locally in one spatial predicate evaluation at the query execution level. This thesis presents query optimization strategies which exploit the two-step processing of a spatial query at the query optimization level. The first strategy involves the separation of filter and refinement steps not in the query execution phase but in the query optimization phase. As the second strategy, several refinement operations can be combined if they were already separated, and as the third strategy several filter operations can also be combined. We call the optimization technique utilizing these strategies the Early Separated Filter And Refinement (ESFAR). We define the Spatial Object Algebra (SOA), which extends a normal object algebra to process spatial predicates as well, and use SOA to represent the input query of our optimizer. This thesis also presents an algebra, which is called the Intermediate Spatial Object Algebra (ISOA), and optimization rules for ESFAR. Actually the ESFAR optimizer always generates more efficient execution plans than the traditional optimizer because the ISOA operators include the traditional operators and the ESFAR rules include the traditional optimization rules. However, because of more operators and more rules, the ESFAR optimizer consumes more optimization time than the traditional optimizer. In this thesis, we apply two well known heuristic algorithms, the iterative improvement (II) and the simulated annealing (SA), to the ESFAR optimizer. Additionally we propose a new heuristic algorithm to find a good initial state of II and SA. We also propose a new multi-way spatial join algorithm called M-way R-tree join (MRJ) which synchronously traverses M R-trees. MRJ can be considered as a generalization of the 2-way R-tre...
Advisors
Chung, Chin-Wanresearcher정진완researcher
Description
한국과학기술원 : 전산학전공,
Publisher
한국과학기술원
Issue Date
2001
Identifier
165663/325007 / 000959530
Language
eng
Description

학위논문(박사) - 한국과학기술원 : 전산학전공, 2001.2, [ vi, 170 p. ]

Keywords

Refinement; Filter; Spatial Query Optimization; Multi-way Spatial Joins; 다중 공간 조인; 정제; 여과; 공간 질의 최적화

URI
http://hdl.handle.net/10203/33179
Link
http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=165663&flag=dissertation
Appears in Collection
CS-Theses_Ph.D.(박사논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0