• International journal of advanced smart convergence
• /
• v.7 no.4
• /
• pp.10-18
• /
• 2018

For the information services supporting requests of data items from a great number of mobile clients, wireless data broadcasting is an effective way because it can accommodate any number of clients. In the wireless data broadcasting, various air indexing schemes and data scheduling schemes have been developed in order to enable the clients to access their desired data items efficiently. The broadcasting system needs a method to simulate newly designed air indexing and scheduling schemes of the system, and to evaluate the performance parameters of the schemes. In this paper, we design an expandable and efficient simulation framework for the wireless data broadcasting based on the partition of data ID space. The framework can adopt regular and irregular space partition and evaluate various performance parameters of the broadcasting system. We implement a testbed of the broadcasting system using the framework, that adopts IIP, GDI and EXP as its air indexing schemes. We simulate the system using the testbed and evaluate the performance parameters of the system. Thus, we show the efficiency and expandability of the designed and implemented framework.

• International Journal of Internet, Broadcasting and Communication
• /
• v.5 no.1
• /
• pp.14-17
• /
• 2013

RDF data is widely used for exchanging data nowadays to enable semantic web era. This leads to the need for storing and retrieving these data efficiently and effectively. Recently, the structure index in graph-based perspective is considered as a promising approach to deal with issues of complex query graphs. However, even though there are many researches based on structure indexing, there can be a better architectural approach instead of addressing the issue as a part. In this research, we propose architecture for storing, query processing and retrieving RDF data in efficient manner using structure indexing. Our research utilizes research results from iStore and 2 relation-based approaches and we focus on improving query processing to reduce the time of loading data and I/O cost.

• 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.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.14 no.1
• /
• pp.113-118
• /
• 2014

Recently, a few studies on context information have been focused to collect phenomena data like a temperature and a humidity in indoor environments. The importance of the former is increasingly recognized with changing environments and increase of heat stress in building. In this paper we present an indoor comfort index framework based on GIS for supporting context information instead of phenomena data in environments. We also present method for supporting comfort index and context information based on GIS in outdoor environments.

• International journal of advanced smart convergence
• /
• v.6 no.4
• /
• pp.9-18
• /
• 2017

In order to respond to the ever-changing media environments in the era of smart and mobile technology, KBS has introduced and partially applied PIE-TV and PIE-nonTV modes that monitor the average number of viewers among the national population group by means of the sample household extraction method which is a traditional way of rating investigation. This study analyzes the correlation between the number of viewers of premiere, re-air broadcasting, and MPP channel programs and the number of OTT-based VOD viewers in reference to the data extracted from PIE-TV survey results. KBS conducted a survey for 3 months between June and August 2017 to measure the PIE-TV Index, based on which the above-mentioned correlation was analyzed with programs classified to entertainment, drama, and cultural programs. For data analysis, SPSS (Ver. 18.0 for Window, SPSS Inc, Chicago, IL, USA) was utilized. It was assumed that when p<0.05 in the confidence interval of 95%, statistically significance would be secured. Among the 30 subjects in the simple correlation analysis, the parameter was determined by the Person correlation coefficient and the non-parameter by the Spearman correlation coefficient. Analysis results are as below: (1) As the number of viewers of premier entertainment, drama, and cultural programs was larger, the number of VOD viewers was larger accordingly. (2) As for entertainment and drama programs, as the number of re-air broadcasting viewers was larger, the number of VOD viewers decreased accordingly. (2) As for entertainment and drama programs, as the number of MPP viewers was larger, the number of VOD viewers decreased accordingly. It is expected that this statistical data can be utilized for strategic planning of MPP channel lineups including terrestrial TV broadcasting, cable TV, etc.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.8 no.6
• /
• pp.141-146
• /
• 2008

Recently, it is studying to provide to users through internet in the SensorWeb of OGC(Open Geospatial Consortium) saving and maintaining data and image information gathered from sensor network. It is necessary to study about data convergence as binding audio and video for delivering the sensing data and image information to users with real-time system. In this article, it suggests how to convergence sensing data and moving picture collected from the sensor network using index. This program indicates both of them that collected sensing data and information identified of moving picture in the integration index and based on this program provides sensing data moving picture at the same time referencing integration index, if the user asks. To verify suggested method designing real-time multimedia service structure using sensor network and image installation and implementing Ubiquitous realtime multimedia system integrating moving picture and sensing data based on index. As a result of this program, it is confirmed providing real-time multimedia service to request information of application service using integration index collected image and sensing data from wireless sensor network and image installation suggested data convergence method.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.1
• /
• pp.203-209
• /
• 2012

Recently, k-nearest neighbors query methods based on wireless broadcasting environment are actively studied. The advantage of wireless broadcasting environment is the scalability that enables collective query processing for unspecified users connected to the server. However, in case existing k-NN query is applied in wireless broadcasting environment, there can be a disadvantage that backtracking may occur and consequently the query processing time is increasing. In this paper proposes a hierarchical bitmap-based spatial index in order to efficiently process the k-NN queries in wireless broadcasting environment. HBI reduces the bitmap size using such bitmap information and tree structure. As a result, reducing the broadcast cycle can reduce the client's tuning time and query processing time. In addition, since the locations of all the objects can be detected using bitmap information, it is possible to tune to necessary data selectively. For this paper, a test was conducted implementing HBI to k-NN query and the proposed technique was proved to be excellent by a performance evaluation.

• Journal of KIISE:Databases
• /
• v.36 no.1
• /
• pp.50-62
• /
• 2009

In wireless and mobile environments, data broadcasting is recognized as an effective way for data dissemination due to its benefits to bandwidth efficiency, energy-efficiency, and scalability. In this paper, we address the problem of delayed query processing raised by tree-based index structures in wireless broadcast environments, which increases the access time of the mobile clients. We propose a novel distributed index structure and a clustering strategy for streaming XML data which enable energy and latency-efficient broadcast of XML data. We first define the DIX node structure to implement a fully distributed index structure which contains tag name, attributes, and text content of an element as well as its corresponding indices. By exploiting the index information in the DIX node stream, a mobile client can access the wireless stream in a shorter latency. We also suggest a method of clustering DIX nodes in the stream, which can further enhance the performance of query processing over the stream in the mobile clients. Through extensive performance experiments, we demonstrate that our approach is effective for wireless broadcasting of XML data and outperforms the previous methods.

• Journal of Communications and Networks
• /
• v.7 no.4
• /
• pp.478-488
• /
• 2005

To conserve the usage of energy, indexing techniques have been developed in a wireless mobile environment. However, the use of interleaved index segments in a broadcast cycle increases the average access latency for the clients. In this paper, we present the broadcast-based location dependent data delivery scheme (BBS) for dynamic range queries. In the BBS, broadcasted data objects are sorted sequentially based on their locations, and the server broadcasts the location dependent data along with an index segment. Then, we present a data prefetching and caching scheme, designed to reduce the query response time. The performance of this scheme is investigated in relation to various environmental variables, such as the distributions of the data objects, the average speed of the clients, and the size of the service area.

• Journal of Internet Computing and Services
• /
• v.11 no.1
• /
• pp.15-20
• /
• 2010

In this paper, we propose a novel approach to reduce spatial query access latency and energy consumption by leveraging results from nearby peers in wireless broadcast environments. We propose a three-tier Hierarchical Location-Based Sequential access index, called HLBS, which provides selective tuning (pruning and searching entries) without pointers using a linear accessing structure based on the location of each data object. The HLBS saves search cost and index overhead, since the small index size with a sequential index structure results in low access latency overhead and facilitates efficient searches for sequential-access media (wireless channels with data broadcast). Comprehensive experiments illustrate that the proposed scheme is more efficient than the previous techniques in terms of energy consumption.