• Journal of Internet Computing and Services
• /
• v.15 no.6
• /
• pp.107-115
• /
• 2014

Recently, increased use of the internet resulted in generation of large and diverse types of data due to increased use of social media, expansion of a convergence of among industries, use of the various smart device. We are facing difficulties to manage and analyze the data using previous data processing techniques since the volume of the data is huge, form of the data varies and evolves rapidly. In other words, we need to study a new approach to solve such problems. Many approaches are being studied on this issue, and we are describing an effective design and development to build indexing engine of big data platform. Our goal is to build a system that could effectively manage for huge data set which exceeds previous data processing range, and that could reduce data analysis time. We used large SNMP log data for an experiment, and tried to reduce data analysis time through the fast indexing and searching approach. Also, we expect our approach could help analyzing the user data through visualization of the analyzed data expression.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.14 no.5
• /
• pp.173-178
• /
• 2014

Smart devices linked to high speed networks enable us to obtain location dependent data at anywhere and anytime. In this environment, a wireless data broadcast system can deal with enormous data request from a great number of clients effectively. In order to set up an efficient wireless data broadcast system, various data scheduling and indexing schemes have been proposed. However, a simulation framework to evaluate the schemes is not reported yet. In this paper, we design and develop a simulation framework for a wireless data broadcast system. The developed simulation framework can evaluate quickly a wireless data broadcast system and has scalability to adopt various data scheduling and indexing schemes for wireless data broadcasting.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.15 no.1
• /
• pp.223-228
• /
• 2015

Korean climate becoming increasingly subtropical by climate warming makes local heavy rainfall frequently. To avoid damages from the local heavy rainfall, we need a forecasting service for a great number of clients. However, there is not the framework for the service based on wireless data broadcasting yet. In this paper, we design and implement a service framework for local heavy rainfall forecasting using wireless data broadcast. The developed service framework has scalability that can adopt various data scheduling and indexing schemes. We show the efficiency of the proposed framework to forecast local heavy rainfall through a simulation study.

• International Journal of Internet, Broadcasting and Communication
• /
• v.16 no.1
• /
• pp.140-147
• /
• 2024

In Current artificial structures, we must periodically make their safety inspections. In this process, we should consider the safety of workers and the accuracy of safety checks and also consider time and cost savings for safety inspections. Additionally, in the fields of architecture and civil engineering, we are unavoidable the use of foreign commercialized BIM model tools. To address these challenges, we propose mapping crack areas and BIM 3D design drawings based on augmented reality (AR) for the safety inspection of Huge Bridges. For this purpose, we define indexing of 2D/3D drawing models, create the tabulation of all 2D/3D drawings into a database, analyze QR codes, and finally integrate with augmented reality devices. we may expect our method to improve the efficiency of safety inspections on bridge sites. Moreover, we will enable the domestics of our pure technology.

• Journal of Internet Computing and Services
• /
• v.2 no.1
• /
• pp.49-61
• /
• 2001

Internet has been becoming widely popular and making rapid progress and network technologies is showing extension in data transmission speeds. Rapid and convenient multimedia services supplied with high quality and high speed are being needed, This paper treats of the design and implement method of clip-based video retrieval system on the world-wide-web environments. The implemented system consists of the content-based indexing system supporting convenient services for video contents providers and the web-based retrieval system in order to make it easy and various information retrieval for users on the world-wide-web. Three important methods were used in the content-based indexing system. Key frame extracting method by dividing video data, clip file creation method by clustering related information and video database build method by using clip unit, In web-based retrieval system, retrieval method by using a key word, two dimension browsing method of key frame and real-time display method of the clip were used. As a result. the proposed methodologies showed a usefulness of video content providing. and provided an easy method for searching intented video content.

• Journal of KIISE:Databases
• /
• v.31 no.1
• /
• pp.72-81
• /
• 2004

Theses days, a number of data over the Internet are represented using XML because of a virtue of XML. In proportion to the increase of XML data, query processing techniques are required that support quickly and efficiently the diverse queries to search the useful information on XML documents. But, up to now, the researches handling queries for XML data are methodologies focusing on how to process regular path expressions. Therefore, we have developed a new genealogy-based indexing technique to solve various queries such as not only regular path expression but also simple path expression, path expression referencing other elements, and so on. Also, we have applied this technique on object-relational model and evaluated the performance for many documents and various query types. The result shows improved performance in comparison with the other storage techniques.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.16 no.1
• /
• pp.94-100
• /
• 2006

Computing paradigm shift to internet-based one has accelerated the use of XML in diverse applications. This phenomena has made the explosive increases of XML data and it triggered many active researches in maintaining very huge amount of XML data in turn. In this paper we present a persistent graph-based XML indexing lot data-centric XML data. In our approach we use 3 graphs to represent XML indexes and XML data itself. They are schema graph, data graph index. And then we have mapped those graphs to B+-trees the persistency. With our approach we can achieve linear query execution time with the increase of XML sizes.

• ETRI Journal
• /
• v.22 no.2
• /
• pp.32-42
• /
• 2000

The existing multi-dimensional index structures are not adequate for indexing higher-dimensional data sets. Although conceptually they can be extended to higher dimensionalities, they usually require time and space that grow exponentially with the dimensionality. In this paper, we analyze the existing index structures and derive some requirements of an index structure for content-based image retrieval. We also propose a new structure, for indexing large amount of point data in a high-dimensional space that satisfies the requirements. in order to justify the performance of the proposed structure, we compare the proposed structure with the existing index structures in various environments. We show, through experiments, that our proposed structure outperforms the existing structures in terms of retrieval time and storage overhead.

• Proceedings of the KIEE Conference
• /
• 2006.04a
• /
• pp.21-23
• /
• 2006

Due to development of Internet network environments and data compression techniques, the size and amount of multimedia data has greatly increased. They are compressed before transmission or storage. Dealing with these compressed data such as video retrieval or indexing requires the decoding procedure most of the time. In video retrieval and indexing a color histogram is one of the most frequently used tools. We propose a novel scheme for extracting color histograms from images transformed into the compressed domain using $8{times}8$ DCT(Discrete Cosine Transform). In this scheme an averaged version of original image is obtained by filtering DCT coefficients with a filter we destined.

• Proceedings of the Acoustical Society of Korea Conference
• /
• spring
• /
• pp.151-154
• /
• 2002

본 논문에서는 음성 데이터에서 동일한 화자의 음성 구간을 찾아내는 화자 인덱싱(Speaker Indexing) 기술 중 사전 화자 모델링 과정을 통한 인덱싱 방법을 제안하고 실험하였다. 제안한 인덱싱 방법은 문장 독립(Text Independent) 화자 식별(Speaker Identification)에 사용할 수 있는 모음(Vowel)에 대해 특징 파라미터를 추출하고, 이를 바탕으로 화자별 모델을 구성하였다. 인덱싱은 음성 구간에서 모음의 위치를 검출하고, 구성한 화자 모델과의 거리 계산을 통하여 가장 가까운 모델을 식별된 결과로 한다. 그리고 식별된 결과는 화자 구간 변화와 음성 데이터의 특성을 바탕으로 필터링 과정을 거쳐 최종적인 인덱싱 결과를 얻는다. 화자 인덱싱 실험 대상으로 방송 뉴스를 녹음하여 10명의 화자 모델을 구성하였고, 인덱싱 실험을 수행한 결과 $91.8\%$의 화자 인덱싱 성능을 얻었다.