Skip to main navigation Skip to search Skip to main content

Caching frequent XML query patterns

  • Xin Zhan*
  • , Jianzhong Li
  • , Hongzhi Wang
  • , Zhenying He
  • *Corresponding author for this work

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

Abstract

As XML becomes prevailing on the Internet, efficient management of XML queries becomes more important. Caching frequent queries can expedite XML query processing. In this paper, we propose a framework to address an NP-hard optimization problem, caching frequent query patterns. We develop several algorithms to respectively generate query subpatterns, check query containment, and choose query subpatterns for caching. Experimental results show that our algorithms are efficient and scalable.

Original languageEnglish
Title of host publicationAdvanced Web and Network Technologies, and Applications - APWeb 2006 International Workshops
Subtitle of host publicationXRA, IWSN, MEGA, and ICSE, Proceedings
Pages68-75
Number of pages8
DOIs
StatePublished - 2006
EventAPWeb 2006 International Workshops: XRA, IWSN, MEGA, and ICSE - Harbin, China
Duration: 16 Jan 200618 Jan 2006

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3842 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

ConferenceAPWeb 2006 International Workshops: XRA, IWSN, MEGA, and ICSE
Country/TerritoryChina
CityHarbin
Period16/01/0618/01/06

Fingerprint

Dive into the research topics of 'Caching frequent XML query patterns'. Together they form a unique fingerprint.

Cite this