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

시간의 흐름에 따라 그 위치가 빈번히 변화하는 이동 객체의 특성상 실시간으로 증가하는 이동 객체의 궤적정보를 효과적으로 관리할 수 있는 효율적인 색인 기법이 요구된다. 따라서 본 논문에서는 이동 객체의 궤적을 색인하기 위해 기존에 제안되었던 TB 트리의 성능을 개선시킬 수 있는 확장된 TB-트리(Extented TB-Tree：ETB-Tree)를 제안한다. 기존의 TB 트리는 이동 객체의 궤적 세그먼트를 삽입할 때마다 선행 세그먼트를 가지고 있는 리프 노드를 찾기 위해 루트 노드부터 리프 노드까지 순회해야만 하기 때문에 불필요한 노드 접근으로 인한 오버헤드가 발생한다 이를 위해 ETB 트리는 선행 노드를 직접적으로 접근하기 위해 이동객체의 처음 세그먼트와 마지막 세그먼트가 저장된 리프 노드를 가리키는 포인터 정보와 더불어 디스크에서의 폐이지를 가리키는 페이지 번호를 별도의 테이블에 같이 유지한다. 따라서, 저장 시 동일한 이동 객체의 선행 노드를 빨리 검색할 수 있고, 궤적 질의시 직접적으로 디스크에 접근해 해당 객체의 궤적들을 검색함으로써 검색 성능을 향상시킬 수 있다. 아울러 ETB 트리는 새로운 이동 객체의 궤적 정보가 삽입될 때마다 메모리 상의 트리뿐만 아니라 디스크에 반영함으로써 트리의 일관성을 유지한다.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.11
• /
• pp.919-931
• /
• 2000

본 논문에서 우리는 전체 벡터 디렉토리와 포인터 디렉토리의 중간 형태를 가지는 새로운 디렉토리인 세그먼트 디렉토리를 제안한다. 이는 대부분의 포인터 기반 디렉토리 방법들에서 디렉토리 저장 효율을 높이기 위하여 사용될 수 있다. 포인터가 단지 하나의 프로세서만을 가리키는 데 비하여, 세그먼트 디렉토리 요소는 포인터와 거의 같은 수의 비트들을 가지고 여러 개의 프로세서들을 동시에 가리킬 수 있다. 본 논문에서는, 세그먼트 디렉토리를 기존의 네 가지 한정 디렉토리 방법들에 적용하고, 이렇게 얻은 성능 개선을 측정, 분석하였다. 세그먼트 디렉토리는 한정 디렉토리 방법들의 성능을 저하시키는 요인인 디렉토리 넘침을 71% 까지 제거시킴으로써, 이 네 가지 방법들 상에서 수행된 모든 벤치마크 프로그램들에 대해 대역폭 요구량과 디렉토리 제어기 점유도, 메모리 접근 지연을 감소시켜서 프로그램의 수행을 가속시켰다. 게다가, 세그먼트 디렉토리는 추가적인 하드웨어 부담이나 프로토콜 복잡도 없이 간단하게 구현될 수 있다.

• 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 Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.11B
• /
• pp.1142-1150
• /
• 2009

In this paper, we propose an novel bandwidth scheduling algorithm for the MAC protocol employed by the Data Over Cable Service Interface Specifications (DOCSIS) 3.0 compliant cable networks. The proposed algorithm statistically improves the chances of request piggybacking to minimize the access delay. It utilizes the piggyback request feature of the segment packets that has been newly specified in DCOSIS 3.0. In DOCSIS 3.0, a bandwidth request can be granted to several upstream channels within an upstream bonding group. The grant on each individual channel is treated as a segment packet. We find the optimal segment placement to minimize the access delay in the proposed algorithm. We also use a self-similar traffic model for simulation and analysis to evaluate the performance of the proposed algorithm.

• Journal of KIISE:Databases
• /
• v.32 no.3
• /
• pp.254-262
• /
• 2005

This paper presents a new sequential indexing method called segment-page indexing (SP-indexing) for multidimensional range queries. The design objectives of SP-indexing are twofold:(1) improving the range query performance of multidimensional indexing methods (MIMs) and (2) providing a compromise between optimal index clustering and the full index reorganization overhead. Although more than ten years of database research has resulted in a great variety of MIMs, most efforts have focused on data-level clustering and there has been less attempt to cluster indexes. As a result, most relevant index nodes are widely scattered on a disk and many random disk accesses are required during the search. SP-indexing avoids such scattering by storing the relevant nodes contiguously in a segment that contains a sequence of contiguous disk pages and improves performance by offering sequential access within a segment. Experimental results demonstrate that SP-indexing improves query performance up to several times compared with traditional MIMs using small disk pages with respect to total elapsed time and it reduces waste of disk bandwidth due to the use of simple large pages.

• The KIPS Transactions:PartC
• /
• v.11C no.5
• /
• pp.645-652
• /
• 2004

In this paper, we aggregate multi-links information between boundary nodes using the line segment scheme that aggregates topology in-formation within PG referring bandwidth and delay parameter. The proposed scheme can search multi-links efficiently using the depth priority method based on hop count instead of searching all links. To do this, we propose a modified line segment algorithm using two line segment method that represents two points which consist of delay-bandwidth pair to reduce topology information and provide a flexibility to the multi pie-links aggregation. And we apply it to current star topology aggregation. To evaluate performance of the proposed scheme, we compare/analyze the current method with the proposed scheme with respect to call success rate, access time and crankback rate. Through the simulation result analysis, the proposed star topology aggregation scheme presents the better performance than existing scheme.

• The Journal of the Korea Contents Association
• /
• v.5 no.2
• /
• pp.187-197
• /
• 2005

In this paper, we propose an extended TB-tree, called ETB-tree, which can improve the performance of an existing TB-tree proposed for indexing the trajectories of moving objects in Location-Based Service(LBS). The proposed ETB-tree directly accesses the preceding node by maintaining a direct table, called D-Table which contains the page number in disk and memory pointers pointing the leaf node with the first and last lines segment of moving objects. It can improve the insertion performance by quick searching the preceding node of a moving object and retrieval performance owing to accessing directly the corresponding trajectories In disk for the trajectory-based query. In addition, the ETB-tree provides consistency of a tree by reflecting a newly inserted line segment to the tree both in memory and disk. The experimental results show that the proposed indexing technique gains better performance than other traditional ones with respect to the insertion and retrieval of a trajectory query.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10c
• /
• pp.586-588
• /
• 2004

최근 인터넷 틴 초고속 정보통신이 급속히 확산이 되면서 장소와 시간의 구애를 받지 않고, 인터넷에 접속할 수 있는 무선 LAN 사용이 점차 확대되었다. 무선 LAN을 이용한 무선 인터넷은 유선 인터넷에 비해 낮은 대역폭을 갖는다. 그리고 이동성과 휴대성을 고려한 배터리 기반의 동력을 사용함으로 에너지 효율적인 접근 방법이 필요하다. 본 논문에서는 TCP-Westwood를 수정하며 전송률 및 에너지 효율을 향상 시키기 위해 세그먼트 크기 조절 방법을 제안하였으며, 이를 NS-2 시뮬레이터를 이용한 실험을 통해 전송률 향상 및 에너지 효율이 개선됨을 확인하였다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.8
• /
• pp.1828-1834
• /
• 2004

With the rapid development of wireless communications and mobile technologies, requirements of various services based on moving objects like location-based services and mobile applications services have been increased. In this paper, we propose an index structure which can improve the performance on trajectory-based query especially, one of the various query types for moving objects in mobile applications. It maintains link table(L-Table) to obtain good efficiency on retrieval and insertion performance of the existing TB(Trajectory Bundle)-tree proposed for trajectory-based query of moving objects. The L-Table contains page number in disk and memory pointers pointing the leaf node with the first and last line segment of moving objects in order to directly access preceding node. In addition, we design to reside a part of whole index in main memory by preserving a fixed size of buffer in case of being restricted by available main memory. Finally, experimental results with various data sets show that the proposed technique is superior to the existing index structures with respect to insertion and trajectory-based query.

• The KIPS Transactions:PartA
• /
• v.15A no.1
• /
• pp.53-60
• /
• 2008

Streaming media has contributed to a significant amount of today's Internet Traffic. Like traditional web objects, rich media objects can benefit from proxy caching, but caching streaming media is more of challenging than caching simple web objects, because the streaming media have features such as huge size and high bandwidth. And to support various bandwidth requirements for the heterogeneous ubiquitous devices, a transcoding proxy is usually necessary to provide not only adapting multimedia streams to the client by transcoding, but also caching them for later use. The traditional proxy considers only a single version of the objects, whether they are to be cached or not. However the transcoding proxy has to evaluate the aggregate effect from caching multiple versions of the same object to determine an optimal set of cache objects. And recent researches about multimedia caching frequently store initial parts of videos on the proxy to reduce playback latency and archive better performance. Also lots of researches manage the contents with segments for efficient storage management. In this paper, we define the 9-events of transcoding proxy using 4-atomic events. According to these events, the transcoding proxy can define the next actions. Then, we also propose the segment-based caching policy for the transcoding proxy system. The performance results show that the proposing policy have a low delayed start time, high byte-hit ratio and less transcoding data.