• Journal of Intelligence and Information Systems
• /
• v.14 no.4
• /
• pp.19-30
• /
• 2008

Semantic heterogeneity should be overcome to support automated information sharing process between information systems in ontology-based distributed environments. To do so, traditional approaches have been based on explicit mapping between ontologies from human experts of the domain. However, the manual tasks are very expensive, so that it is difficult to obtain ontology mappings between all possible pairs of information systems. Thereby, in this paper, we propose a system to make the existing mapping information sharable and exchangeable. It means that the proposed system can collect the existing mapping information and aggregate them. Consequently, we can estimate the ontology mappings in an indirect manner. In particular, this paper focuses on query propagation on the distributed networks. Once we have the indirect mapping between systems, the queries can be efficiently transformed to automatically exchange knowledge between heterogeneous information systems.

• KIISE Transactions on Computing Practices
• /
• v.21 no.8
• /
• pp.537-542
• /
• 2015

Database Shard is a technique that can be queried and stored by dividing one logical table into multiple databases horizontally. In order to analyze the shard data with aggregate or analysis functions, a process is required that integrates partial results on each shard database. In this paper, we introduce the design and implementation of a distributed processing system for aggregation and analysis on the CUBRID Shard distributed database, which is an open source database management system. The implemented system can accelerate the analysis onto multiple shards of partitioned tables; it shows efficient aggregation on shard distributed databases compared to stand-alone databases.

• Journal of the Institute of Convergence Signal Processing
• /
• v.10 no.3
• /
• pp.176-180
• /
• 2009

This paper investigates protocol architecture for a web-sensor gateway interconnecting internet and wireless sensor network, in which Zigbee sensors are connected over the IEEE802.15.4 communication protocol standard. The web-sensor gateway is to deliver data between TCP/IP and Zigbee/IEEE802.15.4 protocols, transparently. Since the gateway provides a means to remotely control and aggregate sensor data over the internet, it needs to be designed in the view point of users and in their convenience. In accordance, the common gateway interface technology satisfying users on the web browser to efficiently manage and query the sensors in the wireless sensor networks, ubiquitously, is also introduced. Finally, a simulation prototype for the web-sensor gateway is proposed and verified using OPNET simulation tool.

• Journal of KIISE
• /
• v.44 no.9
• /
• pp.966-975
• /
• 2017

In Internet of Things (IoT), the aim of the nodes (called 'Things') is to exchange information with each other, whereby they gather and share information with each other through self decision-making. Therefore, we cannot apply existing aggregation algorithms of Wireless sensor networks that aim to transmit information to only a sink node or a central server, directly to the IoT environment. In addition, since existing algorithms aggregate information from all sensor nodes, problems can arise including an increasing number of transmissions and increasing transmission delay and energy consumption. In this paper, we propose the clustering and property based data exchange method for energy efficient information sharing. First, the proposed method assigns the properties of each node, including the sensing data and unique resource. The property determines whether the node can respond to the query requested from the other node. Second, a cluster network is constructed considering the location and energy consumption. Finally, the nodes communicate with each other efficiently using the properties. For the performance evaluation, TOSSIM was used to measure the network lifetime and average energy consumption.

• Journal of Korea Spatial Information System Society
• /
• v.11 no.2
• /
• pp.99-110
• /
• 2009

Currently, there are many applications being developed based on sensor network technology. A tracking method for moving objects in sensor network is one of the main issue of this field. There is a little research on this issue, but most of the existing work has two problems. The first problem is a communication overhead for visiting sensor nodes many times to track a moving object. The second problem is an disability for dealing with many moving objects at a time. To resolve the problems, we, in this paper, propose a signature-based tracking method using efficient data aggregation for moving objects, called SigMO-TRK. For this, we first design a local routing hierarchy tree to aggregate moving objects' trajectories efficiently by using a space filtering technique. Secondly, we do the tracking of all trajectories of moving objects by using signature in a efficient way, our approach generates signatures to method. In addition, by extending the SigMO-TRK, we can retrieve the similar trajectories of moving objects for given a query. Finally, by using the TOSSIM simulator, we show that our signature-based tracking method outperforms the existing tracking method in terms of energy efficiency.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.6
• /
• pp.732-736
• /
• 2010

Processing a large amount of data becomes more important than ever. Particularly, the information queries which require multi-dimensional record scan can be efficiently implemented with SIMD instruction sets. In this article, we present a SIMD record scan technique which employs row-based scanning. Our technique is different from existing SIMD techniques for predicate processes and aggregate operations. Those techniques apply SIMD instructions to the attributes in the same column of the database, exploiting the column-based record organization of the in-memory database systems. Whereas, our SIMD technique is useful for multi-dimensional record scanning. As the sizes of registers and the memory become larger, our row-based SIMD scan can have bigger impact on the performance. Moreover, since our technique is orthogonal to the parallelization techniques for multi-core processors, it can be applied to both uni-processors and multi-core processors without too many changes in the software architectures.

• Journal of Internet Computing and Services
• /
• v.6 no.2
• /
• pp.99-115
• /
• 2005

Extensible Markup Language (XML) is an Internet standard that is used to express and convert data, In order to find the necessary information out of XML documents, you need a search system for XML documents, In this research, we have developed a search system that can find documents that matches the structure and content of a given XML document, making the best use of XML structure, Search metrics take account of the similarity in tag names, tag values, and the structure of tags, After a search, the system displays the ranked results in the order of aggregate similarity, Three methods of query are provided: keyword search which is conventional; search with tag names and their values; and search with XML documents, These three methods enable users to choose the method that best suits their preference, resulting in the increase of the usefulness of the system.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.39 no.1
• /
• pp.29-48
• /
• 2014

The recent keyword advertising does not reflect the individual customer searching pattern because it is focused on each keyword at the aggregate level. The purpose of this research is to observe processes of customer searching patterns. To be specific, individual deal-proneness is mainly concerned. This study incorporates location as a control variable. This paper examines the relationship between customers' searching patterns and probability of purchase. A customer searching session, which is the collection of sequence of keyword queries, is utilized as the unit of analysis. The degree of deal-proneness is measured using customer behavior which is revealed by customer searching keywords in the session. Deal-proneness measuring function calculates the discount of deal prone keyword leverage in accordance with customer searching order. Location searching specificity function is also calculated by the same logic. The analyzed data is narrowed down to the customer query session which has more than two keyword queries. The number of the data is 218,305 by session, which is derived from Internet advertising agency's (COMAS) advertisement managing data and the travel business advertisement revenue data from advertiser's. As a research result, there are three types of the deal-prone customer. At first, there is an unconditional active deal-proneness customer. It is the customer who has lower deal-proneness which means that he/she utilizes deal-prone keywords in the last phase. He/she starts searching a keyword like general ones and then finally purchased appropriate products by utilizing deal-prone keywords in the last time. Those two types of customers have the similar rates of purchase. However, the last type of the customer has middle deal-proneness; who utilizes deal-prone keywords in the middle of the process. This type of a customer closely gets into the information by employing deal-prone keywords but he/she could not find out appropriate alternative then would modify other keywords to look for other alternatives. That is the reason why the purchase probability in this case would be decreased Also, this research confirmed that there is a loyalty effect using location searching specificity. The customer who has higher trip loyalty for specificity location responds to selected promotion rather than general promotion. So, this customer has a lower probability to purchase.

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

u-GIS DSMSs have been researched to deal with various sensor data from GeoSensors in ubiquitous environment. Also, they has been more important for high availability. The data from GeoSensors have some characteristics that increase explosively. This characteristic could lead memory overflow and data loss. To solve the problem, various load shedding methods have been researched. Traditional methods drop the overloaded tuples according to a particular criteria in a single server. Tuple deletion sensitive queries such as aggregation is hard to satisfy accuracy. In this paper a dual processing load shedding method is suggested to improve the accuracy of aggregation in clustering environment. In this method two nodes use replicated stream data for high availability. They process a stream in two nodes by using a characteristic they share stream data. Stream data are synchronized between them with a window as a unit. Then, processed results are merged. We gain improved query accuracy without data loss.