• International journal of advanced smart convergence
• /
• v.10 no.2
• /
• pp.64-72
• /
• 2021

XML message brokers have a lot of importance because XML has become a practical standard for data exchange in many applications. Message brokers covered in this document store many users. This paper is a study of the processing of twig pattern queries in XML documents using branching node streams in XML message broker structures. This work is about query processing in XML documents, especially for query processing with XML twig patterns in the XML message broker structure and proposed a method to reduce query processing time when parsing documents with XML twig patterns by processing information. In this paper, the twig pattern query processing method of documents using the branching node stream removes the twigging value of the branch node that does not include the labeling value of the branch node stream when it receives a twig query from the client. In this paper, the leaf node discovery time can be reduced by reducing the navigation time of nodes in XML documents that are matched to leaf nodes in twig queries for client twig queries. Overall, the overall processing time to respond to queries is reduced, allowing for rapid question-answer processing.

• The Journal of Society for e-Business Studies
• /
• v.14 no.1
• /
• pp.57-79
• /
• 2009

As the Web-based e-Business prevails, the volume of XML data on the Web is getting larger than ever. Although much research has been done on decomposing and storing XML data in RDB, which is now the most popular storage for XML, and on processing XML queries through their SQL counterparts, little attention was paid to how to alleviate the burden of storing massive volume of XML data. In this paper, we propose a hybrid method of storing XML data in RDB, whereby the unit of storage could be an XML subtree as well as an XML node. The part of XML data whose nodes were separately stored could be reformed into an XML subtree for storing when it gets rarely queried or less valuable for reference as time goes by. With this method, we designed and implemented a hybrid XML storage and query processing system, comparing it with the conventional system where an XML node is the only unit of storage. Through experiments, we compared storage efficiency and query processing performance, validating the effectiveness of our proposed system.

• Journal of KIISE:Databases
• /
• v.37 no.3
• /
• pp.146-164
• /
• 2010

Due to an increasing volume of XML data, it is considered prudent to store XML data on an industry-strength database system instead of relying on a domain specific application or a file system. For shredded XML data stored in relational tables, however, it may not be straightforward to apply existing algorithms for twig query processing, since most of the algorithms require XML data to be accessed in a form of streams of elements grouped by their tags and sorted in a particular order. In order to support XML query processing within the common framework of relational database systems, we first propose several bitmap indexes and their strategies for supporting holistic twig joining on XML data stored in relational tables. Since bitmap indexes are well supported in most of the commercial and open-source database systems, the proposed bitmapped indexes and twig query processing strategies can be incorporated into relational query processing framework with more ease. The proposed query processing strategies are efficient in terms of both time and space, because the compressed bitmap indexes stay compressed during data access. In addition, we propose a hybrid index which computes twig query solutions with only bit-vectors, without accessing labeled XML elements stored in the relational tables.

• The Journal of Society for e-Business Studies
• /
• v.15 no.4
• /
• pp.1-19
• /
• 2010

Recently, it is necessary to process real time sensor data, which is generated from ubiquitous environments. Data, which are written by XML, are small, but, large volumes of data. Therefore, weneed to use an efficient method for processing a large amount of it. An XQuery has two types for sensor data: one is to get sensor identification and value from sensor data; the other is restructuring for user's convenience. Existing XQuery engines don't have efficient method for batch processing of sensor data. This paper proposed the twig query processing over reverse path summary, and we developed and applied restructuring batch processing method for real time processing of a large amount of sensor data. Finally, we do performance evaluation using XMark and RFID EPC data, and comparison analysis with MonetDB/XQuery and Berkeley DB XML.

• The KIPS Transactions:PartD
• /
• v.8D no.6
• /
• pp.799-812
• /
• 2001

As XML become more popular for encoding data and exchanging format on the web, recent work on processing XML Document in DBMS has been performed. However, there is no formal data model for XML, and there is lack of research on XML algebra for processing complex XML query and even the mediators have many restrictions. Therefore, this paper proposes formal data model and algebra based on directed edge labeled graph for XML query. To implement algebra, not only algorithms of operation for algebra are presented, but also they are implemented using access method and path index based on RDBMS or ORDBMS. In particular, experiments to show the effectiveness of the implemented algebra are performed on XML documents on EST data which are semistructured data.

• The KIPS Transactions:PartD
• /
• v.11D no.7 s.96
• /
• pp.1375-1384
• /
• 2004

Streaming data processing is an area of interest with much research under way. There has been increasing attention on the demands for efficient processing of streaming data produced in the application areas such as monitoring and sensor network. We have developed a continuous query processing system for streaming data and evaluated its performance in this paper. XML, the standard for data exchange on the web, is used as the model for the streaming data and the XQuery appended with a time interval is adopted as the query language for expressing con-tinuous queries. In the proposed system, the result is produced through background processing and materialized for reute in subsequent query processing. Through a detailed set of performance experiments, we shoed the effectiveness of the proposed system.

• Journal of Korea Multimedia Society
• /
• v.5 no.2
• /
• pp.129-140
• /
• 2002

XML has become a standard for exchanging document data on the web. Currently, most of the commercial data are stored in the relational database system. It requires to converse the document into XML form to transfer the data to a relational database system. The purpose of this paper is to research on a query processing system which will make it easy and convenient to raise a query and derive results from the document data stored in a relational database. We have designed a XML view called R2X(Relational To XML). With this R2X view, users can view a relational database as XML documents. Using R2X views, we design and implement a Query processing system which will make it expedient to form a query with a XML query language called XQL.

• Journal of KIISE:Databases
• /
• v.35 no.4
• /
• pp.356-367
• /
• 2008

As XML is gaining unqualified success in being adopted as a universal data representation and exchange format, particularly in the World Wide Web, the problem of querying XML documents poses interesting challenges to database researcher. Several structural XML query processing methods, including XISS and XR-tree, for past years, have been proposed for fast query processing. However, structural XML query processing has the problem of requiring expensive Join cost for twig path query Recently, sequence matching based XML query processing methods, including ViST and PRIX, have been proposed to solve the problem of structural XML query processing methods. Through sequence matching based XML query processing methods match structured queries against structured data as a whole without breaking down the queries into sub queries of paths or nodes and relying on join operations to combine their results. However, determining the structural relationship of ViST is incorrect because its numbering scheme is not optimized. And PRIX requires many processing time for matching LPS and NPS about XML data trees and queries. Therefore, in this paper, we propose efficient sequence matching method u sing the bottom-up query processing for efficient XML query processing. Also, to verify the superiority of our index structure, we compare our sequence matching method with ViST and PRIX in terms of query processing with linear path or twig path including wild-card('*' and '//').

• Journal of the Korea Society of Computer and Information
• /
• v.22 no.4
• /
• pp.59-65
• /
• 2017

XML has established itself as the format for data exchange on the internet and the volume of its instance is large scale. Therefore, to extract similar information from XML instance is one of research topics but is insufficient. In this paper, we extract similar information from various kind of XML instances according to the same goal. Also we use only the structure information of XML instance for information extraction because some of XML instance is described without its schema. In order to efficiently extract similar information, we propose a minimum unit of processing and two approaches for finding the unit. The one is a structure-based method which uses only the structure information of XML instance and another is a measure-based method which finds a unit by numerical formula. Our two approaches can be applied to any application that needs the extraction of similar information based on XML data. Also the approach can be used for HTML instance.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.11 no.3
• /
• pp.11-19
• /
• 2015

Due to recent development in mobile devices, the mobile device utilization and many related applications have been increasing. Most of initial applications on mobile devices just showed simple information, but now they processes huge data. However, smart devices have certain limitations in processing massive data. Especially, if the size of data increases, the speed of data processing adversely decreases, so the performance of programs also decreases. If hardware specification of the mobile devices is not enough to handle it, response time will be drastically delayed. To overcome these drawbacks, most of application running on mobile devices communicate with their servers to manage data. XML is a proper language for data communication to send and receive data between servers and mobile devices, because it defines rules of document's format and it is a textual data format and small-sized language. However, mobile devices have limitation such as memory, CPU and wireless network to process huge data and XML also takes a lot of time to communicate with servers and devices and handle data, so it could be overhead in service time. Binary XML is an alternative of performance improvement in data processing, which has XML's benefits and minimizes the XML size by binary coding. However, most of binaryXML which are used on applications don't fit on mobile applications. In this paper, we surveyed many kinds of binaryXML, compared merits and demerits to find a binaryXML for mobile applications. We propose how to use binary XML and implemented an electronic attendance system using binary XML to overcome the limitation of XML and to reduce the load of data communications between servers and devices.