• The Transactions of the Korea Information Processing Society
• /
• v.7 no.2S
• /
• pp.711-720
• /
• 2000

BADA-IV/XML is a system designed specifically for managing XML. Documents and is essential to various electronic document applications as a fundamental system. BADA-IV/XML supports all of aspects of data model, querying and manipulation operations for managing XML documents. This paper provides an overview of these aspects of the BADA-IV/XML, as well as defines schema classes for stroing, querying and maintaining hierarchical semantics of multimedia documents and structural semantics of complex documents linked with each other, Also a multimedia document query language is designed and implemented to support essential operations for efficient searching and managing multimedia documents. Finally, some simulation results show the performance of the paged VF(Virtual Fragmentation) model and the search model using element's identifier as compared with a general model.

• Journal of the Korea Computer Industry Society
• /
• v.10 no.1
• /
• pp.1-12
• /
• 2009

In this thesis, founded on those considerings, plan the formula of media data for the information of drawing for the production of steel plate by establishing the concept of relational data model, plan the surroundings for query for the interface of user, and introduce the process materialized actually in detail as use the management system of drawing.

• International conference on construction engineering and project management
• /
• 2015.10a
• /
• pp.232-235
• /
• 2015

Defect data contains experiential knowledge about specific work conditions. And the number of projects performed by a company is too limited for an individual to experience the various defects under the current complex construction environment. Therefore, in order to manage and prevent a reoccurrence of defects, a proper data feedback mechanism is required. However, most defect data are stored in unstructured ways, resulting in the fundamental problem of data utilization. In this paper, a new framework is proposed by using linked data technologies to improve defect data utilization. The target of this framework is to convert defect data to the ontology-based linked data format for sharing defect data from different data sources. To demonstrate it, some technical solutions are implemented by using real cases. The proposed approach can reduce data search time and improve the accuracy of search results as well. Moreover, the proposed approach can be applied to other domains that need to refer to external sources such as safety, specification, product, and regulation.

• Journal of Korea Multimedia Society
• /
• v.9 no.8
• /
• pp.939-949
• /
• 2006

With the development of industry, product data management system is becoming more and more important. An expanded view of product definition function that include a bill of material and routing database, current and historical engineering data and specifications and engineering changes order history. PDM (Product Data Management) systems hold and manage such material as product specifications, plans, geometric models, CAD drawings and images. Furthermore, PDM enables companies producing complex products to spread product data in to the entire launch process. Especially, PDTnet XML Schema is an international standard for exchanging of PDM data. But PDTnet XML Schema differs from existing XML Schema in the way that its property of IDREF/IDREFS is irregular. Therefore it is important factor that. what do we use storage devices and storage techniques. We developed storage techniques and application supporting various query types and preserving PDTnet XML Schema using a relational database that guaranteeing the performance nowadays. In this paper, we will show that our storage techniques minimize repeated data and optimize query processing by using application comparison with storage techniques of existing XML Schema data.

• Journal of KIISE:Databases
• /
• v.27 no.2
• /
• pp.227-237
• /
• 2000

A Web database System is a large-scaled multimedia application system that has multimedia processing facilities and cooperates with relational/Object-Oriented DBMS. Conventional hypertext modeling methods and DB gateway have limitations for Web database because of their restricted versatile presentation abilities and inefficient concurrency control caused by bottleneck in cooperation processing. Thus, we suggest a Dynamic Navigation Model & Virtual Graph Structure. The Dynamic Navigation Model supports implicit query processing and dynamic creation of navigation spaces, and introduce node-link creation rule considering navigation styles. We propose a mapping methodology between the suggested hypertext model and the relational data model, and suggest a dynamic allocation scheduling technique for query processing server based on weighted value. We show that the proposed technique enhances the retrieval performance of Web database systems in processing complex queries concurrently.

• Journal of Korea Multimedia Society
• /
• v.7 no.7
• /
• pp.859-876
• /
• 2004

This paper presents optimal configurations of multidimensional path indexes (MPIs) for the efficient execution of object-oriented queries in object databases. MPI uses a multidimensional index structure for efficiently supporting nested predicates that involve both nested attribute and class hierarchies, which are not supported by the nested attribute index using one-dimensional index structure such as $B^+$-tree. In this paper, we have analyzed the MPIs in the framework of complex queries, containing conjunctions of nested predicates, each one involving a path expression having target classes and domain classes substitution. First of all, we have considered MPI operations caused by updating of object databases, and the use of the MPI in the case of a query containing a single nested predicate. And then, we have considered the use of the MPIs in the framework of more general queries containing nested predicates over both overlapping and non-overlapping paths. The former are paths having common subpaths, while the latter have no common subpaths.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.8
• /
• pp.2008-2019
• /
• 1999

As computing technologies are rapidly progressed and widely used, the needs of high quality information have been increased. To satisfy these needs, it is essential to develop a system which can provide an efficient storing, managing and retrieving mechanism of complex multimedia data, esp. video data. In this paper, we propose a metadata model which can support content-based retrieval of video data. And we design and implement an integrated user interface for querying and browser for content-based retrieval in video database which can efficiently access and browse the video clip that user want to see. Proposed query processor and browser can support various user queries by integrating image feature, spatial temporal feature and annotation. Our system supports structure browsing of retrieved result, so users can more exactly and efficiently access relevant video clip. Without browsing the whole video clip, users can know the contents of video by seeing the storyboard. This storyboard facility makes users know more quickly the content of video clip.

• Journal of Internet Computing and Services
• /
• v.10 no.4
• /
• pp.1-11
• /
• 2009

Recently there has arisen concern in both the database community and the graphics society about data retrieval from large motion databases because the high dimensionality of motion data implies high costs. In this circumstance, finding an effective distance measure and an efficient query processing method for such data is a challenging problem. This paper presents an elaborate motion query processing system, SMoFinder (Similar Motion Finder), which incorporates a novel kinematic distance measure and an efficient indexing strategy via adaptive frame segmentation. To this end, we regard human motions as multi-linkage kinematics and propose the weighted Minkowski distance metric. For efficient indexing, we devise a new adaptive segmentation method that chooses representative frames among similar frames and stores chosen frames instead of all frames. For efficient search, we propose a new search method that processes k-nearest neighbors queries over only representative frames. Our experimental results show that the size of motion databases is reduced greatly (${\times}1/25$) but the search capability of SMoFinder is equal to or superior to that of other systems.

• Journal of Digital Convergence
• /
• v.14 no.2
• /
• pp.209-216
• /
• 2016

In these days, considering the trend to make various information blended based on spatial information like road, buildings and geography, it is to be very important to visualize maps for showing the information efficiently. However, geometry which is composed with line, polygon commonly used on web service has limitation to express information by limit of usage as well as spending certain time to show the information via map. That's why this study develops the efficient way to visualize huge and complex spatial information. This way is to bring partial space with spatial query, and then query and expand information excluded the former area after detecting movement event based on client. When the way is implemented, it will be expected to make efficient visualization in entire system by not bringing unnecessary information but shortening spending time to show area because it just shows areas which clients want to see.

• The KIPS Transactions:PartD
• /
• v.8D no.6
• /
• pp.799-812
• /
• 2001

As XML become more popular for encoding data and exchanging format on the web, recent work on processing XML Document in DBMS has been performed. However, there is no formal data model for XML, and there is lack of research on XML algebra for processing complex XML query and even the mediators have many restrictions. Therefore, this paper proposes formal data model and algebra based on directed edge labeled graph for XML query. To implement algebra, not only algorithms of operation for algebra are presented, but also they are implemented using access method and path index based on RDBMS or ORDBMS. In particular, experiments to show the effectiveness of the implemented algebra are performed on XML documents on EST data which are semistructured data.