• Proceedings of the Korean Information Science Society Conference
• /
• 2000.10b
• /
• pp.191-193
• /
• 2000

인터넷 표준 문서인 XML(Extensible Markup Language)이 구조적인 내용만을 갖고 있기 때문에 문서를 보여주기 위한 표현 정보를 포함하는 스타일 시트(style sheets)가 필요하다. 이를 위해 W3C(World Wide Web Consortium)에서는 XML 문서의 구조적인 접근을 위한 XPath(XML Path Language)와 문서의 내용구조를 변환하기 위한 XSLT (Transformations), 그리고 포맷팅 정보를 위한 XSL-fo(XSL Formatting objects)로 구성되는 XSL(Extensible Stylesheet Language)를 제안하였다. 본 논문에서는 XML 문서와 XSL 스타일 시트를 이용하여 XML 문서의 데이터를 변환하고 XSL-fo 정보를 이용하여 결과 FO(Formatting Objects)를 생성한다. 또한 트리로 구성된 결과 FO에서 페이지 정보와 FOT (Formatting Objects Tree)를 추출하는 FOT 생성부를 두었고, 디스플레이 관리기와 포맷팅 모듈 객체 관리기를 두어 FOT를 포맷팅을 위한 모듈로 저장하고 디스플레이 해주는 포맷팅 처리 시스템을 설계 및 구현하였다.

• Proceedings of the Korean Information Science Society Conference
• /
• 1999.10a
• /
• pp.93-95
• /
• 1999

최근 XML 문서에 대한 활용이 늘어나면서 이들 문서에 대한 저장 및 검색에 대한 요구가 증가하고 있다. XML문서는 SGML(Standard Generalized Markup Language) 문서가 가지고 있는 다양한 기능들과 구조적인 표현 능력, 그리고 사용의 용이성 등의 장점을 지닌 언어로 1996년 웹의 문서 표준으로 제안되었다. 따라서 XML 문서의 특성을 반영한 문서 검색시스템에 대한 요구가 시급한 상태이며, 기존의 시스템의 경우 구조 및 내용-기반 멀티미디어 문서검색을 효과적으로 지원하지 못하고 있다. 본 논문에서는 XML 문서의 구조정보 및 내용정보를 효과적으로 검색할 수 있는 XML 문서 저장 시스템을 설계 및 구현한다. 구현하는 시스템은 구조-기반 검색을 위해 o2store위에 역파일 인덱스를 구축하고 내용-기반 검색을 위해 X-tree를 사용한다. 또한 검색 인터페이스를 JAVA로 구현하여 효율적인 검색이 이루어지도록 한다.

• Journal of KIISE:Databases
• /
• v.32 no.4
• /
• pp.416-428
• /
• 2005

In the paper we propose an index method for XML streaming services, where a server broadcasts XML data to a lot of clients in wireless information systems. In order to control the access and tuning time of mobile clients, the proposed method constructs the XML stream through replicating partial index intermixed with parts of data. For this purpose, we propose a two-level tree structure for separating index and XML data into two parts: replicated vs. non-replicated. We analyze the performance of the proposed method with respect to access time and tuning time. With the analysis result, we derive the optimal level value.

• Proceedings of the Korea Association of Information Systems Conference
• /
• 2001.12a
• /
• pp.64-82
• /
• 2001

HTML revolutionized the way we specify the appearance of data on the Internet. Today, XML (the eXtensible Markup Language) is changing the way we specify the meaning of data. XML, lets document authors define their own markup tags and attribute names to assign meaning to the data elements in the document. Further, XML elements can be nested and include references to indicate data relationships, as Listing One. Unlike HTML, XML markup tags do not describe how to render the data. Rather, they provide descriptions of data, allowing software to understand the meaning of the data automatically For publishing, instead, XSL, the eXtensible Stylesheet Language as a separate language , is in charge of specifying the presentation of XML documents. The purpose of this study is to discover how to transform your organizations relational data into potential e-commerce, business-to-business, and web application with XML and XSL documents. For this purpose, the literature survey, first of all, was undertaken to understand the basic structures of XML documents. Second, one case implementation was performed to understand how to transform Access 2002 XML Files into HTML with XSLTand VB script. The results come out to be successful, more or less. But the limitations of it still exist. One immediate limitation is that XML documents are essentially tree structure, as dictated by the nesting of elements. However, relational database tables are two dimensional matrix structure. In addition, real-world data often is graph structured-a single data element may be referenced in multiple ways. However, this study is useful for understanding how to convert relational database into XML documents and to publish them using XSL or VB script.

• The KIPS Transactions:PartC
• /
• v.10C no.6
• /
• pp.683-694
• /
• 2003

We present X-tree Diff, a change detection algorithm for tree-structured data. Our work is motivated by need to monitor massive volume of web documents and detect suspicious changes, called defacement attack on web sites. From this context, our algorithm should be very efficient in speed and use of memory space. X-tree Diff uses a special ordered labeled tree, X-tree, to represent XML/HTML documents. X-tree nodes have a special field, tMD, which stores a 128-bit hash value representing the structure and data of subtrees, so match identical subtrees form the old and new versions. During this process, X-tree Diff uses the Rule of Delaying Ambiguous Matchings, implying that it perform exact matching where a node in the old version has one-to one corrspondence with the corresponding node in the new, by delaying all the others. It drastically reduces the possibility of wrong matchings. X-tree Diff propagates such exact matchings upwards in Step 2, and obtain more matchings downwsards from roots in Step 3. In step 4, nodes to ve inserted or deleted are decided, We aldo show thst X-tree Diff runs on O(n), woere n is the number of noses in X-trees, in worst case as well as in average case, This result is even better than that of BULD Diff algorithm, which is O(n log(n)) in worst case, We experimented X-tree Diff on reat data, which are about 11,000 home pages from about 20 wev sites, instead of synthetic documets manipulated for experimented for ex[erimentation. Currently, X-treeDiff algorithm is being used in a commeercial hacking detection system, called the WIDS(Web-Document Intrusion Detection System), which is to find changes occured in registered websites, and report suspicious changes to users.

• Journal of Computing Science and Engineering
• /
• v.4 no.4
• /
• pp.313-349
• /
• 2010

In this paper, we study the data interoperability problem of web services in terms of XML schema compatibility. When Web Service A sends XML messages to Web Service B, A is interoperable with B if B can accept all messages from A. That is, the XML schema R for B to receive XML instances must be compatible with the XML schema S for A to send XML instances, Le., A is a subschema of B. We propose a formal model called Schema Automaton (SA) to model W3C XML Schema (XSD) and develop several algorithms to perform different XML schema computations. The computations include schema minimization, schema equivalence testing, subschema testing, and subschema extraction. We have conducted experiments on an e-commerce standard XSD called xCBL to demonstrate the practicality of our algorithms. One experiment has refuted the claim that the xCBL 3.5 XSD is backward compatible with the xCBL 3.0 XSD. Another experiment has shown that the xCBL XSDs can be effectively trimmed into small subschemas for specific applications, which has significantly reduced the schema processing time.

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

Event logging plays increasingly an important role in system and network management, and syslog is a de-facto standard for logging system events. However, due to the semi-structured features of Common Log Format data most studies on log analysis focus on the frequent patterns. The extensible Markup Language can provide a nice representation scheme for structure and search of formatted data found in syslog messages. However, previous XML-formatted schemes and applications for system logging are not suitable for semantic approach such as ranking based search or similarity measurement for log data. In this paper, based on ranked keyword search techniques over XML document, we propose an XML tree structure through a new data modeling approach for syslog data. Finally, we show suitability of proposed structure for semantic retrieval.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2002.11a
• /
• pp.592-596
• /
• 2002

Can speak that DTD is meta data that define meaning of expressed data on XML document. Therefore, In case DTD information is damaged this information to base security of XML document dangerous. Not that attach digital signature on XML document at send-receive process of XML document in this research, proposed method to attach digital signature to DTD. As reading DTD file to end first, do parsing, and store abstracted element or attribute entitys in hash table. Read hash table and achieve message digest if parsing is ended. Compose and create digital signature with individual key after achievement. When sign digital, problem that create entirely other digest cost because do not examine about order that change at message digest process is happened. This solved by method to create DTD's digital signature using DOM that can embody tree structure for standard structure and document.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2006.05a
• /
• pp.105-108
• /
• 2006

형식 언어에서 XML 문서를 정의하는 방법으로 정규트리문법을 이용할 수 있다. 한편 XML 데이터에서 재귀와 반복과 같이 필요한 경우만을 제외하고 터미널 노드를 상위 노드의 직접 자식으로 여기는 것을 인라인이라고 한다. 본 논문에서는 XML 데이터 처리에서 사용되는 인라인 기법을 정규트리문법에 적용하여 터미널 노드만으로 이루어진 터미널 언어를 정의하고, 정규트리문법에 대응하는 인라인 정규트리문법을 소개한다. 또한 일반적인 정규트리문법으로부터 인라인 정규트리문법으로의 변환 알고리즘을 소개한다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2005.05a
• /
• pp.51-54
• /
• 2005

This paper proposes an index structure which is used to process X-Path on S-XML data. There are many previous index structures based on tree structure for X-Path processing. Because of general tree index's top-down query fashion, the unnecessary node traversal makes heavy access and decreases the query processing performance. And both of the two query types for X-Path called single-path query and branching query need to be supported in proposed index structure. This method uses a combination of path summary and the node indexing. First, it manages hashing on hierarchy elements which are presented in tag in S-XML. Second, array blocks named path summary array is created in each node of hashing to store the path information. The X-Path processing finds the tag element using hashing and checks array blocks in each node to determine the path of query's result. Based on this structure, it supports both single-path query and branching path query and improves the X-Path processing performance.