DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Chung, Chin-Wan | - |
dc.contributor.advisor | 정진완 | - |
dc.contributor.author | Yoo, Jun-Beom | - |
dc.contributor.author | 유준범 | - |
dc.date.accessioned | 2011-12-13T06:01:22Z | - |
dc.date.available | 2011-12-13T06:01:22Z | - |
dc.date.issued | 2001 | - |
dc.identifier.uri | http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=165505&flag=dissertation | - |
dc.identifier.uri | http://hdl.handle.net/10203/34425 | - |
dc.description | 학위논문(석사) - 한국과학기술원 : 전산학과, 2001.2, [ iv, 45 p. ] | - |
dc.description.abstract | The shape of query windows for spatial selection queries is a rectangle in many cases. However, it can be issued for spatial selection queries with not only rectangular query widow, but also polygonal query window. Moreover, as the more spatial data the applications like GIS can manage, it can support the more various applications. Therefore it is valuable for considering about the refinement processing method suitable for not only rectangle, but also general polygonal query window. It is the general state-of-the-art approach to use the plane-sweep algorithm for the computation algorithm in the refinement step as the spatial join queries, because the shape of spatial data and query window are all the general polygons. However, from the observation on the characteristics of spatial data and query windows, we can find in many cases that the shape of query window is much simpler than that of spatial data. Therefore there is something to be improved if we use the state-of-the-art approach, which is suitable for the two complex polygons, as the refinement processing strategy in this some situation. From these observations, we suggest a new refinement process approach using PBST (Partition Based Sequential Testing) based on PEC (Partial Enclosed Circle) we developed. And we evaluated the performance of this new approach and the state-of-the-art approach by experiments with the real map data. From these experiments, we found that the new approach using PBST is more suitable than the other one as far as its query window is composed of up to 20 vertices. Although there is some deviation in the experimental result according to the characteristic of the real map data, if the number of vertices composing the query window is less than about 20, the new approach using PBST we suggest is superior to the state-of-the-art approach using Plane-Sweep by about 20% in the cases of small queries ranging about 1% which the most parts of spatial selection queries are issued in the r... | eng |
dc.language | eng | - |
dc.publisher | 한국과학기술원 | - |
dc.subject | Polygoal Query Window | - |
dc.subject | Query | - |
dc.subject | Spatial Data | - |
dc.subject | Database | - |
dc.subject | Refinement Strategy | - |
dc.subject | 정제 전략 | - |
dc.subject | 다각형 질의 윈도우 | - |
dc.subject | 질의 | - |
dc.subject | 공간 데이터 | - |
dc.subject | 데이터베이스 | - |
dc.title | (A) refinement strategy for selecting spatial data with polygonal query window | - |
dc.title.alternative | 다각형 질의 윈도우로 공간 데이터를 검색하기 위한 정제 전략 | - |
dc.type | Thesis(Master) | - |
dc.identifier.CNRN | 165505/325007 | - |
dc.description.department | 한국과학기술원 : 전산학과, | - |
dc.identifier.uid | 000993341 | - |
dc.contributor.localauthor | Chung, Chin-Wan | - |
dc.contributor.localauthor | 정진완 | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.