Proceedings Article10.1109/ICDEW.2006.120
Processing XPath Queries in PC-Clusters Using XML Data Partitioning
K. Kido,Toshiyuki Amagasa,Hiroyuki Kitagawa +2 more
- 03 Apr 2006
- pp 114
19
TL;DR: A scheme for parallel processing of XML data using PC Clusters is proposed and an algorithm for computing pseudo-optimal assignment of XML fragments like greedy method in the light of XML query workload is given.
read more
Abstract: Recently, with the rapid spread of XML format, it has become popular that large-scale data, whose size range from several hundreds of MB to several GB, are described by XML. For the purpose of providing fast and reliable means for storage and retrieval of huge XML data, it is a reasonable choice for us to use XML databases. In fact, there are many ways to realize XML databases, but relational XML database, in that an XML data is mapped to relational tables and query processing is enabled in terms of SQL queries, is one of the most popular way to implement XML databases. However, some researchers have pointed out that the performance of relational XML databases degrades when dealing with such huge XML data. In this study, we propose a scheme for parallel processing of XML data using PC Clusters. First, we discuss how to decompose XML data so that we can perform parallel processing of XML queries. We give the definitions of vertical and horizontal decomposition of XML data based on decomposition of schema graph and XML instances, respectively. To allocate decomposed XML data to cluster nodes, we give an algorithm for computing pseudo-optimal assignment of XML fragments like greedy method in the light of XML query workload. Finally, we experimentally evaluate the effectiveness of the proposed method.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Efficient Query Processing for Large XML Data in Distributed Environments
H. Kurita,Kenji Hatano,Jun Miyazaki,Shunsuke Uemura +3 more
- 21 May 2007
TL;DR: An algorithm for relocating partitioned XML data based on the CPU load of query processing and it is found that there is a performance advantage in the approach for executing distributed query processing of large XML data.
XML data partitioning strategies to improve parallelism in parallel holistic twig joins
Imam Machdi,Toshiyuki Amagasa,Hiroyuki Kitagawa +2 more
- 15 Feb 2009
TL;DR: This paper proposes XML data partitioning strategies that are able to alleviate system performance degradation due to workload imbalance, especially for parallel holistic twig joins processing.
17
A Survey on XML Fragmentation
Vanessa Braganholo,Marta Mattoso +1 more
- 04 Dec 2014
TL;DR: This paper surveys the existing XML fragmentation approaches in literature, comparing their features and highlighting their drawbacks, and establishes a map of the area to establish a consensus in the database community as to what an XML fragment is.
GMX: an XML data partitioning scheme for holistic twig joins
Imam Machdi,Toshiyuki Amagasa,Hiroyuki Kitagawa +2 more
- 24 Nov 2008
TL;DR: A grid metadata model for XML is proposed that gives a conceptual view to partition XML data, specifically for holistic twig joins processing and adopts a cost-based model and facilitates a set of partition refinement methods for workload balancing purpose.
11
•Dissertation
Cardinality-Aware and Purely Relational Implementation of an XQuery Processor
Sherif Sakr
- 01 Jan 2007
TL;DR: An integrated framework for exploiting the available estimated cardinality information to provide the RDBMS query optimizers with hints for selecting the best alternative execution plan for the SQL evaluation scripts of the input XQuery expression is presented.
References
Structural joins: a primitive for efficient XML query pattern matching
Shurug Al-Khalifa,H. V. Jagadish,Nick Koudas,Jignesh M. Patel,Divesh Srivastava,Yuqing Wu +5 more
- 07 Aug 2002
TL;DR: It is shown that, in some cases, tree-merge algorithms can have performance comparable to stack-tree algorithms, in many cases they are considerably worse, and this behavior is explained by analytical results that demonstrate that, on sorted inputs, the stack- tree algorithms have worst-case I/O and CPU complexities linear in the sum of the sizes of inputs and output, while the tree-MERge algorithms do not have the same guarantee.
•Journal Article
XRel : A path-based approach to storage and retrieval of XML documents using relational databases
TL;DR: XRel enables us to store XML documents using a fixed relational schema without any information about DTDs and also to utilize indices such as the B 1 -tree and the R-tree supported by database management systems.
631
XPath query containment
Thomas Schwentick
- 01 Mar 2004
TL;DR: The main idea of this article is to describe some of the main algorithmic techniques that have been proposed for XPath Query Containment, to decrease online computation time in an XML publish-subscribe scenario with hundreds of subscribers and tens of thousands of XML documents to be delivered per day.
143
•Proceedings Article
On Distributing XML Repositories.
Jan-Marco Bremer,Michael Gertz +1 more
- 01 Jan 2003
TL;DR: This paper introduces a distribution approach for a virtual XML repository, presents a fragmentation method and outline an allocation model for distributed XML fragments, and discusses an efficient realization based on small, local index structures.
78
•Book
An introduction to the Dewey Decimal Classification
C. D. Batty
- 01 Jan 1966
TL;DR: In the Dewey Decimal Classification, the notation is expressed in Arabic numerals, which provides a universal language to identify the class and related classes, regardless of the fact that different words or languages may be used to describe the class.
51
Related Papers (5)
Jan-Marco Bremer,Michael Gertz +1 more
- 01 Jan 2003
Toshiyuki Amagasa,K. Kido,Hiroyuki Kitagawa +2 more
- 03 Sep 2007