Efficient XPath Evaluation

B. Wang, L. Feng, Y. Shen

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

Abstract

Inspired by the best querying performance of ViST among the rest of the approaches in the literature, and meanwhile to overcome its shortcomings, in this paper, we present another efficient and novel geometric sequence mechanism, which transforms XML documents and XPath queries into the corresponding geometric data/query sequences. XML querying is thus converted to finding non-contiguous geometric subsequence matches. Our approach ensures correct (i.e., without semantic false) and fast (i.e., without the costly post-processing phase) evaluation of XPath queries, while at the same time guaranteeing the linear space complexity. We demonstrate the significant performance improvement of our approach through a set of experiments on both synthetic and real-life data.
Original languageEnglish
Title of host publicationAdvances in Databases and Information Systems
Subtitle of host publication9th East European Conference, ADBIS 2005, Tallinn, Estonia, September 12-15, 2005
Place of PublicationBerlin, Germany
PublisherSpringer
Pages223-237
Number of pages15
ISBN (Print)978-3-540-28585-4
DOIs
Publication statusPublished - Sep 2005
Event9th East European Conference on Advances in Databases and Information Systems, ADBIS 2005 - Tallinn, Estonia
Duration: 12 Sep 200515 Sep 2005
Conference number: 9

Publication series

NameLecture Notes in Computer Science
PublisherSpringer
Volume3631
ISSN (Print)0302-9743

Conference

Conference9th East European Conference on Advances in Databases and Information Systems, ADBIS 2005
Abbreviated titleADBIS
CountryEstonia
CityTallinn
Period12/09/0515/09/05

Keywords

  • EWI-7675
  • METIS-229541
  • IR-63612
  • DB-XMLDB: XML DATABASES

Fingerprint Dive into the research topics of 'Efficient XPath Evaluation'. Together they form a unique fingerprint.

Cite this