• The KIPS Transactions:PartD
• /
• v.13D no.2 s.105
• /
• pp.157-164
• /
• 2006

Since XML is emerging as the de facto standard for exchanging and representation of data on the web, the amount of XML data has rapidly increased. Thus, the need for effective store and retrieval of U data has arisen. Since the existing techniques such as XRel which is an XML storage and management technique using RDBMS simply record the existing all label paths, diverse classes of label path expressions could not be efficiently supported. In this paper, we present a technique which supports storage and retrieval for XML data using RDBMS efficiently compared with the existing approaches. Since the proposed technique keeps the XML path index on the relational database and replace label paths with path identifiers, diverse XML queries can be evaluated compared with existing approaches. Also, the proposed technique does not require the modification of the relational database engine and consumes the disk space less. Our experimental result demonstrates the better query performance compared with existing techniques.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2017.01a
• /
• pp.209-212
• /
• 2017

최근 정보통신기술의 비약적 발전에 따라 문서 제작 과정 또한 디지털 방식의 형태가 주를 이루게 되었다. 하지만 이와 더불어 문서를 통한 개인 정보 유출의 문제 또한 대두되게 되었다. 본 논문에서는 이미지 형식의 문서의 유출 방지를 위해 광학문자인식(OCR)을 활용한 문자인식 기능과 개인정보 검출 기능을 통합적으로 수행 한하여 기존 OCR엔진과의 차별점을 두었다. 또한 원하는 경로의 파일 탐색을 가능하도록 하고, 선택한 경로에 저장되어 있는 이미지파일 내의 검출 문자들을 정규표현식을 사용해 특정한 개인정보 패턴과 매칭하여 문서 내 포함된 개인정보를 반환하여 출력한다. 이러한 개인정보 검출 결과 중요 개인정보가 포함된 파일을 사용자에게 별도로 통보하도록 한다. 따라서 본 논문에서는 기존의 개인정보 검출 과정의 번거로움을 극복하여 사용자의 편의 향상과 더불어 문서를 통한 개인정보의 유출을 사전에 방지 할 수 있도록 하였다.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.6
• /
• pp.1447-1457
• /
• 1999

Visual Object Query language(VOQL) proposed recently is a visual object-oriented database query language which can effectively represent queries on complex structured data, since schema information is visually included in query expressions. VOQL, which is a graph-based query language with inductively defined semantics, can concisely represent various text-based path expressions by graph, and clearly convey the semantics of complex path expressions. however, the existing VOQL assumes that all the attributes are multi-valued, and cannot visualize the concept of binding of object variables. therefore, VPAL query expressions are not intuitive, so that it is difficult to extend the existing VOQL theoretically. In this paper, we propose VOQL that improved on these problems. The improved VOQL visualizes the result of a single-valued attribute and that of a multi-valued attribute as a visual element and a subblob, respectively, and specifies the binding of object variables by introducing visual variables, so that the improved VOQL intuitively and clearly represents the semantics of queries.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.4 s.346
• /
• pp.39-43
• /
• 2006

In this contribution, the achievable performance of orthogonal multicarrier DS-CDMA systems employing synchronous uplink transmissions is investigated. The bit error ratio (BER) performance is analyzed under dispersive Rayleigh multipath fading conditions as a function of the number of users.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.11c
• /
• pp.1481-1484
• /
• 2003

XML 뷰 기반의 랩퍼 시스템은 지역 데이터베이스에 대한 XML 뷰 정의를 지원하고, 사용자는 XML 질의어를 이용하여 XML 뷰에 대한 질의를 할 수 있다. 이 때, XML 뷰와 질의간의 합성이 필수적인데, 본 논문에서는 XML 뷰와 사용자 질의를 높은 수준에서 추상화하여 모두 트리로 표현하고, 이것을 이용하여 질의에 나타난 뷰의 경로식에 대한 항해를 통해 합성을 수행하는 모델을 제시한다. 뷰 트리는 가상의 XML 문서의 구조를 그대로 반영하기 때문에 경로식의 항해를 쉽게 하며, XML 뷰의 스키마를 생성하고, 질의 결과 문서를 구성하는 템플릿으로 활용된다. 또한, XML 뷰와 질의의 추상화된 개념적 통일은 다단계 XML 뷰 정의와 합성을 지원하고, 구현을 용이하게 한다.

• Journal of KIISE:Databases
• /
• v.28 no.3
• /
• pp.449-457
• /
• 2001

As XML has become an emerging standard for information exchange on the World Wide Web, it has gained attention in database communities to extract information from XML seen as a database model. XML queries are based on regular path queries, which find objects reachable by given regular expressions. To answer many kinds of user queries, it is necessary to evaluate queries that have multiple regular path expressions. However, previous work such as query rewriting and query optimization in the frame work of semistructured data has dealt with a single regular expression. For queries that have multiple regular expressions we suggest a two phase optimizing technique: 1. query rewriting using views by finding the mappings from the view's body to the query's body and 2. for rewritten queries, evaluating each query conjunct and combining them. We show that our rewriting algorithm is sound and our query evaluation technique is more efficient than the previous work on optimizing semistructured queries.

• Journal of KIISE:Databases
• /
• v.32 no.4
• /
• pp.452-472
• /
• 2005

We propose XIR-Branching, a novel method for processing partial match queries on heterogeneous XML documents using information retrieval(IR) techniques and novel instance join techniques. A partial match query is defined as the one having the descendent-or-self axis '//' in its path expression. In its general form, a partial match query has branch predicates forming branching paths. The objective of XIR-Branching is to efficiently support this type of queries for large-scale documents of heterogeneous schemas. XIR-Branching has its basis on the conventional schema-level methods using relational tables(e.g., XRel, XParent, XIR-Linear[21]) and significantly improves their efficiency and scalability using two techniques: an inverted index technique and a novel prefix match join. The former supports linear path expressions as the method used in XIR-Linear[21]. The latter supports branching path expressions, and allows for finding the result nodes more efficiently than containment joins used in the conventional methods. XIR-Linear shows the efficiency for linear path expressions, but does not handle branching path expressions. However, we have to handle branching path expressions for querying more in detail and general. The paper presents a novel method for handling branching path expressions. XIR-Branching reduces a candidate set for a query as a schema-level method and then, efficiently finds a final result set by using a novel prefix match join as an instance-level method. We compare the efficiency and scalability of XIR-Branching with those of XRel and XParent using XML documents crawled from the Internet. The results show that XIR-Branching is more efficient than both XRel and XParent by several orders of magnitude for linear path expressions, and by several factors for branching path expressions.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.15 no.6
• /
• pp.2048-2061
• /
• 1991

As compared with other cutting types, the ball end milling process causes a complexity in cutting system and a falling-off of machinability. In order to increase the productivity and efficiency in th NC machining of sculptured surfaces, this study carried out the qualitative linearized evaluation about the ball end milling system and applied their practical expressions to the technological processor at the cutter path planning stage. The evaluated expressions were proved to be adequate for practical use from an accuracy point of view and the estimation models were applied to sculptured surface machining processes for finding variable machining conditions. Consequently, it was recognized that variable machining conditions bring about the dispersion of force system and the reduction of machining time by more than 50%.

• The KIPS Transactions:PartD
• /
• v.10D no.4
• /
• pp.621-638
• /
• 2003

As demand of XML documents in the Web increases, Web service applications that manage XML documents as their resource are increasing. The view mechanism for XML data could be considered for effective in query processing in these Web service applications. If the XML query results are maintained as XML materialized views and their relevant XML query is processed using them, the query response time could be reduced. There are two types of processing an in path expression, which is one of the core features of XML query languages, using XML materialized views. One is the type where the complete query result is obtained from the materialized view, and the other is the type where some of the result is obtained from the materialized view and the rest is from the underlying XML documents. In this paper, we investigate the second type. An XML query in this paper is an XML path expression which is one of the core features of XML query languages. We first describe the storage structures of the XML materialized views derived from the underlying XML documents in the XML repository. Then, we propose the algorithms to decompose a given XML query into the subquery against the materialized view and the subquery against the underlying XML documents, and to integrate the results of these subqueries. Through performance evaluation, we figure out the condition under which our XML query decomposition using materialized views is more effective than the conventional processing.

• Journal of Korea Society of Industrial Information Systems
• /
• v.8 no.1
• /
• pp.112-120
• /
• 2003

We propose a graphical object query language called OGPL (Odysseus Graphical Query Language) for Odysseus object databases. By employing simple graphical notations, OGQL provides a user friendly database interface for object databases. OGQL provides a simple graphical notation for advanced features of the object queries such as path expressions including cycles (cyclic queries). Cyclic queries have not been handled in the previous graphical query languages because of their complexity and ambiguity in devising appropriate graphical notations. GOQL also provides a graphical notation for inheritance hierarchy. Since OGQL has been implemented in Java and JDBC standard interface, users can access the remote databases in a web environment and the system has platform-independent architecture.