• Journal of the Korea Computer Industry Society
• /
• v.4 no.4
• /
• pp.443-448
• /
• 2003

Approximate k-nearest neighbor queries are frequently occurred for finding the k nearest neighbors to a given query point in spatial database systems. The number of searched nodes in an index must be minimized in order to increase the performance of approximate k nearest neighbor queries. In this paper. we suggest the technique of approximate k nearest neighbor queries on R-tree family by improving the existing algorithm and evaluate the performance of the proposed method in dynamic spatial database environments. The simulation results show that a proposed method always has a low number of disk access irrespective of object distribution, size of nearest neighbor queries and approximation rates as compared with an existing method.

• Journal of the Korea Society of Computer and Information
• /
• v.11 no.6 s.44
• /
• pp.9-17
• /
• 2006

Moving objects database systems manage a set of moving objects which changes its locations and directions continuously. The traditional spatial indexing scheme is not suitable for the moving objects because it aimed to manage static spatial data. Because the location of moving object changes continuously, there is problem that expense that the existent spatial index structure reconstructs index dynamically is overladen. In this paper, we analyzed the insertion/deletion costs for processing the movement of objects. The results of our extensive experiments show that the Dynamic Hashing Index outperforms the original R-tree and the fixed grid typically by a big margin.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.5B
• /
• pp.286-294
• /
• 2007

In ASIP design, compiler is required for performance evaluation of processors being designed. The design of machine specific compiler is time consuming. This paper presents the system which generates C compiler from MDL descriptions. Compiler generation using MDL can support user retargetability and concurrency between compiler design and processor design. However, it must overcome semantics gap between compiler and machine. To handle this problem, the proposed system maps behavioral descriptions to library which contains abstract behavior for each tree pattern. Using mapped instructions and information on register file usage, the proposed system generates back-end interface function of the compiler. Generated compilers, for MIPS R3000, ARM9 cores, have been proved by application programs written in C code.

• Korean Journal of Crystallography
• /
• v.1 no.2
• /
• pp.84-90
• /
• 1990

1,3-Diazatricyclo (5.2.1.Os .to) decane-2,11-dione , C8H10N2O2. MW=166.15, Monoclinic, P2/n a= 6.585(7) , b=9.089(4), c=12.937(10)A, β=95.72(5)˚, V=770.4A3, Z=4, Dc=1.43(4) g/cm3, λ (Mo Ka)=0.7093A, r=1.Ocm-1, T=295˚K, final R=0.037 for 698 unique observed reflections. The compound is the product of the intramolecular (2+2) photocycloaddition of Nl-(w-butenyl)uracil and belongs to a (5.2.1.O5.10) tricyclic system. A pair of molecules related by the inversion symmetry are held together by the strong hydrogen bonding interactions between 02 and H3 of the uracil moiety.

• Journal of KIISE:Databases
• /
• v.30 no.5
• /
• pp.429-437
• /
• 2003

Over the last decades, improvements in CPU speed have greatly exceeded those in memory and disk speeds by orders of magnitude and this enabled the use of compression techniques to reduce the database size as well as the query cost. Although compression techniques are employed in various database researches, there is little work on compressing multi-dimensional index structures. In this paper, we propose an efficient compression method called the hybrid encoding method (HEM) that is tailored to multi-dimensional indexing structures. The HEM compression significantly reduces the query cost and the size of multi-dimensional index structures. Through mathematical analyses and extensive experiments, we show that the HEM compression outperforms an existing method in terms of the index size and the query cost.

• KIPS Transactions on Software and Data Engineering
• /
• v.5 no.11
• /
• pp.569-584
• /
• 2016

In this paper, we present a spatial knowledge extractor implemented in Hadoop MapReduce parallel, distributed computing environment. From a large spatial dataset, this knowledge extractor automatically derives a qualitative spatial knowledge base, which consists of both topological and directional relations on pairs of two spatial objects. By using R-tree index and range queries over a distributed spatial data file on HDFS, the MapReduce-enabled spatial knowledge extractor, MRSPAKE, can produce a web-scale spatial knowledge base in highly efficient way. In experiments with the well-known open spatial dataset, Open Street Map (OSM), the proposed web-scale spatial knowledge extractor, MRSPAKE, showed high performance and scalability.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.3
• /
• pp.523-531
• /
• 2007

In this paper, we are going to develop a newly designed indexing scheme which is compatible to manage the moving objects and propose a cost model of the scheme. We propose a dynamic hashing index that insertion/delete costs are low. The dynamic hashing structure is that apply dynamic hashing techniques to combine a hash and a tree to a spatial index. We analyzed the dynamic index structure and the cost model by the frequent position update of moving objects and verified through a performance assessment experiment. The results of our extensive experiments show that the newly proposed indexing schemes(Dynamic Hashing Index) are much more efficient than the traditional the fixed grid and R-tree.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.2
• /
• pp.69-77
• /
• 2009

Stream service environment demands real-time query processing for voluminous data which are ceaselessly delivered from tremendous sources. Typical R-tree based query processing technologies cannot efficiently handle such situations, which require repetitive and inefficient exploration from the tree root on every data event. However, many stream data including sensor readings show high locality, which we exploit to reduce the search space of queries to explore. In this paper, we propose a query processing scheme exploiting the locality of stream data. From the simulation, we conclude that the proposed scheme performs much better than the traditional ones in terms of scalability and exploration efficiency.

• Korean journal of applied entomology
• /
• v.37 no.1
• /
• pp.23-30
• /
• 1998

Restriction fragment length polymorphism (RFLP) of a DNA has been a useful tool for analyzing genetic variation. This research was performed to establish an RFLP analytic method on the mitochondrial DNA (mtDNA) of the beet armyworm, Spodoptera exigua (Hiibner). To do this, total size of the mtDNA was measured and polymerase chain reaction (PCR) primers were selected. Its mitochondrial genome size was ca. 16kb. From a serial PCR test of 29 primers refered to the compilation of Simon et al. (1994), 22 primers were selected to amplify its mtDNA fragments. These primers resulted in short (300-700 bp) or long (1000-2000 bp) DNA products which represented a total or partial sequence of each of CO-I, CO-11, Cyt-B, ND-1, 12s rRNA, 16s rRNA, and some tRNAs. PCR-RFLP was performed in some variable mtDNA regions with 8 kinds of 4bp recognizing restriction enzymes. Different populations from Andong, Kyungsan, and Sunchun did not show any restriction site polymorphisms but had some length variation in certain regions of mtDNA.

• Journal of KIISE:Databases
• /
• v.36 no.1
• /
• pp.44-49
• /
• 2009

In recent years, with the development of portable terminals, various searching services on large data have been provided in portable terminals. In order to search large data, most applications for information retrieval use indexes such as B-trees or R-trees. However, only a small portion of the data set is accessed by users, and the access frequencies of each data are not uniform. The existing indexes such as B-trees or R-trees do not consider the properties of the skewed access patterns. And a cache stores the frequently accessed data for fast access in memory. But the size of memory used in the cache is restricted. In this paper, we propose a new index based on disk, called J-tree, which considers user's search patterns. The proposed index is a balanced tree which guarantees uniform searching time on all data. It also supports fast searching time on the frequently accessed data. Our experiments show the effectiveness of our proposed index under various settings.