• The KIPS Transactions:PartD
• /
• v.13D no.3 s.106
• /
• pp.317-324
• /
• 2006

In this paper, we propose a new indexing technique to solve various queries which have a strong good point not only database indexing schema take advantage of converting from semi-structured data to structured data but also performance is more faster than before. We represent structure information of XML document between nodes of tree that additional numbering information which can be bit-stream without modified structure of XML tree. And, We add in indexing schema searching incidental structure information in the process. In Querying schema, we recover ancestor nodes through give information of node using indexing schema in complete path query expression as well as relative path query expression. Therefore, it takes advantage of making derivative query expression with given query. In this process, we recognize that indexing and querying schema can get searched result set faster and more accurate. Because response time is become shorter by bit operating, when query occur and it just needs information of record set earch node in database.

• Journal of the Korean Society for Library and Information Science
• /
• v.32 no.3
• /
• pp.281-296
• /
• 1998

This study indicates that it is necessary to have characteristic information the information experts recognize-that is to say, experimental and inherent knowledge only human being can have built-in into the system rather than to approach the information system by the linguistic, statistic or structuralistic way, and it can be more essential and intelligent information system. As this study proves that the cited primary legal information within the secondary legal information functions as the index which represents the contents of the text because of the characteristics of legal information, the automatic indexing in the secondary legal full-text databases can be possible without the assitance of the experts. In case of the establishment, amendment or repealing of law, change of index terms can be possible through revising the legal text cited in the secondary legal information full-text databases. Even when we don't input the full-text about retrospective documents, automatic indexing is also possible, and the establishment and the practice of expert knowledge and integrated databases are possible in case of the retrospective documents.

• Digital Contents
• /
• no.11 s.42
• /
• pp.19-22
• /
• 1996

• The KIPS Transactions:PartD
• /
• v.13D no.3 s.106
• /
• pp.325-336
• /
• 2006

For supporting LBS service, recent studies on spatial network databases (SNDB) have been done actively. In order to gain good performance on query processing in SNDB, we, in this paper. design efficient storage and index structures for spatial network data, point of interests (POIs), and moving objects on spatial networks. First, we design a spatial network file organization for maintaining the spatial network data itself consisting of both node and edges. Secondly, we design a POI storage and index structure which is used for gaining fast accesses to POIs, like restaurant, hotel, and gas station. Thirdly, we design a signature-based storage and index structure for efficiently maintaining past, current, and expected future trajectory information of moving objects. Finally, we show that the storage and index structures designed in this paper outperform the existing storage structures for spatial networks as well as the conventional trajectory index structures for moving objects.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.04b
• /
• pp.112-114
• /
• 2004

무선 통신 기술의 발달로 인하여 LBS(Location Based System)와 같은 새로운 이동체 관련 서비스가 생겨나고 있다. 위치 기반 서비스에서 클라이언트인 이동체들이 주기적으로 보고하는 위치 데이터를 실시간으로 처리하기 위해 서버에서는 메인 메모리 DBMS를 유지하는 것이 필요한데, 데이터의 양이 계속적으로 증가하는 특성으로 인해 메인 메모리의 공간이 부족할 때 데이터를 디스크로 옮기는 시스템 설계가 필요하다. 그러나 기존의 연구는 대용량 이동체 환경에서의 색인 이주를 위한 노드 선택 정책과 이주를 위해 선택된 노드들의 디스크 배치 정책을 통합하여 나타내지 못하였다. 그러므로 대용량 이동체 데이터베이스 시스템 환경에 적합한 이주 정책들에 대한 연구가 필요하다. 이 논문에서는 대용량 이동체 데이터베이스 환경을 고려한 노드 선택 정책과 디스크 배치 정책을 분류하고 새로운 이주 정 책을 제시한다. 노드 선택 정책으로는 질의 성능을 위해서 캐쉬의 LRU(Least Recently Used) 정책을 이용한 변형된 LRU정책을 제시하고, 삽입 우선 정책으로는 이동체 색인인 R-tree의 삽입 알고리즘을 역이용한 정책을 제시한다. 또한 이주되는 노드들에 대한 디스크 페이지 배치가 시스템의 질의 성능에 영향을 미치므로 이를 고려한 디스크 배치 정책을 제시한다.

• Journal of KIISE:Software and Applications
• /
• v.26 no.3
• /
• pp.365-379
• /
• 1999

본 논문에서는 객체지향 데이터베이스의 클래스 계층에 대한 색인기법으로 이차원 색인구조를 이용하여 조율 가능한 이차원 클래스 색인기법인 2D-CHI를 제안한다. 2D-CHI 에서는 색인된 속성의 키값 도메인과 클래스 식별자 도메인으로 구성된 이차원 도메인상의 색인엔트리들에 대한 클러스터링 문제를 다룬다. 클러스터링 특성이 하나의 속성에 의해서 독점되는 B+-Tree 와 같은 일차원 색인구조를 이용하는 기존의 클래스 색인기법들은 특정 형태의 질의에 대해서만 적합한 색인기법들로서 다양한 형태의 질의들로 구성된 질의 패턴에 대해서 적절하게 대응하지 못한다. 2D-CHI에서는 질의 피턴에 따라 키값 도메인과 클래스 식별자 도메인 사이에서 색이 엔트리들의 클러스터링 정도를 조정함으로써 질의처리의 성능을 향상시킨다. 2D-CHI 의 성능평가를 위하여, 먼저 데이터의 균일 분포를 가정으로 비용 모델을 정립하여 기존의 색인기법들과 색인의 성능을 비교한다. 그리고, 계층 그리드 파일을 이용하여 구현한 2D-CHI의 실험으로 비용 모델을 검증하며, 다양한 실험을 통하여 데이터의 분포와 주어진 질의 형태에 따라 최적의 이차원 클래스 계층 색인구조를 구성할 수 있음을 보인다.

• Journal of the Korean Society for Library and Information Science
• /
• v.32 no.4
• /
• pp.69-86
• /
• 1998

The purpose of velop the indexing algorithm of secondary legal information by the study of characteristics of legal information, to compare the indexing system using controlled vocabulary to the indexing system using natural language in the secondary legal information full-text databases, and to prove propriety and superiority of the indexing system using controlled vocabulary. The results are as follows; 1)The indexing system using controlled vocabulary in the secondary legal information full-text databases has more effectiveness than the indexing system using natural language, in the recall rate, the precision rate, the distribution of propriety, and the faculty of searching for the unique proper-records which the indexing system using natural language fans to find 2)The indexing system which adds more words to the controlled vocabulary in the secondary legal information full-text databases does not better effectiveness in the retail rate, the precision rate, comparing to the indexing system using controlled vocabulary. 3)The indexing system using word-added controlled vocabulary with an extra weight in the secondary legal information full-text databases does not better effectiveness in the recall rate, the precision rate, comparing to the indexing system using word-added controlled vocabulary without an extra weight. This study indicates that it is necessary to have characteristic information the information experts recognize - that is to say, experimental and inherent knowledge only human being can have built-in into the system rather than to approach the information system by the linguistic, statistic or structuralistic way, and it can be more essential and intelligent information system.

• Proceedings of the Korea Contents Association Conference
• /
• 2011.05a
• /
• pp.293-294
• /
• 2011

KISTI collects the scientific and technical articles published in Korea and builds the Korean STI database for scientists. The number of papers exceeds one million. To improve the search efficiency of the database additional processing is required. Abstracting, classification, indexing and extracting is a traditional processing method adding value to information. Indexing and classification are useful tool to assist efficient retrieval. In this paper, authors propose a method to improve information retrieval efficiency by assigning classification code and index terms to records of Korean STI database.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.4
• /
• pp.833-841
• /
• 1999

The texts constructed with Optical Character Recognition(OCR) contain more errors than those constructed with keyboard typing. Therefore, in order to retrieve useful information from OCR texts, we need to develop an effective automatic indexing method. In this paer, we investigate automatic indexing methods that can retrieve information effectively from Korean OCR text database with the character-level recognition ratio of 90%. Experimental result shows that 2-gram indexing provides similar retrieval effectiveness of morpheme-based indexing for the Korean OCR text database.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.7 no.6
• /
• pp.1276-1282
• /
• 2003

The works on the existing spatial indices have been proposed the retrieval methods. However, keeping track of the terminal location of moving objects is more important than the efficiency of the query processing in the moving object database. Therefore, many pure spatial indices are not applicable to the moving objects database which should maintain the object's current location as precise as possible. This paper proposes a method for reducing the construction time of indexing moving objects. We analyze the characteristics of the method to re-index all the objects after each time period and the method to update immediately the locations on reporting their locations. We also newly propose a selective immediate update method using the properties of moving objects in order to minimize the number of database updates.