View : 31 Download: 0

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

Title
An XPath reduction algorithm for fast querying of digital libraries in XML
Authors
Shin H.Lee M.
Ewha Authors
이민수
SCOPUS Author ID
이민수scopus
Issue Date
2003
Journal Title
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN
0302-9743JCR Link
Citation
vol. 2911, pp. 275 - 278
Indexed
SCOPUS scopus
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. © Springer-Verlag Berlin Heidelberg 2003.
Appears in Collections:
엘텍공과대학 > 컴퓨터공학과 > Journal papers
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE