Skip to main navigation Skip to search Skip to main content

Bayesian network-based probabilistic XML keywords filtering

  • Shanghai Ocean University
  • Fudan University
  • Yunnan University

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

Abstract

Data uncertainty appears in many important XML applications. Recent probabilistic XML models represent different dependency correlations of sibling nodes by adding various kinds of distributional nodes, while there does not exist a uniform probability calculation method for different dependency correlations. Since Bayesian Networks can denote various dependency correlations among nodes just by conditional probability table(CPT), this paper proposes the Bayesian Networks based probabilistic XML model PrXML-BN, and combines SLCA semantic meaning of keyword query into Bayesian Networks, then implements keywords filtering on SLCA semantic meaning. To optimize the performance of keywords filtering, two optimization strategies are proposed in this paper. In the end, experiments verify the performance of keywords filtering algorithm based on SLCA in model PrXML-BN.

Original languageEnglish
Title of host publicationDatabase Systems for Advanced Applications - 17th International Conference, DASFAA 2012, International Workshops
Subtitle of host publicationFlashDB, ITEMS, SNSM, SIM3, DQDI, Proceedings
EditorsHwanjo Yu, Ge Yu, Wynne Hsu, Yang-Sae Moon, Rainer Unland, Jaesoo Yoo
PublisherSpringer Verlag
Pages274-285
Number of pages12
ISBN (Print)9783642290220
DOIs
StatePublished - 2012

Publication series

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

Keywords

  • Bayesian networks
  • Filtering
  • Probabilistic XML
  • SLCA

Fingerprint

Dive into the research topics of 'Bayesian network-based probabilistic XML keywords filtering'. Together they form a unique fingerprint.

Cite this