Using relevant sets for optimizing XML indexes

Paz Biber, Ehud Gudes

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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.

Original languageEnglish
Title of host publicationWEBIST 2005 - 1st International Conference on Web Information Systems and Technologies, Proceedings
Pages13-23
Number of pages11
StatePublished - 1 Dec 2005
Externally publishedYes
Event1st International Conference on Web Information Systems and Technologies, WEBIST 2005 - Miami, FL, United States
Duration: 26 May 200528 May 2005

Publication series

NameWEBIST 2005 - 1st International Conference on Web Information Systems and Technologies, Proceedings

Conference

Conference1st International Conference on Web Information Systems and Technologies, WEBIST 2005
Country/TerritoryUnited States
CityMiami, FL
Period26/05/0528/05/05

Keywords

  • A(k)-Index
  • Local bisimulation
  • Partial order relation
  • Relevant set

Fingerprint

Dive into the research topics of 'Using relevant sets for optimizing XML indexes'. Together they form a unique fingerprint.

Cite this