• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.11 no.11
• /
• pp.4583-4591
• /
• 2010

Existing XML-based variable data publishing, in which a user has to manually prepare and edit template rules, is rather difficult for general users to create documents. Especially when processing large variable XML documents such as manuals or technical documents, fast document formatting is required to provide fast response speed for editing, which the existing batch processing cannot provide. This paper proposes a variable data publishing system with dynamic editing and formatting function, which support fast formatting upon user's request for large volume documents as well as for template editing through interaction by displaying the result of template-based variable documents on WYSIWYG screen. Proposed system can be effectively used for creating customized documents with many variable data that can be changed according to individual characteristics such as individual, company or area; source documents, template documents and formatted documents adopt XML, XSLT and XPath standards suggested by W3C, which facilitates extension to web document processing system.

• Journal of KIISE:Databases
• /
• v.31 no.6
• /
• pp.699-709
• /
• 2004

XML is increasingly important in data exchange and information management. Starting point for retrieving the structure and integrating the documents efficiently is clustering the documents that have similar structure. The reason is that we can retrieve the documents more flexible and faster than the method treating the whole documents that have different structure. Therefore, in this paper, we propose the similar structure-based incremental clustering method useful for retrieving the structure of XML documents and integrating them. As a novel method, we use a clustering algorithm for transactional data that facilitates the large number of data, which is quite different from the existing methods that measure the similarity between documents, using vector. We first extract the representative structures of XML documents using sequential pattern algorithm, and then we perform the similar structure based document clustering, assuming that the document as a transaction, the representative structure of the document as the items of the transaction. In addition, we define the cluster cohesion and inter-cluster similarity, and analyze the efficiency of the Proposed method through comparing with the existing method by experiments.

• The Journal of the Korea Contents Association
• /
• v.4 no.1
• /
• pp.90-99
• /
• 2004

With the spread of internet, the digitalization and the knowledge informatization are in progress rapidly. Specially, numerous users make the various works and use the services on the web. For the most part, these works make use of the XML The XML shines the reusing of the documents because it is separated from contents and sues. Also, it can re-define the logic structure of the document for requirement of the developer. However, the XML document’s size is much larger than common text document because it handles the document type and adds numerous tags for representing structure of the document. To utilize the limited storage devices of Palmtop, PDA and so u, it is necessary to compress and handle the documents efficiently. Recently, the compression techniques for efficiently handling and compressing the XML documents are under way to solve this problem. But most of the existing researches don't support the query processing for the compressed XML documents. In this paper, we design and implement the XML compression algorithm that compresses the XML document and Processes the query of compressed XML document faster and more efficiently than previous techniques.

• The KIPS Transactions:PartD
• /
• v.10D no.3
• /
• pp.399-406
• /
• 2003

The widespreading of XML as a standard for semi-structured documents on the Web opens up challenging opportunities for Web query language. And UML is a graphical language to represent the result of object-oriented analysis and design. In this paper, we introduce an UML-based graphical query language for XML documents. The use of a visual formalism for representing the syntax and semantics of queries enables an intuitive expression of queries, even when they are rather complex. And, it is matched a series of processes to store and retrieve XML documents to OODBMS with the use of an uniform visualization for representing both the content of XML documents (and of their DTD) and the syntax and semantics of queries.

• Journal of KIISE:Computing Practices and Letters
• /
• v.8 no.4
• /
• pp.389-398
• /
• 2002

As XML has been proposed a standard format for organizing and exchanging data in the internet, many applications on managing XML data have been developed. Especially, there are many studies for storing XML documents. It is important to evaluate the performance for efficient storage techniques. In this work, we suggest an efficient technique for storing XML documents using an object-relational database model. We verify the efficiency of a new storage technique through the performance evaluation on XML storage techniques. The contributions of this paper is that we suggest an efficient storage technique using an existing data management model and evaluate the performance for storage techniques for XML documents including an new storage technique.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.3
• /
• pp.649-655
• /
• 2013

Recently, researches are studied in developing efficient techniques for accessing, querying, and managing XML documents which are frequently used in the Internet. In this paper, we propose a new method to cluster XML documents efficiently. An element and an inclusion relationship of a XML document corresponds to a node and a level of the corresponding tree, respectively. Therefore, when two XML documents are similar then their nodes' names and levels of the corresponding trees are also similar. In this paper, we cluster XML documents by using nodes' names and levels of the corresponding tree as a feature of a document. The experiment shows that our proposed method has a good performance.

• The KIPS Transactions:PartD
• /
• v.9D no.3
• /
• pp.355-364
• /
• 2002

Recently, WWW(World Wide Web) has become a source of a large amount of information, and is now recognized not only as an information-sharing tool, but also as an information repository. Currently, the majority of documents on the web were created using HTML(Hypertext Markup Language). Although HTML is simple and easy to learn, its inherent lack of describing document structure makes it difficult to retrieve information effectively. One possible solution would be to convert such HTML documents into XML (extensible Markup Language) documents. This is a standard markup language for exchanging data on the web. It can describe a document structure freely by defining its own DTD (Document Type Definition). This makes it possible to integrate, store, and retrieve data on the web efficiently In this paper, we will propose a converter that automatically converts HTML documents with similar pattern into XML documents by analyzing the document structure and recognizing its path information.

• Journal of Korea Multimedia Society
• /
• v.8 no.5
• /
• pp.596-605
• /
• 2005

Conventional XML query methods such as simple keyword match or structural query expansion are not sufficient to catch the underlying information in the documents. Moreover, these methods inefficiently try to query all the documents. This paper proposes document tittering and query expansion methods that are based on ontology. Using ontology, we construct a universal DTD that can filter off unnecessary documents. Then, query expansion method is developed through the analysis of concept hierarchy and association among concepts. The proposed methods are applied on variety of sample XML documents to test the effectiveness.

• Journal of Korea Multimedia Society
• /
• v.10 no.7
• /
• pp.807-816
• /
• 2007

Since W3C proposed XML in 1996, XML documents have been widely spreaded in many internet documents. Because of this, needs for research related with XML is increasing. Especially, it is being well performed to study XML management system for storage, retrieval, and management with XML Documents. Among these studies, XRel is a representative study for XML management and has been become a comparative study. In this study, we suggest XML documents management system based on Relational DataBase Management System. This system is stored not all possible path expressions such as XRel, but filtered path expression which has text value or attribute value. And by giving each node Node Expression Identifier, we try to match given Node Expression Identifier. Finally, to prove efficiency of the suggested technique, this paper shows the result of experiment that compares XPath query processing performance between suggested study and existing technique, XRel.

• Journal of KIISE:Computing Practices and Letters
• /
• v.7 no.5
• /
• pp.383-391
• /
• 2001

The value of XML as electronic documents is increasing nowadays. The XML document has properties of semistructured data. It can be modeled as object-oriented model which can be easily adapted by object-oriented database. For storing XML documents to conventional database system, extracting schema information from the DTD of a XML document has been studied for several years. In this paper we store XML documents into object-oriented database, which preserve the semantics of the documents. We can store and query by OQL and make applications by C++ and make applications by C++ binding which is the access method of object-oriented database. Therefore, existing database applications can be used without modification.