• Journal of KIISE
• /
• v.43 no.2
• /
• pp.256-268
• /
• 2016

Modern networks consisting of various heterogeneous equipment are often installed in a distributed manner. Thus the NETCONF standard was established to manage networks centrally and efficiently. In this paper, we present a method that integrates each NETCONF layer into a single system based on the results of previous studies. In the RPC Layer, an asynchronous communication channel and parallel processes are possible using multi-threading. In the Operation Layer, operational efficiency is increased by using a data group with dependencies between the equipment configuration data and by improving the data structure, enabling efficiently processing of XML queries even with multiple managers. The data modeling techniques and grouping methods in the Content Layer are presented in detail for interoperability between the Operation Layer and the Content Layer. Finally, the GUI program was implemented and its implementation is reported. We performed an experiment comparing the improved NETCONF with the standard NETCONF to measure factors, such as query processing ratio, query processing speed, and CPU utilization. The improved NETCONF demonstrated excellent query processing ratio and query processing speed, whereas the standard NETCONF had excellent CPU utilization.

• Journal of Korea Multimedia Society
• /
• v.11 no.7
• /
• pp.905-913
• /
• 2008

Many heterogeneous XML documents are being widely used with the increasing employment of XML, and the importance of data structure research for more efficient document management has been growing steadily. We propose a query processing technique which uses parent node information in a partitioned inverted index tree. The searching efficiency of these heterogeneous documents is greatly influenced by the number of query processing and the amount of target data sets in many ways. Therefore, considering these two factors is very important for designing a data structure. First, our technique stores parent node's information in an inverted index table. Then using this information, we can reduce the number of query processing by half. Also, the amount of target data sets can be lessoned by using partitioned inverted index table. Some XML documents collected from the Internet will be used to demonstrate the new method, and its high efficiency will be compared with some of the existing searching methods.

• Journal of Korean Library and Information Science Society
• /
• v.37 no.3
• /
• pp.415-431
• /
• 2006

The semantic web was proposed as the next generation web technology. In the environment of the semantic web, resources as well defined and related with each other semantically, the RDF supports this basic mechanism. To establish and develop the semantic web. the basic technologies related to RDF data must be pre-established. In this research, we develop methods for storing and querying RDF data using an XML database system. As using XML database, XML data and RDF data can be integrated and efficiently managed. We construct and evaluate a system applying the proposed method to store and search data, we compared the query processing performance on our system with that of an existing system. The experiment result show that our system processes queries more efficiently.

• The KIPS Transactions:PartD
• /
• v.12D no.5 s.101
• /
• pp.765-772
• /
• 2005

For the excellent U web services, the program developers should create both user's client program and the sewer program Recently, the structural alteration of programs are often caused by infernal and external environment concerned with social trends and preferences as well as user's requirements expectations. So, for reducing the development time and workload of XML web service programs, it is necessary to develop the web program generation tools. This paper suggest how to design and implement the web-based XML Tree builder, which was able to provide the information for promptly and easily generating the XML Schema, XML Stylesheet and XML Document through the XML Development Supporting Server System.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2003.10a
• /
• pp.892-896
• /
• 2003

XML is used in various fields such as interface format for data swapping between application between several various system passing over thing to mark to web browser simply. Accordingly, a lot of studies about system that can manage effectively and search XML document with formation of information, reusability, disposal and durability, portability are proceeding. In this paper, explain about XQL and document structure processor and language processor of quality and make contents of XML document by tree structure, structure information presents method that find XML document tree structure information that is correct on question using XQL while do parsing. Through this, described for design and embodiment of efficient XML document search system that use XQL that compose structure information of document in tree structure and is proposed in language of quality after do parsing absorbing XML document that is scattered on web.

• Journal of KIISE
• /
• v.43 no.4
• /
• pp.489-496
• /
• 2016

XML can effectively express structured or semi-structured data as well as relational databases. XQuery is a query language for retrieving information for such an XML document. In this paper, an XQuery composer is designed and implemented, with an API provided for XQuery processors, and a proper processor is registered. This composer shows query results immediately processed by the processor. As this composer contains a parser for XQuery, it can compose XQuery effectively using a diverse dialog box designed for XQuery grammar. A dialog box is affiliated with a clause region, which is a region that algebra operates from the parsing tree. It can compose path expressions for an XML document easily as it shows an element tree from DTD graphically. Path expressions are composed automatically by marking elements in the structural hierarchy and by specifying the predicate of an element partially.