Path queries on compressed XML

  • Buneman P
  • Grohe M
  • Koch C
  • 22


    Mendeley users who have this article in their library.
  • 114


    Citations of this article.


Central to any XML query language is a path language such
as XPath which operates on the tree structure of the XML
document. We demonstrate in this paper that the tree
structure can be effectively compressed and manipulated
using techniques derived from symbolic model
checking. Specifically, we show first that succinct
representations of document tree structures based on
sharing subtrees are highly effective. Second, we show
that compressed structures can be queried directly and
effciently through a process of manipulating selections
of nodes and partial decompression. We study both the
theoretical and experimental properties of this technique
and provide algorithms for querying our compressed
instances using node-selecting path query languages such
as XPath. We believe the ability to store and manipulate
large portions of the structure of very large XML
documents in main memory is crucial to the development of
effcient, scalable native XML databases and query

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

  • ISBN: 0127224424
  • SCOPUS: 2-s2.0-85012112309
  • PUI: 614407971
  • SGR: 85012112309


  • Peter Buneman

  • Martin Grohe

  • Christoph Koch

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free