Object decomposition for spatial query processing공간 질의 처리를 위한 객체 분할

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 807
  • Download : 0
DC FieldValueLanguage
dc.contributor.advisorChung, Chin-Wan-
dc.contributor.advisor정진완-
dc.contributor.authorLee, Yong-Ju-
dc.contributor.author이용주-
dc.date.accessioned2011-12-14T02:25:04Z-
dc.date.available2011-12-14T02:25:04Z-
dc.date.issued1997-
dc.identifier.urihttp://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=128091&flag=dissertation-
dc.identifier.urihttp://hdl.handle.net/10203/39821-
dc.description학위논문(박사) - 한국과학기술원 : 정보및통신공학과, 1997.8, [ ix, 122 p. ]-
dc.description.abstractEfficient query processing for complex spatial objects is one of the most challenging requirements in non-traditional applications such as geographic information systems, computer-aided design, and multimedia databases. The performance of spatial query processing can be improved by decomposing a complex object into a small number of simple components. This paper investigates the natural trade-off between the number and the complexity of decomposed components. In particular, we propose a new object decomposition method that can control the number of components using a parameter. This method enables the user to select the optimal trade-off by controlling the parameter. The proposed method is compared with traditional decomposition methods by an analytical study and experimental measurements. These comparisons show that our decomposition method outperforms traditional decomposition methods. A spatial query processor based on object decomposition is implemented as a SHORE Value Added Server (VAS) directly on top of the SHORE Storage Manager (SSM). The goal in developing the query processor is to implement a sub- system that efficiently supports a well-chosen set of spatial queries. These spatial queries serve as a basis for implementing other more sophisticated operations required in special applications. Spatial queries that we implemented are the point query, region query, spatial join query, nearest neighbor query, and insert query. An efficient implementation of these basic spatial queries is the most important for good overall performance of the spatial query processor. We provide analytical formulas that predict the performance of the spatial query processor. The major contribution of our analysis is the refinement step analysis. In contrast to several earlier investigations on this subject, we take into account the analytical formulas that predict the performance of the refinement step, since the refinement step exerts critical influence on the performance...eng
dc.languageeng-
dc.publisher한국과학기술원-
dc.subjectspatial indexing structure-
dc.subjectspatial query processing-
dc.subjectObject decomposition method-
dc.subjecta spatial query processor based on object decomposition-
dc.subject객체 분할을 기반으로 한 공간 객체 처리기-
dc.subject공간 색인 구조-
dc.subject공간 질의 처리-
dc.subject객체 분할 방법-
dc.titleObject decomposition for spatial query processing-
dc.title.alternative공간 질의 처리를 위한 객체 분할-
dc.typeThesis(Ph.D)-
dc.identifier.CNRN128091/325007-
dc.description.department한국과학기술원 : 정보및통신공학과, -
dc.identifier.uid000929079-
dc.contributor.localauthorChung, Chin-Wan-
dc.contributor.localauthor정진완-
Appears in Collection
ICE-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