USING RELEVANT SETS FOR OPTIMIZING XML INDEXES

Paz Biber, Ehud Gudes

2005

Abstract

Local bisimilarity has been proposed as an approximate structural summary for XML and other semi-structured databases. Approximate structural summary, such as A(k)-Index and D(k)-Index, reduce the index's size (and therefore reduce query evaluation time) by compromising on the long path queries. We introduce the A(k)-Simplified and the A(k)-Relevant, approximate structural summaries for graph documents in general, and for XML in particular. Like A(k)-Index and D(k)-Index, our indexes are based on local bisimilarity, however, unlike the previous indexes, they support the removal of non-relevant nodes. We also describe a way to eliminate false drops that might occur due to nodes removal. Our experiments shows that A(k)-Simplified and A(k)-Relevant are much smaller then A(k)-Index, and give accurate results with better performance, for short relevant path queries.

Paper Citation

in Harvard Style

Biber P. and Gudes E. (2005). USING RELEVANT SETS FOR OPTIMIZING XML INDEXES . In Proceedings of the First International Conference on Web Information Systems and Technologies - Volume 1: WEBIST, ISBN 972-8865-20-1, pages 13-23. DOI: 10.5220/0001229400130023

in Bibtex Style

@conference{webist05,
author={Paz Biber and Ehud Gudes},
title={USING RELEVANT SETS FOR OPTIMIZING XML INDEXES},
booktitle={Proceedings of the First International Conference on Web Information Systems and Technologies - Volume 1: WEBIST,},
year={2005},
pages={13-23},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0001229400130023},
isbn={972-8865-20-1},
}

in EndNote Style

TY - CONF
JO - Proceedings of the First International Conference on Web Information Systems and Technologies - Volume 1: WEBIST,
TI - USING RELEVANT SETS FOR OPTIMIZING XML INDEXES
SN - 972-8865-20-1
AU - Biber P.
AU - Gudes E.
PY - 2005
SP - 13
EP - 23
DO - 10.5220/0001229400130023