Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

XPath fragments on XML in columns

XPath fragments on XML in columns Purpose – This paper considers schemaless XML data stored in a column‐oriented storage, particularly in C‐store. Axes of the XPath language are studied and a design and analysis of algorithms for processing the XPath fragment XP{*, //, /} are described in detail. The paper aims to discuss these issues. Design/methodology/approach – A two‐level model of C‐store based on XML‐enabled relational databases is supposed. The axes of XPath language in this environment have been studied by Cástková and Pokorný. The associated algorithms have been used for the implementation of the XPath fragment XP{*, //, /}. Findings – The main advantage of this approach is algorithms implementing axes evaluations that are mostly of logarithmic complexity in n , where n is the number of nodes of XML tree associated with an XML document. A low‐level memory system enables the estimation of the number of two abstract operations providing an interface to an external memory. The algorithms developed are mostly of logarithmic complexity in n , where n is the number of nodes of XML tree associated with an XML document. Originality/value – The paper extends the approach of querying XML data stored in a column‐oriented storage to the XPath fragment using only child and descendant axes and estimates the complexity of evaluating its queries. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png International Journal of Web Information Systems Emerald Publishing

XPath fragments on XML in columns

Loading next page...
 
/lp/emerald-publishing/xpath-fragments-on-xml-in-columns-ry0M9nPX0k

References (21)

Publisher
Emerald Publishing
Copyright
Copyright © 2013 Emerald Group Publishing Limited. All rights reserved.
ISSN
1744-0084
DOI
10.1108/IJWIS-05-2013-0017
Publisher site
See Article on Publisher Site

Abstract

Purpose – This paper considers schemaless XML data stored in a column‐oriented storage, particularly in C‐store. Axes of the XPath language are studied and a design and analysis of algorithms for processing the XPath fragment XP{*, //, /} are described in detail. The paper aims to discuss these issues. Design/methodology/approach – A two‐level model of C‐store based on XML‐enabled relational databases is supposed. The axes of XPath language in this environment have been studied by Cástková and Pokorný. The associated algorithms have been used for the implementation of the XPath fragment XP{*, //, /}. Findings – The main advantage of this approach is algorithms implementing axes evaluations that are mostly of logarithmic complexity in n , where n is the number of nodes of XML tree associated with an XML document. A low‐level memory system enables the estimation of the number of two abstract operations providing an interface to an external memory. The algorithms developed are mostly of logarithmic complexity in n , where n is the number of nodes of XML tree associated with an XML document. Originality/value – The paper extends the approach of querying XML data stored in a column‐oriented storage to the XPath fragment using only child and descendant axes and estimates the complexity of evaluating its queries.

Journal

International Journal of Web Information SystemsEmerald Publishing

Published: Nov 15, 2013

Keywords: C‐store; Column stores; Managing and storing XML data; Relational database; XML; XPath

There are no references for this article.