• The KIPS Transactions:PartC
• /
• v.18C no.6
• /
• pp.441-444
• /
• 2011

In this study, we present a method for efficiently aggregating network state information. It is especially useful for aggregating links that have both delay and bandwidth in an asymmetric network. Proposed method reduces the information distortion of logical link by integration process after similar measure and grouping of logical links in multi-level topology transformation to reduce the space complexity. It is applied to transform the full mesh topology whose Service Boundary Line (SBL) serves as its logical link into a spanning tree topology. Simulation results show that aggregated information accuracy and query response accuracy are higher than that of other known method.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.5
• /
• pp.1653-1670
• /
• 2022

The fear that location privacy may be compromised greatly hinders the development of location-based service. Accordingly, some schemes based on the distributed architecture in peer-to-peer network for location privacy protection are proposed. Most of them assume that mobile terminals are mutually trusted, but this does not conform to realistic scenes, and they cannot make requirements for the level of location privacy protection. Therefore, this paper proposes a scheme for location attribute-based security authentication and private sharing data group, so that they trust each other in peer-to-peer network and the trusted but curious mobile terminal cannot access the initiator's query request. A new identifier is designed to allow mobile terminals to customize the protection strength. In addition, the caching mechanism is introduced considering the cache capacity, and a cache replacement policy based on deep reinforcement learning is proposed to reduce communications with location-based service server for achieving location privacy protection. Experiments show the effectiveness and efficiency of the proposed scheme.

• The KIPS Transactions:PartD
• /
• v.10D no.3
• /
• pp.459-470
• /
• 2003

It is required to research on high-dimensional index structures for efficiently retrieving high-dimensional data because an attribute vector in data warehousing and a feature vector in multimedia database have a characteristic of high-dimensional data. For this, many high-dimensional index structures have been proposed, but they have so called ‘dimensional curse’ problem that retrieval performance is extremely decreased as the dimensionality is increased. To solve the problem, the cell-based filtering (CBF) scheme has been proposed. But the CBF scheme show a linear decreasing on performance as the dimensionality. To cope with the problem, it is necessary to make use of parallel processing techniques. In this paper, we propose a parallel CBF scheme which uses a horizontally-partitioned technique as declustering. In order to maximize the retrieval performance of the proposed parallel CBF scheme, we construct our parallel CBF scheme under a SN (Shared Nothing) cluster architecture. In addition, we present a data insertion algorithm, a rage query processing one, and a k-NN query processing one which are suitable for the SN cluster architecture. Finally, we show that our parallel CBF scheme achieves better retrieval performance in proportion to the number of servers in the SN cluster architecture, compared with the conventional CBF scheme.

• Journal of KIISE:Databases
• /
• v.34 no.1
• /
• pp.18-34
• /
• 2007

In order to provide various business analysis methods, OLAP(On-Line Analytical Processing) systems represent their data with multidimensional structures. These multidimensional data are often delivered to users in the horizontal format of tables whose columns are corresponding to values of dimension attributes. Since the horizontal tables nay have a large number of columns, they cannot be stored directly in relational database systems. Furthermore, the tables are likely to have many null values (i.e., sparse tables). In order to manage the horizontal tables efficiently, we can store them as the vertical format of tables which has dimension attribute names as their columns thus transforms the columns of horizontal tables into rows. In this way, every queries for horizontal tables have to be transformed into those for vertical tables. This paper proposed a technique for transforming horizontal table queries into vertical table ones by utilizing not only traditional relational algebraic operators but also the PIVOT operator which recent DBMS versions are providing. For achieving this goal, we designed a relational algebraic expression equivalent to the PIVOT operator and we formally proved their equivalence. Then, we developed a transformation technique for horizontal table queries using the PIVOT operator. We also performed experiments to analyze the performance of the proposed method. From the experimental results, we revealed that the proposed method has better performance than existing methods.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.16 no.2
• /
• pp.101-113
• /
• 2013

The concern on environmental quality makes the landscape analysis more important than before ever. For the landscape analysis, selection of viewpoint is one of most important stage. Because of its subjectiveness, the conventional viewpoint selection method often missed some viewpoints of importance. The purpose of this study is to develop a viewpoint selection method for landscape analysis using GIS data and techniques. During the viewpoint selection process, spatial and attribute data from several GIS systems were hired. Query and overlay methods were mainly adapted for analysis to find out meaningful viewpoints. The 3D simulation analysis on DEM(Digital Elevation Model) was used for every selected viewpoint to examine wether the view target is screened out or not. Application study at a sample site showed some omissions of good viewpoints without any screening. It also exhibited the possibility to reduce time and cost for the viewpoint selection process of landscape analysis. For the progress of applicability, GIS data analysis process have to be improved and more modules such as automatic screening analysis system on selected viewpoint have to be developed.

• Journal of Korea Multimedia Society
• /
• v.10 no.2
• /
• pp.269-277
• /
• 2007

Network clustering has been proposed to provide that sensor nodes minimize energy and maximize a network lifetime by configuring clusters, Although dynamic clustering brings extra overhead like as head changing, head advertisement, it may diminish the gain in energy consumption to report attribute tasks by using cluster heads. Therefore, this paper proposes a new routing algorithm which configures cluster to reduce the number of messages when establishing paths and reports to the sink by way of cluster heads when responding sens ing tasks. All sensor nodes only broadcast bitmap once and maintain a bitmap table expressed by bits, allowing them to reduce node energy and to prolong the network lifetime. After broadcasting, each node only updates the bitmap without propagation when the adjacent nodes broad cast same query messages, This mechanism makes nodes to have abundant paths. By modifying the query which requests sensing tasks, the size of cluster is designed dynamically, We try to divide cluster by considering the number of nodes. Then, all nodes in a certain cluster must report to the sub- sink node, The proposed routing protocol finds easily an appropriate path to report tasks and reduces the number of required messages for the routing establishment, which sensor nodes minimize energy and maximize a network lifetime.

• Journal of Korea Multimedia Society
• /
• v.10 no.7
• /
• pp.807-816
• /
• 2007

Since W3C proposed XML in 1996, XML documents have been widely spreaded in many internet documents. Because of this, needs for research related with XML is increasing. Especially, it is being well performed to study XML management system for storage, retrieval, and management with XML Documents. Among these studies, XRel is a representative study for XML management and has been become a comparative study. In this study, we suggest XML documents management system based on Relational DataBase Management System. This system is stored not all possible path expressions such as XRel, but filtered path expression which has text value or attribute value. And by giving each node Node Expression Identifier, we try to match given Node Expression Identifier. Finally, to prove efficiency of the suggested technique, this paper shows the result of experiment that compares XPath query processing performance between suggested study and existing technique, XRel.

• Journal of KIISE:Databases
• /
• v.32 no.3
• /
• pp.285-296
• /
• 2005

In mobile distributed systems the data on the air can be accessed by a lot of mobile clients. And, we need an indexing scheme in order to energy-efficiently access the data on the wireless broadcast stream. In conventional indexing schemes, they use the values of primary key attributes and construct tree-structured index. Therefore, the conventional indexing schemes do not support content-based retrieval queries such as partial-match queries. In this paper we propose an indexing scheme, called B2V-Tree, which supports partial match queries on wireless broadcast data stream. For this purpose, we construct a tree-structured index which is composed of bit-vectors, where the bit-vectors are generated from data records through multi-attribute hashing.

• Journal of KIISE:Databases
• /
• v.27 no.1
• /
• pp.101-112
• /
• 2000

In Geographic Information System, spatial object can be changed in the attribute information, spatial location and the topological relation between them with the change of time. However traditional GIS deletes the old value of aspatial information and replaces them with new value. Therefore. it is difficult to manage thc history of changed spatial object and can not support the spatio-temporal queries including temporal queries. In this paper, we propose a spatio-temporal objected model to solve this problem. We implement the proposed model with spatio-temporal class using Gothic GIS tool. The historical information of an object is stored into the object itself for the effective history management. And, in order to provide the queries for the history of an object and spatio-temporal relationship, we add temporal operators, spatio-temporal operators, and spatio-temporal query operations into Gothic, and improve the facility of the Gothic.

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

In order to acquire the precise and fast response for an analytical query, proper selection of the views to materialize in data warehouse is very crucial. In traditional algorithms, the whole relation is considered to be selected as materialized views. However, materializing the whole relation rather than a part of relation results in much worse performance in terms of time and space cost. Therefore, we present a new algorithm for selection of views to materialize using clustering method in order to improve the performance of data warehouse including this problem. In the presented algorithm, ASVMR(Algorithm for Selection of Views to Materialize using Reduced table), we first generate reduced tables in data warehouse using automatic clustering based on attribute-values density, then we consider the combination of reduced tables as materialized views instead of the combination of the original base relations. We also show the experimental results in which both time and space cost are approximately 1.8 times better than the conventional algorithms.