• Journal of Korea Multimedia Society
• /
• v.6 no.2
• /
• pp.194-207
• /
• 2003

This paper presents an optimal design methodology for the multidimensional nested attribute index (MD-NAI) that uses a multidimensional index structure for indexing the nested attributes in object databases. The MD-NAI efficiently supports complex queries involving both nested attributes and class hierarchies, which are not supported by the nested attribute index using one-dimensional index structure such as $B^+$-tree. However, the performance of the MD-NAI is very degraded in some cases of user's query types. In this paper, for the performance enhancement of the MD-NAI, we first determine the optimal shape of index page region by using the query information about the nested predicates, and then construct an optimal MD NAI by applying a region splitting strategy that makes the shape of the page regions of the MD-NAI as close as possible to the predetermined optimal one. For performance evaluation, we perform extensive experiments with the MD-NAI using various types of nested predicates and object distribution. The results indicate that our proposed method builds optimal MD-NAI regardless of the query types and object distributions. When the interval ratio of a three-dimensional query region is 1:16:236, the performance of the proposed method is enhanced by as much as 5.5 times over that of the conventional method employing the cyclic splitting strategy.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.1
• /
• pp.217-228
• /
• 2009

Data analysis applications typically aggregate data across many dimensions looking for unusual patterns in data. Even though such applications are usually possible with standard structured query language (SQL) queries, the queries may become very complex. A complex query may result in many scans of the base table, leading to poor performance. Because online analytical processing (OLAP) queries are usually complex, it is desired to define a new operator for aggregation, called the data cube or simply cube. Data cube supports OLAP tasks like aggregation and sub-totals. Many aggregate functions can be used to construct a data cube. Those functions can be classified into three categories, the distributive, the algebraic, and the holistic. It has been thought that the distributive functions such as SUM, COUNT, MAX, and MIN can be used to construct a data cube, and also the algebraic function such as AVG can be used if the function is replaced to an intermediate function. It is believed that even though AVG is not distributive, but the intermediate function (SUM, COUNT) is distributive, and AVG can certainly be computed from (SUM, COUNT). In this paper, however, it is found that the intermediate function (SUM COUNT) cannot be applied to OLAP cubes, and consequently the function leads to erroneous conclusions and decisions. The objective of this study is to identify some problems in applying aggregate function AVG to OLAP cubes, and to design a process for solving these problems.

• Journal of Korean Society for Geospatial Information Science
• /
• v.3 no.1 s.5
• /
• pp.45-54
• /
• 1995

The relational data model is based on mathematical concept of relations and is well formulated, and so there have been numerous practical applications and studies. However, it is not suitable for representing a complex hierarchical structure, which is the characteristic of most geographical objects. On the other hand, the object-oriented data model can naturally represent a complex hierarchical structure, but there is a difficulty in sharing data with the relational data model which is currently used by most commercial GIS users. Also it has no standard query language with standardized format. In this paper, we propose an Object Grouping based on RDBMS to use data from a traditional relational data model while supporting various concepts of the object-oriented data model, and we applied this data model to design a GIS.

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.1
• /
• pp.137-147
• /
• 2013

The RFID(Radio Frequency Identification) and the WSN(Wireless Sensor Network) have technical similarities and mutual effects, they have been recognized to be studied separately, and sufficient studies have not been conducted on the technical integration of the RFID and the WSN. Therefore, EPC global which realized the issue proposed the EPC(Electronic Produce Code) Sensor Network to efficiently integrate and interoperate the RFID and WSN technologies based on the international standard EPC global network. The proposed EPC Sensor Network technology uses the Complex Event Processing method in the middleware to integrate data occurring through the RFID and the WSN in a single environment and to interoperate the events based on the EPC global network. However, as the EPC Sensor Network technology continuously performs its operation even in the case that the minimum conditions are not to be met to find complex events in the middleware, its operation cost rises. Therefore, to address the problems of the existing system, we defined the minimum conditions of the complex events to detect unnecessary complex events in the middleware, and proposed an algorithm that can extract complex events only when the minimum conditions are to be met. To examine the minimum conditions, a index and a query index are used to extract complex events. To evaluate the performance of the proposed methods, In the case of the method of extracting complex events based on a bitmap index, we used the existing extraction method and NS2 simulation to evaluate its performance and thus to show its good performance in terms of the number of operation and the processing time for the complex events.

• Journal of Information Processing Systems
• /
• v.12 no.1
• /
• pp.83-99
• /
• 2016

The latest research on the image-based fingerprint matching approaches indicates that they are less complex than the minutiae-based approaches when it comes to dealing with low quality images. Most of the approaches in the literature are not robust to fingerprint rotation and translation. In this paper, we develop a robust fingerprint matching system by extracting the circular region of interest (ROI) of a radius of 50 pixels centered at the core point. Maximizing their orientation correlation aligns two fingerprints that are to be matched. The modified Euclidean distance computed between the extracted orientation features of the sample and query images is used for matching. Extensive experiments were conducted over four benchmark fingerprint datasets of FVC2002 and two other proprietary databases of RFVC 2002 and the AITDB. The experimental results show the superiority of our proposed method over the well-known image-based approaches in the literature.

• Proceedings of the Korean Society for Bioinformatics Conference
• /
• 2005.09a
• /
• pp.383-387
• /
• 2005

One of the most important issues in post-genome era is identifying functions of genes and understanding the interaction among them. Such interactions from complex biochemical pathways, which are very useful to understand the organism system. We present an integrated biochemical pathway database system with a set of software tools for reconstruction, visualization, and simulation of the pathways from the database. The novel features of the presented system include: (a) automatic integration of the heterogeneous biochemical pathway databases, (b) gene ontology for high quality of database in the integration and query (c) various biochemical simulations on the pathway database, (d) dynamic pathway reconstruction for the gene list or sequence data, (e) graphical tools which enable users to view the reconstructed pathways in a dynamic form, (f) importing/exporting SBML documents, a data exchange standard for systems biology.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2007.05a
• /
• pp.123-137
• /
• 2007

The information space of semantic web comprised of various resources, properties, and relationships is more complex than that of WWW comprised of just documents and hyperlinks. Therefore, ranking methods in the semantic web should be modified to reflect the complexity of the information space. In this paper we propose a method of ranking query results from RDF(Resource Description Framework) knowledge bases. The ranking criterion is the importance of a resource computed based on the link structure of the RDF graph. Our method is expected to solve a few problems in the prior research including the Tightly-Knit Community Effect. We illustrate our methods using examples and discuss directions for future research.

• Proceedings of the KSRS Conference
• /
• 2004.10a
• /
• pp.272-275
• /
• 2004

Recently, the services using position information of moving objects is embossed. Theses services needs the moving objects databases to manage moving object data with efficiency. To build the moving object databases, we must develop the moving object engine to mange, store, and search the spatio temporal data of moving object. The moving object engine has to support query syntax to search data that suitable for user need like LBS, Telematics, ITS, vehicle management system. In this paper, we design and implement the moving object engine to support service with moving object data. The moving object engine is able to support system environment that users are able to get the moving object data easily even they don't know complex data structure.

• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.2402-2406
• /
• 2005

A collision query determines the intersection between given objects, and is used in computer-aided design and manufacturing, animation and simulation systems, and physically-based modeling. Bounding volume hierarchies are one of the simplest and most widely used data structures for performing collision detection on complex models. In this paper, we present hierarchy of oriented rounded bounding volume for fast proximity queries. Designing hierarchies of new bounding volumes, we use to combine multiple bounding volume types in a single hierarchy. The new bounding volume corresponds to geometric shape composed of a core primitive shape grown outward by some offset such as the Minkowski sum of rectangular box and a sphere shape. In the experiment of parallel close proximity, a number of benchmarks to measure the performance of the new bounding box and compare to that of other bounding volumes.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1996.10a
• /
• pp.93-95
• /
• 1996

A replication server is considered to be one of the most effective tools to cope with the problems that may be caused by the complex data replications in distributed database systems. In the distributed environment, locking a table is inevitable and it is the main reason to coerce the system practically. This paper presents an Asynchronous Replicator Scheme (ARS) that basically utilizes the system log as files named differential files to refresh the distributed data files with complicated queries, and that it prevents (normally, huge) base tables from being locked. We take join operations as the complicated queries, not only because the join operation covers almost all the operations, but also because it is one of the most time-consuming and data intensive operations in query processings.