Index-supported on XML-documents containing links

Several approaches of path indexes have been proposed in recent times for evaluating path expressions. Most of these path indexes cannot efficiently handle a large set of linked XML documents and can not efficiently handle ancestor-descendant queries over long paths. In this paper, we proposed an ef...

Full description

Saved in:
Bibliographic Details
Published in2003 46th Midwest Symposium on Circuits and Systems Vol. 3; pp. 1597 - 1600 Vol. 3
Main Authors Awny Sayed, Rainer Unland
Format Conference Proceeding
LanguageEnglish
Published IEEE 2003
Subjects
Automata
Buildings
Data mining
Database languages
Fabrics
HTML
Indexing
Internet
Labeling
XML
Online AccessGet full text

Cover

More Information
Summary:Several approaches of path indexes have been proposed in recent times for evaluating path expressions. Most of these path indexes cannot efficiently handle a large set of linked XML documents and can not efficiently handle ancestor-descendant queries over long paths. In this paper, we proposed an efficient path index mechanism for fast and efficient evaluation of path expressions in linked and unlinked XML documents over long path with wildcards, our index depends on the labeling scheme to answer the query of type ancestor-descendants relationship on a large graph, by looking only at the labels, such that the two labels L(A) and L(B) would contain enough information to answer the required path expression A//B on linked XML documents.
ISBN:0780382943
9780780382947
ISSN:1548-3746
1558-3899
DOI:10.1109/MWSCAS.2003.1562604