A Decomposition-Based Probabilistic Framework for Estimating the Selectivity of XML Twig Queries

No abstract is available for this paper.

• Publication year

  2006

• Venue

  International Conference on Extending Database Technology

• Publication date

  2006-03-26

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1007/11687238_33
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Approximate XML query answers

  2004influential reference
• Bloom Histogram: Path Selectivity Estimation for XML Data with Updates

  2004cited by this paper
• Selectivity estimation for XML twigs

  2004influential reference
• Containment join size estimation: models and methods

  2003cited by this paper
• XPathLearner: An On-line Self-Tuning Markov Histogram for XML Path Selectivity Estimation

  2002influential reference
• Estimating Answer Sizes for XML Queries

  2002cited by this paper
• Advances in Database Technology — EDBT 2002

  2002cited by this paper
• Storing and querying ordered XML using a relational database system

  2002cited by this paper
• Statistical synopses for graph-structured XML databases

  2002cited by this paper
• Efficiently mining frequent trees in a forest

  2002cited by this paper
• Structure and Value Synopses for XML Data Graphs

  2002influential reference
• StatiX: making XML count

  2002cited by this paper
• Counting twig matches in a tree

  2001influential reference
• Efficient Substructure Discovery from Large Semi-Structured Data

  2001cited by this paper
• Estimating the Selectivity of XML Path Expressions for Internet Scale Applications

  2001cited by this paper
• Selectively estimation for Boolean queries

  2000cited by this paper
• Multi-Dimensional Substring Selectivity Estimation

  1999cited by this paper
• Query Optimization for XML

  1999cited by this paper
• Substring selectivity estimation

  1999cited by this paper
• Estimating alphanumeric selectivity in the presence of wildcards

  1996cited by this paper

• QuickSel: Quick Selectivity Learning with Mixture Models

  2018cites this paper
• XHQE: A hybrid system for scalable selectivity estimation of XML queries

  2015cites this paper
• Scaling Hop-Based Reachability Indexing for Fast Graph Pattern Query Processing

  2014cites this paper
• NON -CENTRALIZED DISTINCT L-DIVERSITY

  2012cites this paper
• Graph summaries for optimizing graph pattern queries on RDF databases

  2009influential citation
• Holistically Twig Matching in Probabilistic XML

  2009cites this paper
• Graph Summaries for Subgraph Frequency Estimation

  2008influential citation
• Exploiting non-redundant local patterns and probabilistic models for analyzing structured and semi-structured data

  2008cites this paper
• TRIPS and TIDES: new algorithms for tree mining

  2006cites this paper