Schema-driven evaluation of approximate tree-pattern queries
From MaRDI portal
Recommendations
- Validity of tree pattern queries with respect to schema information
- Optimizing Conjunctive Queries over Trees Using Schema Information
- A revised result on chasing tree patterns under schema graphs
- Query evaluation via tree-decompositions
- Query evaluation via tree-decompositions
- Conjunctive query containment over trees using schema information
Cited in
(14)- Tree pattern query minimization
- Using histograms to estimate answer sizes for XML queries.
- Search optimization in semistructured databases using hierarchy of document schemas
- Tree pattern relaxation
- Estimating answer sizes for XML queries
- The APPROXML tool demonstration
- XML reconstruction view selection in XML databases: complexity analysis and approximation scheme
- An approximate query algorithm based on eight-neighbor grid clustering for heterogeneous XML documents
- Approximation and Scoring for XML Data Management
- Efficient algorithm for XML query based sequence matching-SCALER+
- A survey on tree matching and XML retrieval
- An approximate querying environment for XML data
- scientific article; zbMATH DE number 2204016 (Why is no real title available?)
- Optimal schema hierarchies in searching semistructured databases by conjunctive regular path queries
This page was built for publication: Schema-driven evaluation of approximate tree-pattern queries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3044419)