• The Journal of Society for e-Business Studies
• /
• v.11 no.1
• /
• pp.1-23
• /
• 2006

As data on the Web is more and more in XML due to proliferation of Web applications such as e-Commerce, it is strongly required to rapidly process XML queries. One of such techniques is XML query caching. For frequently submitted queries, their results could be cached in order to guarantee fast response for the same queries. In this paper, we propose techniques for XML query performance improvement whereby the set of node identifiers(NIS) for an XML query is cached. NIS is most commonly employed as a format of XML query result,, consisting of the identifiers of the XML elements that comprise the query result. With NIS, it is suitable to meet the Web applications data retrieval requirements because reconstruction and/or modification of query results and integration of multiple query results can be efficiently done. Incremental refresh of NIS against its source updates can also be efficiently done. When the query result is requested in XML, however, materialization of NIS is needed by retrieving the source XML elements through their identifiers. In this paper, we consider three different types of NISs. proposing the algorithms of their creation, materialization, and incremental refresh. All of them were implemented using an RDBMS. Through a detailed set of performance experiments, we showed the efficiency of the proposed XML query caching techniques.

• Spatial Information Research
• /
• v.12 no.4 s.31
• /
• pp.307-319
• /
• 2004

Managing GML data in traditional database systems is not efficient since It has not only characteristics of spatial data but also features of (semi) structured n documents. XML enabled database systems can manage U data efficiently, however they cannot handle spatial data. Spatial database systems are good at spatial data handling but those are inefficient for XML data. This paper proposes a storage method of GML data for spatial database systems in order to solve the problems. The proposed method generates spatial database schemas from GML application schemas and store GML data into SDBMS through the generated schemas. A prototype of the storage method has been implemented on the Postgre SQ/SPE system to show the proposed method is appropriate for storing GML data. As a result, the implemented system was able to store various GML data which had diverse XML structures and different size. Stored data size was smaller than GML files. Furthermore, spatial, non-spatial, and mixed content queries could be performed over the stored GML data as quickly.

• The KIPS Transactions:PartD
• /
• v.14D no.1 s.111
• /
• pp.1-8
• /
• 2007

As the web document of XML, an exchange language of data in the advanced Internet, is increasing, a target of information retrieval becomes the web documents. Therefore, there we researches on structure, integration and retrieval of XML documents. This paper proposes a clustering method of XML documents based on frequent structures, as a basic research to efficiently process query and retrieval. To do so, first, trees representing XML documents are decomposed and we extract frequent structures from them. Second, we perform clustering considering the weight of large items to adjust cluster creation and cluster cohesion, considering frequent structures as items of transactions. Third, we show the excellence of our method through some experiments which compare which the previous methods.

• Journal of Korea Multimedia Society
• /
• v.12 no.2
• /
• pp.178-190
• /
• 2009

XML is recommended by W3C(World Wide Web) and widely accepted as a standard markup language for expression and sharing data. Recently, increasing the use and the amount of XML documents, there is required that easy methods for accessing XML documents at anytime and anywhere, therefore, the distributed XML repository systems is developed. For this, distributed XML repository systems is necessary to research catalog management schemes. In this paper, we design distributed XML database model considering CPU costs, I/O costs, concurrency control, two-phase commits a protocol, queuing delay and so on. And we implement a simulator in order to execute performance evaluation centralized catalog method, fully replicated catalog method, and partitioned catalog method using reasonably setting up environments.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.18 no.3
• /
• pp.143-154
• /
• 2008

Information hiding is a very important technology recently. Having this technology can be a competitive power for secure communication. In this paper, it will be showed that hiding data in MS Office 2007 file is possible. Considering Microsoft (MS) Office 2007 file format is based on Open XML format, the feature of Open XML format makes it possible to hide data in MS Office 2007 file. In Open XML format, unknown XML files and their relationships can be defined by user. These parts and relationships are used to hide data in MS Office 2007 file. Considering unknown parts and unknown relationships are not in normal MS Office 2007 file, the hidden data can be detected by confirming of unknown parts and unknown relationships.

• The KIPS Transactions:PartD
• /
• v.11D no.3
• /
• pp.519-532
• /
• 2004

With the explosion of bioinformatics data such proteins and genes, biologists need a integrated system to analyze and organize large datasets that interact with heterogeneous types of biological data. In this paper, we propose a integration system based on a mediated data warehouse architecture using a XML model in order to combine protein related data at biology laboratories. A fact constellation model in this system is used at a common model for integration and an integrated schema it translated to a XML schema. In addition, to track source changes and provenance of data in an integrated database employ incremental update and management of sequence version. This paper shows modeling of integration for protein structures, sequences and classification of structures using the proposed system.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.55 no.1
• /
• pp.18-23
• /
• 2006

Recently as the power system has been becoming massive and complicated, most of the faults bring on severe proliferation effects. Because of the complexity of the power system it is not easy to analyze faults-the calculation of current flows under fault conditions. Therefore many researches have been performed in this area. As a result of those efforts, the protective equipments for a power system have been designed to operate properly and without damage when the highest possible fault current is flowing in the power system. Most of the fault data can be also acquired from intelligent protection equipments. The fault data saved in them don't always include the fault type information. n you don't have knowledge about the fault analysis, it becomes useless. So this paper presents 3 topics to increase a reusability of them as followings. First, describes a fault data using the XML(extensible Markup Language). It would be a well-formed and valid document complied with suggested XML DTD(Document Type Definition). In this paper I suggest a standard DTD to describe the power system fault. If the XML document describes any power system faults is validated against suggested DTD, it is possible to be used in any applications. Second, sends them through the web using the XML web service. Last, presents the rapid and accurate algorithm for a fault type determination of the fault data received from the web. In the ultimate the client to request the server to analyze a fault data is provided the correct information what kind of fault is occurred.

• The Journal of Society for e-Business Studies
• /
• v.12 no.3
• /
• pp.211-234
• /
• 2007

In e-business, XML is a major format of data and it is essential to efficiently process queries against XML data. XML query caching has received much attention for query performance improvement. In employing XML query caching, some efficient technique of cache replacement is required. The previous techniques considered as a replacement unit either the whole query result or the path in the query result. The former is simple to employ but it is not efficient whereas the latter is more efficient and yet the size difference among the potential victims is large, and thus, efficiency of caching would be limited. In this paper, we propose a new technique where the element in the query result is are placement unit to overcome the limitations of the previous techniques. The proposed technique could enhance the cache efficiency to a great extent because it would not pick a victim whose size is too large to store a new cached item, the variance in the size of victims would be small, and the unused space of the cache storage would be small. A technique of XML semantic cache replacement is presented which is based on the replacement function that takes into account cache hit ratio, last access time, fetch time, size of XML semantic region, size of element in XML semantic region, etc. We implemented a prototype XML semantic cache system that employs the proposed technique, and conducted a detailed set of experiments over a LAN environment. The experimental results showed that our proposed technique outperformed the previous ones.

• Journal of Digital Contents Society
• /
• v.9 no.1
• /
• pp.157-164
• /
• 2008

As use of internet gets increased, the efficiency of applying the chart which is expressing and providing information through web is increased. The chart has the high delivering ability of information because it expresses data visually. But there are problems such as compatibility between the chart composing programs, difficulty of sharing the chart data, and displaying the chart on the web. In this paper, we propose the chart markup language, which expresses the chart information by using the XML in order to solve problems of compatibility of the chart expression and sharing the chart information. The CML is possible not only to provide compatibility between platforms and programs but also to share the chart data as it is based on the XML.

• Journal of Korea Game Society
• /
• v.2 no.2
• /
• pp.104-112
• /
• 2002

XML was applied to web-Based application system for efficient data supervision and processing. Also, ASP permitted embodiment of easy web-Based programming, and UML is studied by the new alternative of system modelling techniques. Thus, In this paper see embodied student taking a course application management system using XML, ASP, UML. This was composed, and used XML for effective data supervision and processing by student mode and administrator mode. Also, It used UML for systems analysis and design, and whole system implemented by ASP. And, Database implemented to used in MS-ACCESS, and it used java Script language for efficient practical use of web document.