• Proceedings of the Korea Information Processing Society Conference
• /
• 2000.04a
• /
• pp.244-247
• /
• 2000

이동 통신 기술의 발전으로, 이동컴퓨팅 환경에서의 데이타 서비스에 대한 수요가 증가하고 있다. 이동 호스트 내에 캐쉬가 존재할 경우, 대역폭의 절약 및 빠른 응답시간을 제공할 수 있지만, 캐쉬 일관성을 유지해야하는 부담이 생긴다. 한 셀 내에 존재하는 수 많은 이동 호스트들의 캐쉬 일관성 유지를 위해서 서버(MSS)가 캐쉬 무효화 보고를 일정시간마다 주기적으로 방송하는 방법은 효과적일 수 있다. 기존에 제시된 무효화 보고에서는 갱신된 데이타의 식별자가 사용되지만, 좀 더 적은 양의 대역폭을 소모하는 효율적인 무효화 보고가 되기 위해서는 데이타들을 그룹핑할 수 있는 방안이 연구되어야 한다. 본 논문에서는 서버의 데이타베이스를 데이타의 식별자 값을 기준으로 여러 구역으로 나누었을 때, 데이타의 갱신이 데이타베이스 내 인근 구역에서 많이 발생할 경우, 이진 트리를 기반으로 하여 효율적인 무효화 보고를 생성하는 방법을 제안하고 그 성능을 평가한다.

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.10
• /
• pp.709-721
• /
• 2006

The traditional broadcasting services over terrestrial, satellite and cable media have been unidirectional mass media regardless of TV viewer's preferences. Recently ich media streaming has become possible via the broadb and networks. Furthermore, since bidirectional communication is possible, personalcasting such as personalized streaming services has been emerging by taking into account the user's preference on content genres, viewing times and actors/actresses etc. Accordingly, personal media becomes an important means for content provision service in addition to the traditional broadcasting service as mass media. In this paper, we introduce a user profile reasoning method for target advertisement which is considered an important application in personalcasting service. The proposed user profile reasoning method predicts an unknown TV viewer's gender and ages by analyzing TV Viewing history data. Based on the estimated user's gender and ages, a target advertisement is provided with TV Anytime metadata. A proposed target advertisement system is developed based on the user profile reasoning and the target advertisement selection method. To show the effectiveness of our proposed methods, we present a plenty of experimental results by using realistic TV viewing history data.

• Journal of KIISE:Databases
• /
• v.30 no.1
• /
• pp.95-107
• /
• 2003

The broadcast environment has asymmetric communication aspect that is typically much greater communication bandwidth available from server to clients than in the opposite direction. In addition, most of mobile computing systems allow mostly read-only transactions from mobile clients for retrieving different types of information such as stock data, traffic information and mews updates. Since previous concurrency control protocols, however, do not consider such a particular characteristics, the performance degradation occurs when previous schemes are applied to the broadcast environment. In this paper, we propose the efficient concurrency control for query transaction in broadcast environment. The following requirements are satisfied by adapting weak consistency that is the appropriate correctness criterion of read-only transactions: (1) the mutual consistency of data maintained by the server and read by clients (2) the currency of data read by clients. We also use the serialization graph scheme to check the weak consistency efficiently. As a result, we improved a performance by reducing unnecessary aborts and restarts of read-only transactions caused when global serializability was adopted.

• Journal of KIISE:Databases
• /
• v.29 no.6
• /
• pp.502-512
• /
• 2002

Most of previous replication schemes assume lazy schemes, which asynchronously propagate replica updates to other nodes after the updating transaction commits. While lazy schemes are novel in the sense that they can resolve high deadlock frequencies of eager schemes, they suffer from the fact that users should be responsible for the data consistency. Recently replication schemes based on the messaging order of group communication have been studied. They can reduce the deadlock frequencies using the messaging order, but they have another problem of increasing execution overhead of aborted transactions at high degree of concurrency. This is because the sender node validates global serializability after multicasting replica update messages to other nodes. In this paper, we propose an efficient eager replication scheme for reducing the number of messaging and overhead of aborted transactions significantly. The proposed scheme validates any conflicts before multicasting and does not multicast when there is any conflict; hence, it can exploit performance improvement by alleviating the message traffic for replica update or by reducing the number of disk accesses and locking delay due to aborted transactions.

• Journal of KIISE:Computing Practices and Letters
• /
• v.7 no.6
• /
• pp.661-683
• /
• 2001

There is a rapid increase in the use of digital video information in recent years, it becomes more important to manage video databases efficiently. The development of high speed data network and digital techniques has emerged new multimedia applications such as internet broadcasting, Video On Demand(VOD) combined with video data processing and computer. Video database should be construct for searching fast, efficient video be extract the accurate feature information of video with more massive and more complex characteristics. Video database are essential differences between video databases and traditional databases. These differences lead to interesting new issues in searching of video, data modeling. So, cause us to consider new generation method of database, efficient retrieval method of video. In this paper, We propose the construction and generation method of the video database based on contents which is able to accumulate the meaningful structure of video and the prior production information. And by the proposed the construction and generation method of the video database implemented the video database which can produce the new contents for the internet broadcasting centralized on the video database. For this production, We proposed the video indexing method which integrates the annotation-based retrieval and the content-based retrieval in order to extract and retrieval the feature information of the video data using the relationship between the meaningful structure and the prior production information on the process of the video parsing and extracting the representative key frame. We can improve the performance of the video contents retrieval, because the integrated video indexing method is using the content-based metadata type represented in the low level of video and the annotation-based metadata type impressed in the high level which is difficult to extract the feature information of the video at he same time.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.1
• /
• pp.109-113
• /
• 2011

Recently, according to the development of ubiquitous computing, the u-GIS which not only used in u-Transport, u-Care, u-Fun, u-Green, u-Business, u-Government, and u-City but also used to provides various spatial information such as the location of user is being the core technology of the ubiquitous computing environment. In this paper, we implemented an mobile spatio-temporal Query Processing Systems for handling the Spatio-Temporal Data in mobile equipment.The mobile spatio-temporal Query Processing Systems provides the spatio-temporal data type and the spatio-temporal operator that is expanded by the spatial data type and the spatial operator from OepenGIS "Simple Feature Specification for SQL". It supports arithmetic coding compression techniques that is considered with a spatio-temporal data specific character. It also provides the function of data cashing for improving the importation and exportation of the spatio-temporal data between a embedded spatio-temporal DBMS and u-GIS server.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.11
• /
• pp.2763-2775
• /
• 1998

In mobile computing environments, to efficiently use the narrow bandwidth of wireless networks a mobile host caches the data that are frequently accessed. But, because the cached data can be inconsistent with the data n a server due to the host mobility and the disconnection from a server, the usefullness of cached data may be losted. The traditional methods emphasize on the cache consistency and assume that broadcasting times are synchronized at all mobile supprot stations. In this paper, we propose a strategy to maintain cache consistency, which resolves the problems that be caused by the migration of mobile host. The proposed strategy has asynchronous broadcasting time and reduces the communication overhead caused by the synchronization. Also, by preventing the unnecessary messages transmitting from the mobile support station to a mobile host, this strategy can reduce the communication cost and use the narrow bandwidth of wireless networks efficiently.

• Journal of KIISE:Databases
• /
• v.28 no.2
• /
• pp.243-252
• /
• 2001

이동 컴퓨팅 환경의 데이터 방송 시스템에서 클라이언트에게 최소의 응답시간을 제공할 수 있도록 방송을 스케쥴링 하는 것은 매우 중요하다. 본 논문에서는, 방송 스케쥴링 기법들의 성능을 응답시간 측면에서 모의 실험을 통하여 평가하고 분석한다. 기존 연구와는 달리, 클라이언트의 요구 형태 변화를 고려한 여러 가지 일반적이고 현실적인 응용 환경을 설정하여 평가한다.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 1990.06a
• /
• pp.715-719
• /
• 1990

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.9 no.5
• /
• pp.183-189
• /
• 2009

Recently, PCS, PDA and mobile devices, such as the proliferation of spread, GPS (Global Positioning System) the use of, the rapid development of wireless network and a regular user even images, audio, video, multimedia data, such as increased use is for. In particular, video data among multimedia data, unlike the moving object, text or image data that contains information about the movements and changes in the space of time, depending on the kinds of changes that have sigongganjeok attributes. Spatial location of objects on the flow of time, changing according to the moving object (Moving Object) of the continuous movement trajectory of the meeting is called, from the user from the database that contains a given query trajectory and data trajectory similar to the finding of similar trajectory Search (Similar Sub-trajectory Retrieval) is called. To search for the trajectory, and these variations, and given the similar trajectory of the user query (Tolerance) in the search for a similar trajectory to approximate data matching (Approximate Matching) should be available. In addition, a large multimedia data from the database that you only want to be able to find a faster time-effective ways to search different from the existing research is required. To this end, in this paper effectively divided into a grid to search for the trajectory to the trajectory of moving objects, similar to the effective support of the search trajectory offers a new grid-based search techniques.