• Journal of the Korea Computer Industry Society
• /
• v.5 no.1
• /
• pp.87-100
• /
• 2004

XML has recently considered as a new standard for data presentation and exchange on the web, many researches are on going to develop applications and index mechanism to store and retrieve XML documents efficiently. In this paper, design a Main-Memory based XML storage system for efficient management of XML document. And propose structured retrieval of XML document tree which reduce the traverse of XML document tree using element type information included user queries. Proposed indexing mechanism has flexibilities for dynamic data update. Finally, for query processing of XML document include Link information, design a index structure of table type link information on observing XLink standards.

• The KIPS Transactions:PartD
• /
• v.9D no.4
• /
• pp.543-554
• /
• 2002

GIS (Geographic Information Systems) need faster access and better visualization. For faster access and better visualization in GIS, map generalization and levels of detail are needed. Existing spatial indexing methods do not support map generalization. Also, a few existing spatial indexing methods supporting map generalization do not support ail map generalization operations. We propose a new index structure, i.e. the LR-tree, supporting ail map generalization operations. This paper presents algorithms for the searching and updating the LR-tree and the results of performance evaluation. Our index structure works better than other spatial indexing methods for map generalization.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.10a
• /
• pp.815-816
• /
• 2009

Owing to the development of computer technologies, to process data derived from various sensors is recently demanding. It is also increasing to demand the moving object based servies like the services of location based and mobile application services. That's why it is needed the processing of visualizing the services for education aspects. In this paper, we show the implemented results about $R^*$ tree algorithm to insert, delete and search a object in two dimension environment.

• The KIPS Transactions:PartD
• /
• v.13D no.2 s.105
• /
• pp.157-164
• /
• 2006

Since XML is emerging as the de facto standard for exchanging and representation of data on the web, the amount of XML data has rapidly increased. Thus, the need for effective store and retrieval of U data has arisen. Since the existing techniques such as XRel which is an XML storage and management technique using RDBMS simply record the existing all label paths, diverse classes of label path expressions could not be efficiently supported. In this paper, we present a technique which supports storage and retrieval for XML data using RDBMS efficiently compared with the existing approaches. Since the proposed technique keeps the XML path index on the relational database and replace label paths with path identifiers, diverse XML queries can be evaluated compared with existing approaches. Also, the proposed technique does not require the modification of the relational database engine and consumes the disk space less. Our experimental result demonstrates the better query performance compared with existing techniques.

• Journal of KIISE:Databases
• /
• v.28 no.3
• /
• pp.344-356
• /
• 2001

This paper deals with the subsequence searching problem under time-warping in sequence databases. Our work is motivated by the observation that subsequence searches slow down quadratically as the average length of data sequences increases. To resolve this problem, the Segment-Based Approach for Subsequence Searches (SBSS) is proposed. The SBASS divides data and query sequences into a series of segments, and retrieves all data subsequences that satisfy the two conditions: (1) the number of segments is the same as the number of segments in a query sequence, and (2) the distance of every segment pair is less than or equal to a tolerance. Our segmentation scheme allows segments to have different lengths; thus we employ the time warping distance as a similarity measure for each segment pair. For efficient retrieval of similar subsequences, we extract feature vectors from all data segments exploiting their monotonically changing properties, and build a spatial index using feature vectors. Using this index, queries are processed with the four steps: (1) R-tree filtering, (2) feature filtering, (3) successor filtering, and (4) post-processing. The effectiveness of our approach is verified through extensive experiments.

• The KIPS Transactions:PartD
• /
• v.15D no.1
• /
• pp.31-40
• /
• 2008

We generally use lower-dimensional transformations to convert high-dimensional sequences into low-dimensional points in similar sequence matching. These traditional transformations, however, show different characteristics in indexing performance by the type of time-series data. It means that the selection of lower-dimensional transformations makes a significant influence on the indexing performance in similar sequence matching. To solve this problem, in this paper we propose a hybrid approach that integrates multiple transformations and uses them in a single multidimensional index. We first propose a new notion of hybrid lower-dimensional transformation that exploits different lower-dimensional transformations for a sequence. We next define the hybrid distance to compute the distance between the transformed sequences. We then formally prove that the hybrid approach performs the similar sequence matching correctly. We also present the index building and the similar sequence matching algorithms that use the hybrid approach. Experimental results for various time-series data sets show that our hybrid approach outperforms the single transformation-based approach. These results indicate that the hybrid approach can be widely used for various time-series data with different characteristics.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.2
• /
• pp.69-77
• /
• 2009

Stream service environment demands real-time query processing for voluminous data which are ceaselessly delivered from tremendous sources. Typical R-tree based query processing technologies cannot efficiently handle such situations, which require repetitive and inefficient exploration from the tree root on every data event. However, many stream data including sensor readings show high locality, which we exploit to reduce the search space of queries to explore. In this paper, we propose a query processing scheme exploiting the locality of stream data. From the simulation, we conclude that the proposed scheme performs much better than the traditional ones in terms of scalability and exploration efficiency.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2020.06a
• /
• pp.81-81
• /
• 2020

4차산업 혁명 이후, 빅 데이터는 사이버 공간을 통한 사회적 파장이 큰 사건들에 대한 대중의 정보 수집 패턴을 이해하는 데에 있어서 전에 경험하지 못한 급속한 발전을 이루어 왔다. 사이버 공간에서 이루어지는 대중들의 정보수집 활동을 모니터링하므로서 대중들사이에서 떠오르는 주제나 사건을 파악하기에 좋은 인덱스로 여러 사회 경제분야에 활용되어 왔다. 하지만, 수자원 관리 및 방재관점에서는 이런 빅데이터을 활용한 연구 사례는 찾아 보기 힘들다. 하지만, 이런 빅데이터를 가뭄기에 대중들이 어떻게 반응하였는지를 연구하는 데에 활용될 수 있다. 이 발표에서 발표자는 미국 2011-17년 캘리포니아 가뭄의 선례연구들을 통해 주 또는 국가 범위에서 구글 이용자들의 정보수집 활동을 기록한 구글트렌즈 데이터를 가뭄기동안 대중의 정보 수집량을 바탕으로 가뭄 위험 인지도를 정의하고 대중의 행동 양식을 이해하는 데에 어떻게 활용할 수 있는 지를 소개한다. 첫번째로, 최근 캘리포니아에서 발생한 다년간의 가뭄동안 그 주안의 주민들의 행동양식 분석 결과를 소개한다. 두번째로는 미국 49개의 주에서 지난 2004년부터 2018년동안의 지역적 가뭄에 대한 대중의 가뭄 위험인지도를 시공간적인 양식을 주성분분석기술을 통해 분석한 결과을 소개한다. 끝으로, 발표자는 지난 미국 선례 연구들에서 발표자가 제안한 기술이 어떻게 대한민국에서 홍수나 가뭄 방재에 적용할 수 있으며 앞으로 대한민국을 수재해에 준비된 나라로 만드는 데에 있어서 빅데이터의 역할을 제시하고자 한다.

• Proceedings of the KIEE Conference
• /
• 2009.07a
• /
• pp.1883_1884
• /
• 2009

자동검침 데이터를 이용하여 고객의 가상 부하패턴을 생성하고 회선 및 구간의 부하를 분석하는 연구가 활발히 진행되고 있다. 본 논문에서는 기존에 연구된 산업분류 별 평균 부하패턴을 이용하는 방법과 고객의 부하 형태 인덱스를 이용한 방법의 문제점을 살펴보고, 이를 개선하기 위한 방법으로 고객의 속성정보를 이용하여 고객을 분류하는 방법을 제안하였다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.10b
• /
• pp.73-75
• /
• 2003

이 연구에서는 XML 문서의 효율적인 검색을 위해 XML 데이터에서 색인어를 추출하고 가중치를 부여하여 내용기반 인덱스를 구축하고, 질의와 문서간의 유사도가 높은 문서들을 사용자에게 제공함으로써 기존의 경로 중심 혹은 패턴매칭 형태의 XML 문서 검색 기능을 확장하고자 한다. 내용기반 검색을 지원하는 XML 문서 검색시스템을 설계하고, 내용기반 검색과 관련한 이슈들을 논의한다. 개발 중에 있는 연구용 프로토타입 시스템을 이용하여 질의에 대한 내용기반 검색 결과를 간단히 소개한다.