• Journal of KIISE:Databases
• /
• v.32 no.3
• /
• pp.285-296
• /
• 2005

In mobile distributed systems the data on the air can be accessed by a lot of mobile clients. And, we need an indexing scheme in order to energy-efficiently access the data on the wireless broadcast stream. In conventional indexing schemes, they use the values of primary key attributes and construct tree-structured index. Therefore, the conventional indexing schemes do not support content-based retrieval queries such as partial-match queries. In this paper we propose an indexing scheme, called B2V-Tree, which supports partial match queries on wireless broadcast data stream. For this purpose, we construct a tree-structured index which is composed of bit-vectors, where the bit-vectors are generated from data records through multi-attribute hashing.

• 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 Digital Contents Society
• /
• v.10 no.1
• /
• pp.1-10
• /
• 2009

One important issue to generalize the ubiquitous paradigm is the development of user-centralized and intelligent ubiquitous computing systems. Sharing knowledge and correct communication between users and devices are needed to be aware of continuous changed context information and infer services for which users are suited. The goal of this paper is to describe and manage effectively the meaning of services or data which each device offers for interaction between users and devices based on semantic relationships and reasoning. In this paper, we represent semantic data using OWL and design a ubiquitous based intelligent system. We propose some index structures and strategies to process queries classified by each subsystem and adopt labeling schemes to identify classes and resources in the semantic data. We can find devices which satisfies various user's requests exactly and quickly using the proposed strategies.

• Journal of KIISE:Software and Applications
• /
• v.30 no.1_2
• /
• pp.129-139
• /
• 2003

The PC cluster architecture is considered as a cost-effective alternative to the existing supercomputers for realizing a high-performance information retrieval (IR) system. To implement an efficient IR system on a PC cluster, it is essential to achieve maximum parallelism by having the data appropriately distributed to the local hard disks of the PCs in such a way that the disk I/O and the subsequent computation are distributed as evenly as possible to all the PCs. If the terms in the inverted index file can be classified to closely related clusters, the parallelism can be maximized by distributing them to the PCs in an interleaved manner. One of the goals of this research is the development of methods for automatically clustering the terms based on the likelihood of the terms' co-occurrence in the same query. Also, in this paper, we propose a method for duplicate distribution of inverted index records among the PCs to achieve fault-tolerance as well as dynamic load balancing. Experiments with a large corpus revealed the efficiency and effectiveness of our method.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.6
• /
• pp.1250-1256
• /
• 2004

The movement of continuously changing positions should be stored and indexed for querying current and past positions. A simple extension of the original R-tree to add time as another dimension, called 3D R-tree, does not handle current position queries and does not address the problem of low space utilization due to high overlap of index nodes. In this paper, 1 propose the dynamic splitting policy for improving the 3D R-tree in order to improve space utilization of split nodes. 1 also extend the original 3D R-tree by introducing a new tagged index structure for being able to query the current and past positions of moving objects. 1 found out that my extension of the original R-tree, called the tagged dynamic 3DR-tree, outperforms both the 3D R-tree and 75-tree when querying current and past position.

• The KIPS Transactions:PartD
• /
• v.16D no.6
• /
• pp.845-850
• /
• 2009

Use of XML data has been increased with growth of Web 2.0 environment. XML is recognized its advantages by using based technology of RSS or ATOM for transferring information from blogs and news feed. Bitmap clustering is a method to keep index in main memory based on Relational DBMS, and which performed better than the other XML indexing methods during the evaluation. Existing method generates too many clusters, and it causes deterioration of result of searching quality. This paper proposes k-Bitmap clustering method that can generate user defined k clusters to solve above-mentioned problem. The proposed method also keeps additional inverted index for searching excluded terms from representative bits of k-Bitmap. We performed evaluation and the result shows that the users can control the number of clusters. Also our method has high recall value in single term search, and it guarantees the searching result includes all related documents for its query with keeping two indices.

• The KIPS Transactions:PartD
• /
• v.16D no.2
• /
• pp.161-168
• /
• 2009

Recently, use of various position base servicesthat collect position information for moving object and utilize in real life is increasing by the development of wireless network technology. Accordingly, new index structures are required to efficiently retrieve the consecutive positions of moving objects. This paper addresses an improved trajectory split algorithm for the purpose of efficiently supporting spatio-temporal range queries using index structures that use Minimum Bounding Rectangles(MBR) as trajectory approximations. We consider volume of Extended Minimum Bounding Rectangles (EMBR) to be determined by average size of range queries. Also, Use a priority queue to speed up our process. This algorithm gives in general sub-optimal solutions with respect to search space. Our improved trajectory split algorithm is going to derive minimizing volume of EMBRs better than previously proposed split algorithm.

• Journal of KIISE:Databases
• /
• v.33 no.1
• /
• pp.1-11
• /
• 2006

It is possible to track the moving vehicle as well as to develop the location based services actively according to the progress of wireless telecommunication and GPS, to the spread of network, and to the miniaturization of cellular phone. To provide these location based services, it is necessary for an index technique to store and search too much moving object data rapidly. However the existing indices require a lot of costs to insert the data because they store every position data into the index directly. To solve this problem in this paper, we propose a buffer node operation and design a GU-tree(Group Update tree). The proposed buffer node method reduces the input cost effectively since the operation stores the moving object location data in a group, the buffer node as the unit of a non-leaf node. hnd then we confirm the effect of the buffer node operation which reduces the insert cost and increase the search performance in a time slice query from the experiment to compare the operation with some existing indices. The proposed tufter node operation would be useful in the environment to update locations frequently such as a transportation vehicle management and a tour-guide system.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.06d
• /
• pp.52-54
• /
• 2006

최근 데이타 중심 저장 방식의 센서 네트워크에서 다차원 범위 질의를 위한 인덱스들이 제시되고 있다. 기존에 제시된 다차원 범위 질의 인덱스는 일반적으로 다차원 속성 도메인과 센서 노드의 공간 도메인을 직접 매핑하여 데이타를 관리하는 구조로 되어있다. 그러나, 이러한 구조는 센서 노드의 공간 도메인을 정적으로 분할하기 때문에 센서 노드를 포함하지 않는 영역이 생성되어 데이타 저장 및 질의 처리에서 불필요한 통신이 발생하는 문제가 있다. 본 논문은 이러한 문제를 해결하기 위해 센서 노드의 공간 도메인이 센서 노드를 포함하도록 센서 네트워크 영역을 동적으로 분할하는 다차원 범위 질의 인덱스를 제안한다. 제안하는 인덱스는 센서 노드의 위치에 따라 센서 네트워크 영역을 동적으로 분할하여 데이타 저장 및 질의 처리시 목적 영역으로의 라우팅 경로를 최적화한다. 그리고, 분할된 영역은 모두 센서 노드를 포함함으로 센서 노드에서 발행하는 저장 부하를 분산시켜 전체 네트워크에서 발생하는 전체 통신비용을 줄인다. 실험 결과 제안한 인덱스는 DIM보다 전체 센서 네트워크와 hotspot의 통신비용에서 각각 최대 35%, 60%의 성능 향상을 보였다.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.36 no.3
• /
• pp.185-196
• /
• 2018

In order to overcome the problem that outdoor and indoor spatial information service are separately utilized, an integration service system of spatial information that is linked from outdoor to indoor has been implemented. As a result of the study, "0001.xml" corresponding to the file index key value, which is the service connection information in the building information of the destination, was extracted from the prototype verification of the system, the search word of 'Kim AB' was transmitted to the indoor map server and converted from the outdoor map service to the indoor map service through confirmation of the navigation service connected information, using service linkage information and search words of the indoor map service was confirmed that the route was displayed from the entrance of the building to the destination in the building through the linkage search DB (Database) table and the search query. Therefore, through this study was examined the possibility of linking indoor and outdoor DB through vector spatial information integration service system. The indoor map and the map engine were implemented based on the same vector map format as the outdoor map engine, it was confirmed that the connectivity of the map engine can be applied.