• Journal of Korea Spatial Information System Society
• /
• v.6 no.2 s.12
• /
• pp.23-37
• /
• 2004

Location Based Services(LBSs) in mobile environments become very popular recently. For efficient LBSs, spatial database management systems must need a spatial indexing scheme such as R-trees in order to manage the huge spatial database. However, it may need unnecessary disk accesses since it needs to access objects which are not actually concerned to user's location-based queries. In this paper, to support the location-based queries efficiently, we propose a CLR-tree(Cell Leveling R-tree) in which a dynamic cell is built up within the minimum bounding rectangle of R-trees' node. The cell level of nodes is compared with the query's cell level in location-based query processing and determines the minimum search space. Also, we propose the insertion, split, deletion, and search algorithms for CRL-trees. From the experimental results, we see that a CLR-tree is able to decrease $5{\sim}20%$ of disk accesses from those of R-trees. So, a CLR-tree can be used for fast accessing spatial objects to user's location-based queries in LBSs.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.10 no.11
• /
• pp.1239-1244
• /
• 2015

In this paper, a new method for finding optimal and short span in Convolutional Self-Doubly Orthogonal(CDO) codes are proposed. This new algorithm based on Parallel Implicitly-Exhaustive search, where we applied dynamic search space reduction methods in order to reduce computational time for finding Optimal Span for R=1/2 rate CDO codes. The simulation results shows that speedup and error correction performance of the new algorithm is better.

• Journal of KIISE:Databases
• /
• v.33 no.4
• /
• pp.396-408
• /
• 2006

Moving object databases manage a large amount of past location data which are accumulated as the time goes. To retrieve fast the past location of moving objects, we need index structures which consider features of moving objects. The KDB-tree has a good performance in processing range queries. Although we use the KDB-tree as an index structure for moving object databases, there has an over-split problem in the spatial domain since the feature of moving object databases is to increase the time domain. Because the over-split problem reduces spatial regions in the MBR of nodes inverse proportion to the number of splits, there has a problem that the cost for processing spatial-temporal range queries is increased. In this paper, we propose the dynamic split strategy of the KDB-tree to process efficiently the spatial-temporal range queries. The dynamic split strategy uses the space priority splitting method for choosing the split domain, the recent time splitting policy for splitting a point page to maximize the space utilization, and the last division policy for splitting a region page. We compare the performance of proposed dynamic split strategy with the 3DR-tree, the MV3R-tree, and the KDB-tree. In our performance study for range queries, the number of node access in the MKDB-tree is average 30% less than compared index structures.

• Journal of Korea Spatial Information System Society
• /
• v.11 no.3
• /
• pp.55-62
• /
• 2009

Location based Services in the ubiquitous computing environment, namely u-LBS, use very large and skewed spatial objects that are closely related to locational information. It is especially essential to achieve fast search, which is looking for POI(Point of Interest) related to the location of users. This paper examines how to search large and skewed POI efficiently in the u-LBS environment. We propose the Dynamic-level Grid based R-Tree(DGR-Tree), which is an index for point data that can reduce the cost of stationary POI search. DGR-Tree uses both R-Tree as a primary index and Dynamic-level Grid as a secondary index. DGR-Tree is optimized to be suitable for point data and solves the overlapping problem among leaf nodes. Dynamic-level Grid of DGR-Tree is created dynamically according to the density of POI. Each cell in Dynamic-level Grid has a leaf node pointer for direct access with the leaf node of the primary index. Therefore, the index access performance is improved greatly by accessing the leaf node directly through Dynamic-level Grid. We also propose a K-Nearest Neighbor(KNN) algorithm for DGR-Tree, which utilizes Dynamic-level Grid for fast access to candidate cells. The KNN algorithm for DGR-Tree provides the mechanism, which can access directly to cells enclosing given query point and adjacent cells without tree traversal. The KNN algorithm minimizes sorting cost about candidate lists with minimum distance and provides NEB(Non Extensible Boundary), which need not consider the extension of candidate nodes for KNN search.

• The Journal of the Korea Contents Association
• /
• v.4 no.3
• /
• pp.81-90
• /
• 2004

Recently, It has been increased to use a multi-dimensional data in various applications with a rapid growth of the computing environment. In this paper, we propose the vector approximate tree for content-based retrieval of multi-dimensional data. The proposed index structure reduces the depth of tree by storing the many region information in a node because of representing region information using space partition based method and vector approximation method. Also it efficiently handles 'dimensionality curse' that causes a problem of multi-dimensional index structure by assigning the multi-dimensional data space to dynamic bit. And it provides the more correct regions by representing the child region information as the parent region information relatively. We show that our index structure outperforms the existing index structure by various experimental evaluations.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.04a
• /
• pp.776-778
• /
• 2003

이동체 데이터베이스에서 대용량 궤적 정보를 효율적으로 검색학기 위해서는 색인이 필요하다. 특히 궤적을 선택하는 과정과 선택된 궤적의 일부분을 추출하는 과정으로 이루어진 복합 질의를 효율적으로 처리하기 위해서는 궤적 보존을 지원하는 TB-tree와 같은 색인 구조가 적합하다. 그러나, TB-tree는 공간적인 인접성을 고려하지 않아 비단말 노드의 겹침과 사장 영역이 매우 커 영역 질의의 비용이 증가하는 문제가 있다. 이 논문에서는 복합 질의 및 영역 질의를 효율적으로 처리하기 위하여, TB-tree에서 사장 영역을 감소시킬 수 있는 최대 영역 감소 정책을 제시한다. 최대 영역 감소 정책을 공간 활용도를 최대로 유지하면서 사장 영역을 점진적으로 감소시키는 삽일 및 분할 정책으로서 TB-tree의 비단말 노드의 겹침을 줄여 영역 질의의 비용을 감소시킨다.

• Journal of KIISE:Databases
• /
• v.32 no.5
• /
• pp.509-525
• /
• 2005

In this paper, we propose the index structure based on a vector approximation for efficiently supporting the similarity search of multi-dimensional data. The proposed index structure splits a region with the space partition method and allocates to the split region dynamic bits according to the distribution of data. Therefore, the index structure splits a region to the unoverlapped regions and can reduce the depth of the tree by storing the much region information of child nodes in a internal node. Our index structure represents the child node more exactly and provide the efficient search by representing the region information of the child node relatively using the region information of the parent node. We show that our proposed index structure is better than the existing index structure in various experiments. Experimental results show that our proposed index structure achieves about $40\%$ performance improvements on search performance over the existing method.

• Journal of Korea Multimedia Society
• /
• v.9 no.11
• /
• pp.1421-1434
• /
• 2006

Spatial data warehouses provide analytical information for decision supports using SOLAP (Spatial On-Line Analytical Processing) operations. Many researches have been studied to reduce analysis cost of SOLAP operations using pre-aggregation methods. These methods use the index composed of fixed size nodes for supporting the concept hierarchy. Therefore, these methods have many unused entries in sparse data area. Also, it is impossible to support the concept hierarchy in dense data area. In this paper, we propose a dynamic pre-aggregation index method based on the spatial hierarchy. The proposed method uses the level of the index for supporting the concept hierarchy. In sparse data area, if sibling nodes have a few used entries, those entries are integrated in a node and the parent entries share the node. In dense data area, if a node has many objects, the node is connected with linked list of several nodes and data is stored in linked nodes. Therefore, the proposed method saves the space of unused entries by integrating nodes. Moreover it can support the concept hierarchy because a node is not divided by linked nodes. Experimental result shows that the proposed method saves both space and aggregation search cost with the similar building cost of other methods.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2006.05a
• /
• pp.1121-1125
• /
• 2006

급속한 산업화와 도시화로 인하여 이상기후의 발생빈도가 높아지고 기후가 불안정해져서 예전보다 많은 집중호우가 발생되고 있다. 그리고 최근 홍수의 규모와 발생빈도가 증가하면서 홍수로 인한 인명과 재산상의 손실이 반복되고 있다. 이에 따른 홍수피해의 위험을 줄이기 위한 홍수방지시스템의 구축이 절실히 요구되고 있으며 홍수범람구역의 정확한 추정을 위해서는 홍수범람도 작성이 필요하다. 또한 정보통신산업이 급속도로 발전하면서 인터넷 사용의 증가로 많은 사용자들이 웹(Web)을 통해 다양한 데이터를 공유할 수 있고 정보를 검색할 수 있게 되면서 수자원 분야에도 정보의 공유와 자료의 통합을 위하여 Open GIS(The Open Geodata Interoperability Specification) 개념이 도입되고 있다. 따라서 본 연구에서는 Web기반으로 홍수범람모의 시스템을 구축하기 위한 기초연구로서 홍수 발생시 침수피해지역을 대상으로 실시간 3차원 홍수범람모의해석이 가능하도록 함으로써 연안지역 피해주민들의 피해를 줄일 수 있도록 하였다. 먼저, 본 연구에서는 이전의 시스템 상에서 정적인 지도로서 표현만 가능하던 것을 시공간적으로 유동성 있는 자료의 분석을 시각화하는 GIS 공간정보기술과 접목시켜 Web상에 동적인 지도형태로 표현함으로써 피해주민들이 쉽게 접할 수 있도록 하여 다양한 정보의 제공이 가능하게 될 것이다. 둘째, Web을 이용함으로써 실시간 홍수재해 정보를 수집하고 분석할 수 있어 인명과 재산의 피해를 줄일 수 있을 것으로 판단된다. 본 논문은 홍수범람시스템을 구축하기 위한 기초연구로서 현재는 GIS DB를 구축하는 단계에 있으며, 향후 다양한 유역을 대상으로 홍수범람모의시스템을 구축하여 분석결과를 피해지역주민 및 관련기관 실무자들에게 제공함으로써 시간과 공간에 구애받지 않는 재해관리와 신속한 재해 상황 대처가 가능해 질 것으로 사료된다.는 또 다른 형태의 주제도라고 볼 수 있으며, 이를 구축하기 위해서는 자료변환 및 가공이 필요하다. 즉, 각 상습침수지구에 필요한 지형도는 국립지리원에서 제작된 1:5,000 수치지형도가 있으나 이는 자료가 방대하고 상습침수지구에 필요하지 않은 자료들을 많이 포함하고 있으므로 상습침수지구의 데이터를 인터넷을 통해 서비스하기 위해서는 많은 불필요한 레이어의 삭제, 서비스 속도를 고려한 데이터의 일반화작업, 지도의 축소.확대 등 자료제공 방식에 따른 작업 그리고 가시성을 고려한 심볼 및 색채 디자인 등의 작업이 수반되어야 하며, 이들을 고려한 인터넷용 GIS기본도를 신규 제작한다. 상습침수지구와 관련된 각종 GIS데이타와 각 기관이 보유하고 있는 공공정보 가운데 공간정보와 연계되어야 하는 자료를 인터넷 GIS를 이용하여 효율적으로 관리하기 위해서는 단계별 구축전략이 필요하다. 따라서 본 논문에서는 인터넷 GIS를 이용하여 상습침수구역관련 정보를 검색, 처리 및 분석할 수 있는 상습침수 구역 종합정보화 시스템을 구축토록 하였다.N, 항목에서 보 상류가 높게 나타났으나, 철거되지 않은 검전보나 안양대교보에 비해 그 차이가 크지 않은 것으로 나타났다.의 기상변화가 자발성 기흉 발생에 영향을 미친다고 추론할 수 있었다. 향후 본 연구에서 추론된 기상변화와 기흉 발생과의 인과관계를 확인하고 좀 더 구체화하기 위한 연구가 필요할 것이다.게 이루어질 수 있을 것으로 기대된다.는 초과수익률이 상승하지만, 이후로는 감소하므로, 반전거래전략을 활용하는 경우 주식투자기간은 24개월이하의 중단기가 적합함을 발견하였다. 이상의 행태적 측면과 투자성과측면의 실증결과를 통하여 한국주식시장에 있어서 시장수익률을 평균적으로 초과할 수 있는 거래전략은 존재하므로 이러한 전략을 개발 및 활용할 수 있으며, 특히, 한국주식시장에 적합한 거래전략은 반전거래전략이고, 이 전략의 유용성은 투자자가

• Journal of Korea Spatial Information System Society
• /
• v.6 no.1 s.11
• /
• pp.73-85
• /
• 2004

Recently, as the growth of the wireless Internet, PDA and HPC, the focus of research and development related with GIS(Geographic Information System) has been changed to the Real-Time Mobile GIS to service LBS. To offer LBS efficiently, there must be the Real-Time GIS platform that can deal with dynamic status of moving objects and a location index which can deal with the characteristics of location data. Location data can use the same data type(e.g., point) of GIS, but the management of location data is very different. Therefore, in this paper, we studied the Real-Time Mobile GIS using the HBR-tree to manage mass of location data efficiently. The Real-Time Mobile GIS which is developed in this paper consists of the HBR-tree and the Real-Time GIS Platform HBR-tree. we proposed in this paper, is a combined index type of the R-tree and the spatial hash Although location data are updated frequently, update operations are done within the same hash table in the HBR-tree, so it costs less than other tree-based indexes Since the HBR-tree uses the same search mechanism of the R-tree, it is possible to search location data quickly. The Real-Time GIS platform consists of a Real-Time GIS engine that is extended from a main memory database system. a middleware which can transfer spatial, aspatial data to clients and receive location data from clients, and a mobile client which operates on the mobile devices. Especially, this paper described the performance evaluation conducted with practical tests if the HBR-tree and the Real-Time GIS engine respectively.