• Journal of KIISE:Databases
• /
• v.29 no.3
• /
• pp.193-206
• /
• 2002

In this paper, we design and implement an efficient bulk-loading algorithm for CIR-Tree. Bulk-loading techniques increase node utilization, improve query performance and reduce index construction time. The CIR-tree has variable size of internal node entries since it only maintains minimal dimensions to decriminate child nodes. This property increases fan-out of internal nodes and improves search performance. Even though several bulk-loading algorithms for multi/high-dimensional index structures have been proposed, we cannot apple them to CIR-tree because of the variable size of internal node entries. In this paper, we propose an efficient bulk- loading algorithm for CIR-tree that improves the existing bulk-loading algorithm and accomodates the property of CIR-tree. We also implement it on a storage system MiDAS-III and show superiority of our algorithm through various experiments.

• Journal of the Korea Society of Computer and Information
• /
• v.13 no.5
• /
• pp.255-261
• /
• 2008

RFID(Radio Frequency IDentification) is a technology that automatically identifies objects containing the electronic tags by using radio frequency. In RFID system, the reader needs the anti collision algorithm for fast identifring all of the tags in the interrogation zone. This Paper proposes the tree based TPAE(Tag Prediction Algorithm using Extra bit) algorithm to arbitrate the tag collision. The proposed algorithm can identify tags without identifring all the bits in the tag ID. The reader uses the extra bit which is added to the tag ID and if there are two collided bits or multiple collided bits, it checks the extra bit and grasps the tag IDs concurrently. In the experiment, the proposed algorithm had about 50% less query iterations than query tree algorithm and binary search algorithm regardless of the number of tags and tag ID lengths.

• Journal of Internet Computing and Services
• /
• v.14 no.5
• /
• pp.1-10
• /
• 2013

RFID(Radio Frequency Identification) system is non-contact identification technology. A basic RFID system consists of a reader, and a set of tags. RFID tags can be divided into active and passive tags. Active tags with power source allows their own operation execution and passive tags are small and low-cost. So passive tags are more suitable for distribution industry than active tags. A reader processes the information receiving from tags. RFID system achieves a fast identification of multiple tags using radio frequency. RFID systems has been applied into a variety of fields such as distribution, logistics, transportation, inventory management, access control, finance and etc. To encourage the introduction of RFID systems, several problems (price, size, power consumption, security) should be resolved. In this paper, we proposed an algorithm to significantly alleviate the collision problem caused by simultaneous responses of multiple tags. In the RFID systems, in anti-collision schemes, there are three methods: probabilistic, deterministic, and hybrid. In this paper, we introduce ALOHA-based protocol as a probabilistic method, and Tree-based protocol as a deterministic one. In Aloha-based protocols, time is divided into multiple slots. Tags randomly select their own IDs and transmit it. But Aloha-based protocol cannot guarantee that all tags are identified because they are probabilistic methods. In contrast, Tree-based protocols guarantee that a reader identifies all tags within the transmission range of the reader. In Tree-based protocols, a reader sends a query, and tags respond it with their own IDs. When a reader sends a query and two or more tags respond, a collision occurs. Then the reader makes and sends a new query. Frequent collisions make the identification performance degrade. Therefore, to identify tags quickly, it is necessary to reduce collisions efficiently. Each RFID tag has an ID of 96bit EPC(Electronic Product Code). The tags in a company or manufacturer have similar tag IDs with the same prefix. Unnecessary collisions occur while identifying multiple tags using Query Tree protocol. It results in growth of query-responses and idle time, which the identification time significantly increases. To solve this problem, Collision Tree protocol and M-ary Query Tree protocol have been proposed. However, in Collision Tree protocol and Query Tree protocol, only one bit is identified during one query-response. And, when similar tag IDs exist, M-ary Query Tree Protocol generates unnecessary query-responses. In this paper, we propose Adaptive M-ary Query Tree protocol that improves the identification performance using m-bit recognition, collision information of tag IDs, and prediction technique. We compare our proposed scheme with other Tree-based protocols under the same conditions. We show that our proposed scheme outperforms others in terms of identification time and identification efficiency.

• Journal of KIISE:Databases
• /
• v.27 no.2
• /
• pp.216-226
• /
• 2000

This paper suggests a new access path, hashed B-tree which is an efficient access method for integrity checking. Hashed B-tree is based on the observation that most query patterns in enforcing integrity constraints are point queries. Hashed B-tree compresses the key by hashing procedure, which reduces the height of tree and results in fast node search. This method has the advantages such as it can be implemented easily and use the B-tree concurrency control and recovery algorithm with minor modifications.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.10
• /
• pp.1887-1894
• /
• 2016

In the RFID system, the reader transmits a query message to tags in order to identify a unique ID of tags within its detection range. The procedures for arbitrating a collision is essential because the multiple tags can response simultaneously in the same to the query of the Reader. This procedure is known as conflict resolution algorithm and it is a key technology in the RFID system. In this paper, we proposed a variable bits M-ary QT algorithm based on Manchester coding techniques. The proposed algorithm use the location information of the collision bits in the reader and tags. The proposed algorithm can reduce the number of the query-response cycle because it is capable of recognizing discontinuous bits and a variable number of bits. From computer simulation, the proposed method give better performance than the conventional M-ary QT techniques in terms of response, recognition efficiency, communication overhead.

• Journal of KIISE:Databases
• /
• v.34 no.5
• /
• pp.465-472
• /
• 2007

With the recent proliferation of the use of semi-structured data such as XML, it becomes more important to efficiently store and manage the semi-structured data. The XML data can be logically modelled as a rooted tree e.g., the DOM tree. In order to process a query on the XML data, we traverse the tree structure. In this paper we present an algorithm that places the XML data to disk blocks. The proposed algorithm assigns a number to each node of the tree in a bottom-up fashion. Then, the nodes are allocated to disk blocks using the assigned number. The proposed algorithm does not need access pattern information, and provides good performance for any access pattern. The characteristics of the proposed method are presented with analysis. Through experiments, we evaluate the performance of the proposed method.

• Journal of KIISE:Databases
• /
• v.36 no.4
• /
• pp.306-313
• /
• 2009

Top-k queries are issued to find out the highest (or lowest) readings in many sensor applications. Many top-k query processing algorithms are proposed to reduce energy consumption; FILA installs a filter at each sensor node and suppress unnecessary sensor updates; PRIM allots priorities to sensor nodes and collects the minimal number of sensor reading according to the priorities. However, if many sensor reading converge into the same range of sensor values, it leads to a problem that many false positives are occurred. In this paper, we propose a cluster-based approach to reduce them effectively. Our proposed algorithm operates in two phases: top-k query processing in the cluster level and top-k query processing in the tree level. False positives are effectively filtered out in each level. Performance evaluations show that our proposed algorithm reduces about 70% false positives and achieves about 105% better performance than the existing top-k algorithms in terms of the network lifetime.

• Spatial Information Research
• /
• v.19 no.1
• /
• pp.117-126
• /
• 2011

Recently, AR applications provide location-based spatial information by GPS. Also, the spatial information is displayed by the angle of the camera. So far, traditional spatial indexes in spatial database field retrieve and filter spatial information by the minimum bounding rectangle (MBR) algorithm.(ex. R-tree) MBR strategy is a useful technique in the geographic information systems and location based services. But MBR technique doesn't reflect the characteristics of spatial queries in AR. Spatial queries of AR applications have high possibility of the dead space area between MBRs of non-leaf node and query area. We propose triangle node filtering algorithm that improved efficiency of spatial retrieval used the triangle node filtering techniques by exclusion the dead space. In this paper, the proposed algorithm has been implemented on PostgreSQL/PostGIS. Experimental results show the spatial retrieval that using the proposed algorithm better performance than the spatial retrieval that of the minimum bounding rectangle algorithm.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.42 no.3 s.303
• /
• pp.73-80
• /
• 2005

Recently there have been many efforts to support searching and browsing based on the visual content of image and multimedia data. Most existing approaches to content-based image retrieval rely on query by example or user based low-level features such as color, shape, texture. But these methods of query are not easy to use and restrict. In this paper we propose a method for automatic color object extraction and labelling to support multiple queries of content-based image retrieval system. These approaches simplify the regions within images using single colorizing algorithm and extract color object using proposed Color and Spatial based Binary tree map(CSB tree map). And by searching over a large of number of processed regions, a index for the database is created by using proposed labelling method. This allows very fast indexing of the image by color contents of the images and spatial attributes. Futhermore, information about the labelled regions, such as the color set, size, and location, enables variable multiple queries that combine both color content and spatial relationships of regions. We proved our proposed system to be high performance through experiment comparable with another algorithm using 'Washington' image database.

• Journal of Digital Contents Society
• /
• v.15 no.3
• /
• pp.347-355
• /
• 2014

The general octree structure is common for various applications including computer graphics, geometry information analysis and query. Unfortunately, the general octree approach causes duplicated sample data and discrepancy between sampling and representation positions when applied to sample continuous spatial information, for example, signed distance fields. To address these issues, some researchers introduced the dual octree. In this paper, the weakness of the dual octree approach will be illustrated by focusing on the fact that the dual octree cannot access some specific continuous zones asymptotically. This paper shows that the primal tree presented by Lefebvre and Hoppe can solve all the problems above. Also, this paper presents a three-dimensional primal tree traversal algorithm based the Morton codes which will help to parallelize the primal tree method.