An XPath reduction algorithm for fast querying of digital libraries in XML

Hyoseop Shin, Minsoo Lee

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

Abstract

Digital contents in XML are rapidly increasing on the Web. In our work, we assume that the XML data is stored in a relational database using the popular node numbering scheme and propose a technique to pre-process XPath queries in order to convert them into a much more efficient form that will run several times faster. Our algorithm uses a special data structure called XIP (XML Instance Path) tree of each XML document to reduce a given XPath query (i.e., path expression) into a more simpler form. The benefits of the approach is more significant for long length queries, making it useful for digital libraries storing large and complex structured XML documents for multimedia or business applications.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
EditorsTengku Mohd Tengku Sembok, Halimah Badioze Zaman, Hsinchun Chen, Shalini R. Urs, Sung Hyon Myaeng
PublisherSpringer Verlag
Pages275-278
Number of pages4
ISBN (Electronic)9783540206088
DOIs
StatePublished - 2003

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2911
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Fingerprint

Dive into the research topics of 'An XPath reduction algorithm for fast querying of digital libraries in XML'. Together they form a unique fingerprint.

Cite this