2008Unpublished venueRequires access

CXQU: A compact XML storage for efficient query and update processing

Ramez Alkhatib, Marc H. Scholl

Open publisher page 8 citations

Abstract

The volume of XML data is increasing rapidly. This poses challenges to the database community to find efficient XML data management solutions. Because XML is by nature verbose, compression is an important issue for XML. In this paper, we propose a new approach (CXQU) which not only supports efficient queries and updates but also compresses the structure of an XML document based on the exploitation of repetitive consecutive tags in the structure of the XML documents by using a labeling scheme derived from the ORDPATH labeling scheme. CXQU stores the compressed XML structure and the data separately in a robust compact storage that includes a set of access support structures to guarantee fast query performance and efficient updates, especially insertion. An experimental evaluation on sets of XML data shows the efficiency of CXQU.

About this research paper

What this paper is about

The volume of XML data is increasing rapidly. This poses challenges to the database community to find efficient XML data management solutions. Because XML is by nature verbose, compression is an important issue for XML. In this paper, we propose a new approach (CXQU) which not only supports efficient queries and updates but also compresses the structure of an XML document based on the exploitation of repetitive consecutive tags in the structure of the XML documents by using a labeling scheme derived from the ORDPATH labeling scheme. CXQU stores the compressed XML structure and the data separately in a robust compact storage that includes a set of access support structures to guarantee fast query performance and efficient updates, especially insertion. An experimental evaluation on sets of XML data shows the efficiency of CXQU.

Why it matters

OpenAlex reports 8 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

The volume of XML data is increasing rapidly. This poses challenges to the database community to find efficient XML data management solutions. Because XML is by nature verbose, compression is an important issue for XML. In this paper, we propose a new approach (CXQU) which not only supports efficient queries and updates but also compresses the structure of an XML document based on the exploitation of repetitive consecutive tags in the structure of the XML documents by using a labeling scheme derived from the ORDPATH labeling scheme. CXQU stores the compressed XML structure and the data separately in a robust compact storage that includes a set of access support structures to guarantee fast query performance and efficient updates, especially insertion. An experimental evaluation on sets of XML data shows the efficiency of CXQU.

Key concepts: Streaming XML, Computer science, Efficient XML Interchange, XML database, XML Encryption, XML Signature, XML validation, Document Structure Description

Related papers

Back to paper searchBrowse research topicsOriginal source
CXQU: A compact XML storage for efficient query and update processing — Research Paper | ScholarLens