Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 14 of 14 for “"XML query processing"”.
-
Distributed XML Query Processing
While centralized query processing over collections of XML data stored at a single site is a well understood problem, centralized query evaluation techniques are inherently limited in their scalability when presented with large collections (or a single, large document) and heavy query workloads. In …
-
Using semantics in XML query processing
As more and more information is stored in XML format, how to query XML data efficiently becomes increasingly important. In this thesis, we try to make use of semantics information, e.g., value, property, object and relationship among objects, to improve the efficiency of XML query processing. We …
-
XML query processing: Indices and histograms
As XML gains unprecedented popularity as the standard format for presenting and exchanging information over the Internet in both the commercial and academic community, the XML database floats as a suitable, semi-structured alternative to store data. The inherent structure of XML documents renders …
-
Faster XML query processing using path index
A realistic XML query processor uses the structural summary of the target XML document to evaluate queries. For XML documents modelled by tree structures, the retrieval of data requires substantial tree traversals. Thus, the fundamental differences between query processors are the organisation of …
-
Holistic Boolean Twig Pattern Matching for Efficient XML Query Processing
Efficient twig pattern matching is essential to XML queries and other tree-based queries. Numerous so-called holistic algorithms have been proposed for efficiently processing the twig patterns in XML queries. However, a more general form of twig pattern, called Boolean-twig (or B-twig for short), …
-
XML query processing: architecture and algorithms for optimization and execution
This thesis proposes a design for XPath processing on relational back-ends and a design for a generic and modular framework for cost-based execution of XPath queries. Based on these designs two complete systems have been developed, the PPFx system and the GeCOEX system, respectively. PPFx is an XML …
-
Efficient processing of XML path queries with not-predicates
… OF PATH QUERIES FORMS THE BASIS OF COMPLEX XML QUERY PROCESSING WHICH HAS ATTRACTED A LOT OF RESEARCH ATTENTION. HOWEVER, NONE OF THESE WORKS HAVE EXAMINED THE PROCESSING OF MORE COMPLEX QUERIES THAT CONTAIN NOT-PREDICATES. IN THIS PAPER, WE PRESENT THE FIRST STUDY ON EVALUATING PATH QUERIES …
-
Efficient processing of multiple XML twig queries
Finding all occurrences of a twig pattern in an XML document is a core operation for XML query processing. The emergence of XML as a common mark-up language for data interchange has spawned great interest in techniques for filtering and content-based routing of XML data. In this paper, we aim to …
-
XML Query optimization
XML has been widely used for data exchange as well as for representing and manipulating semi-structured data. To efficiently process XML queries becomes increasingly important and has received significant research attention lately. This thesis focuses on the optimization of XML queries with respect …
-
A node partitioning strategy for optimising the performance of XML queries
… systems, the eXtensible Markup Language (XML) has been widely adopted as a data storage format. However, XML query processing presents issues both in terms of query performance and updatability. Thus, many are choosing to shred XML data into relational databases in order to benet from its …
-
Child Prime Label Approaches to Evaluate XML Structured Queries
The adoption of the eXtensible Markup Language (XML) as the standard format to store and exchange semi-structure data has been gaining momentum. The growing number of XML documents leads to the need for appropriate XML querying algorithms which are able to retrieve XML data efficiently. Due to the …
-
Incremental processing of twig queries
Queries on XML databases are typically expressed as twig patterns. The query processing problem then reduces to finding all occurrences of these twig patterns in an XML database. Traditionally, these queries have been executed using techniques such as structural joins and holistic twig joins. We, …
-
Labeling dynamic XML documents: An order-centric approach
The rise of xml as a de facto standard for data exchange and representation has generated a lot of interest on querying XML documents that conform to an ordered tree-structured data model. Labeling schemes facilitate XML query processing by assigning each node in the XML tree a unique label[8, 22, …
-
Efficient processing of XML twig pattern matching
With the rapidly increasing popularity of XML, more and more information is being stored, exchanged and presented in XML format. The ability to efficiently query XML data sources, therefore, becomes increasingly important. This thesis studies the query processing of a core subset of XML query …