• Proceedings of the Korean Information Science Society Conference
• /
• 2004.04b
• /
• pp.10-12
• /
• 2004

Nowadays, with the rapid emergence of XML as a standard for data exchange over the Internet had led to considerable interest In the problem of data management requirements such as the need to store and query XML documents in which the location path languages Xpath is of particular important for XML application since it is a core component of many XML processing standards such as XSLT or XQuery, This parer gives a brief overview about method and design by applying a new spatial-based indexing method namely Xp-free that used for supporting Xpath. Spatial indexing technique has been proved its capacity on searching in large databases. Based on accelerating a node using planar as combined with the numbering schema, we devise efficiently derivative algorithms, which are simple, but useful. Besides that, it also allows to trace all Its relative nodes of context node In a manner supporting queries natural to the types especially Xpath queries with predicates.

• Annual Conference of KIPS
• /
• 2003.05c
• /
• pp.1607-1610
• /
• 2003

최근 MP3 저작권에 대한 찬반 논란이 계속 되면서, 기존의 클라이언트-서버가 아닌 Peer-To-Peer(P2P) 기반의 데이터 검색 시스템에 관한 여러 연구가 활발히 진행되고 있다. 하지만. 검색 방법에 있어서는 단순히 파일이름을 이용한 데이터 검색 방법이 주류를 이루고 있는데 본 논문에서는 검색을 위한 문서 정보를 XML 형태로 저장하고, 구조적인 검색을 용이하게 하기 위해 DOM(Document Object Model)을 이용하여 XML 문서를 트리 형태로 구성한 후 P2P 네트워킹 플랫폼인 JXTA를 기반으로 XPath 질의를 수행함으로써 P2P 네트워크 기반에서 구조적 검색이 가능한 시스템을 구현하였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.3 no.5
• /
• pp.492-506
• /
• 2009

Index structures that are based on sequence matching for XPath processing such as ViST, PRIX and LCS-TRIM have recently been proposed to reduce the search time of XML documents. However, ViST can cause a lot of unnecessary computation and I/O when processing structural joint queries because its numbering scheme is not optimized. PRIX and LCS-TRIM require much processing time for matching XML data trees and queries. In this paper, we propose a novel index structure that solves the problems of ViST and improves the performance of PRIX and LCS-TRIM. Our index structure provides the minimum sequence matching scheme to efficiently process structural queries. Finally, to verify the superiority of the proposed index structure with the minimum sequence matching scheme, we compare our index structure with ViST, PRIX and LCS-TRIM in terms of query processing of a single path or of a branching path including wild-cards ('*' and '//' ).

• Journal of KIISE:Databases
• /
• v.35 no.3
• /
• pp.243-256
• /
• 2008

With rapid growth of Internet, the amount of information in the Web is increasing exponentially. However, information on the current Web is understandable only for human, and thus it makes the exact information retrieval difficult. For solving this problem, the Semantic Web is suggested and we must use ontology languages that can endow data to semantics for implementing it. One of the representative ontology languages is OWL(Web Ontology Language) adopted as a recommendation by the World-Wide Web Consortium. OWL has richer expression power and formal semantics than other ontology languages such as RDF and RDF-S. In addition, OWL includes hierarchical structure information between classes or properties. Therefore, an efficient OWL storage model considering hierarchical structure for effective information retrieval on the Semantic Web is required. In this paper, we suggest the XPOS(XPath-based OWL Storage) model including hierarchy information between classes or properties as XPath form and enabling intuitive and effective information retrieval. Also, we show the comparative evaluation results on the performance of XPOS model, Sesame, and the XML storage-based storage model regarding query processing.

• The KIPS Transactions:PartD
• /
• v.15D no.4
• /
• pp.441-450
• /
• 2008

Recently, access control on form-based web information systems has become one of the useful methods for implementing client systems in a service-oriented architecture. In particular, XForms language is being adopted in many systems as a description language for XML-based user interfaces and server interactions. In this paper, we propose an efficient algorithm for the evaluation of XPath-based access rules for XForms pages. In this model, an XForms page is a sequence of queries and the client system performs user interface realization along with XPath rule evaluations. XPath rules have instance-dependent predicates, which for the most part are shared between rules. For the efficient evaluation of shared predicate expressions in access control rules, we proposed a predicate graph model that reuses the previously evaluated results for the same context node. This approach guarantees that each predicate expression is evaluated for the relevant xml node only once.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.10c
• /
• pp.280-282
• /
• 2002

XML은 웹 문서의 표준이며, 네트워크 상의 문서교환 포맷으로 자리잡아가고 있다. 이에 따라, 많은 XML데이터를 저장하고 관리하는 방법에 대한 연구가 활발하게 진행되고 있다. 저장 및 관리 해야할 XML문서의 양이 증가함에 따라 XML데이터의 검색을 효율적으로 지원할 수 있는 저장구조가 필요하게 되었다. 따라서, 본 논문에서는 XML Path 기반의 검색질의에 효과적으로 대응할 수 있는 XML 저장 시스템을 설계 및 구현 하고자 한다.

• Annual Conference of KIPS
• /
• 2010.11a
• /
• pp.299-302
• /
• 2010

본 논문에서는 차량 전장용 소프트웨어의 일부인 Basic Software(BSW) 모듈 설정이 AUTOSAR 표준을 따르는 지를 평가하는 도구를 설명한다. 평가 도구는 크게 평가 속성 추출 부분과 속성 평가 부분으로 구분된다. 평가 속성 추출 부분에서는 AUTOSAR에서 제공하는 BSW 메타 모델로부터 평가 속성을 정의하는 데 사용되는 정보를 자동으로 추출하며 속성 평가 부분에서는 앞에서 추출한 정보를 이용하여 평가 속성을 정의한 후 사용자가 설정한 BSW 사용자 설정 모델에 대해서 평가를 자동으로 수행한다. 한편 평가 속성을 정의하는 데 BSW 메타 모델과 BSW 사용자 설정 모델이 이용된다. 이 두 모델은 XML 구조를 따르고 있으며 이 두 모델로부터 필요한 정보를 얻기 위해서는 XML 탐색이 요구된다. 이를 위해서 우리는 XML 질의어 중 하나인 XPath를 사용하였으며 BSW 메타 모델과 BSW 사용자 설정 모델로부터 평가에 필요한 정보를 얻을 수 있었다. 또한 평가 속성을 정의하는 데에도 XPath 를 사용하였으며 XPath로 정의한 평가 속성을 이용하여 우리는 BSW 사용자 설정 모델을 평가할 수 있었다.

• KIPS Transactions on Computer and Communication Systems
• /
• v.4 no.11
• /
• pp.383-390
• /
• 2015

It is appropriate to use the NETCONF to monitor and manage today's complex networks that are composed of variety links and heterogeneous equipment. Since the first standard of the NETCONF are launched, there have been several revisions, but disadvantages of each layer capabilities is still present and the most typical disadvantage is XML document processing efficiency of the Content layer. In this paper, we perform data modeling by constructing a sub-tree based on the dependencies between Content layer data, and suggest method of extract efficiently data from XML by applying the extended VTD-XML technique for the XPath query. We performs experiment to compare NETCONF in proposed method to NETCONF in previous studies and NETCONF standard. we validate superiority of improved NETCONF in the paper. As experimental results, we verify that improved NETCONF is better than the other two NETCONF each 4% and 10% in terms of query processing rate, and faster than each 3.9 seconds and 10.4 seconds in terms of query processing speed.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.5 no.4
• /
• pp.39-49
• /
• 2009

Nowadays, according to rapid development of computing environments, information processing and analysis system are very interesting research area. As a viewpoint of data preparation-processing-analysis in knowledge technology, the goal of automated information system is to satisfy high reliability and confidence and to minimize of human-administrator intervention. In addition, we expect the system which can deal with problem and abnormal error effectively as a fault detection and fault tolerance. In this paper, we design a monitoring system as follows. A productive monitoring information from various systems has unstructured forms and characteristics and crawls informative data by conditions and gathering rules. For representing of monitering information which requested by administrator, running-status can be able to check dynamically and systematic like connection/closed status in real-time. Our proposed system can easily correct and processing for monitoring information from various type of server and support to make objective judgement and analysis of administrator under operative target of information system. We implement semi-realtime monitering system using AJAX technology for dynamic browsing of web information and information processing using XML and XPATH. We apply our system to SMS server for checking running status and the system shows that has high utility and reliability.

• Journal of KIISE:Databases
• /
• v.31 no.5
• /
• pp.540-552
• /
• 2004

We propose XIR-Linear, a novel method for processing partial match queries on large-scale heterogeneous XML documents using information retrieval (IR) techniques. XPath queries are written in path expressions on a tree structure representing an XML document. An XPath query in its major form is a partial match query. The objective of XIR-Linear is to efficiently support this type of queries for large-scale documents of heterogeneous schemas. XIR-Linear has its basis on the schema-level methods using relational tables and drastically improves their efficiency and scalability using an inverted index technique. The method indexes the labels in label paths as key words in texts, and allows for finding the label paths that match the queries far more efficiently than string match used in conventional methods. We demonstrate the efficiency and scalability of XIR-Linear by comparing it with XRel and XParent using XML documents crawled from the Internet. The results show that XIR-Linear is more efficient than both XRel and XParent by several orders of magnitude for linear path expressions as the number of XML documents increases.