ScholarLens Back to search
2005•Computer Engineering and ScienceRequires access

An Efficient Index for XML Path Queries

Gong Yu-chang

Open publisher page 0 citations

Abstract

The design of XML query indexes is a hot research topic.This paper proposes an efficient index for the XML query-KDXI.XML files are encoded first,and then structural summaries are constructed and encoded.The semistructural join algorithms and the evaluation process of XML path queries based on KDXI is studied in detail.Through KDXI,general path queries can be evaluated efficiently,and redundant structural joins are avoided.Finally the experiments prove the advantages of KDXI.

About this research paper

What this paper is about

The design of XML query indexes is a hot research topic.This paper proposes an efficient index for the XML query-KDXI.XML files are encoded first,and then structural summaries are constructed and encoded.The semistructural join algorithms and the evaluation process of XML path queries based on KDXI is studied in detail.Through KDXI,general path queries can be evaluated efficiently,and redundant structural joins are avoided.Finally the experiments prove the advantages of KDXI.

Why it matters

A significance statement is not available in the OpenAlex record.

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 design of XML query indexes is a hot research topic.This paper proposes an efficient index for the XML query-KDXI.XML files are encoded first,and then structural summaries are constructed and encoded.The semistructural join algorithms and the evaluation process of XML path queries based on KDXI is studied in detail.Through KDXI,general path queries can be evaluated efficiently,and redundant structural joins are avoided.Finally the experiments prove the advantages of KDXI.

Key concepts: Computer science, Joins, XML, Efficient XML Interchange, Information retrieval, Path (computing), Streaming XML, XML database

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
An Efficient Index for XML Path Queries — Research Paper | ScholarLens