The structure of typed programming languages
The structure of typed programming languages
EDBT '02 Proceedings of the Worshops XMLDM, MDDE, and YRWS on XML-Based Data Management and Multimedia Engineering-Revised Papers
XPath satisfiability in the presence of DTDs
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
XPath Query Simplification with regard to the Elimination of Intersect and Except Operators
ICDEW '06 Proceedings of the 22nd International Conference on Data Engineering Workshops
On testing satisfiability of tree pattern queries
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Data & Knowledge Engineering
Output schemas of XSLT stylesheets and their applications
Information Sciences: an International Journal
Using semantics for XPath query transformation
International Journal of Web and Grid Services
A utilization of schema constraints to transform predicates in XPath query
DEXA'10 Proceedings of the 21st international conference on Database and expert systems applications: Part I
Semantic transformation approach with schema constraints for XPath query axes
WISE'10 Proceedings of the 11th international conference on Web information systems engineering
ADBIS'06 Proceedings of the 10th East European conference on Advances in Databases and Information Systems
| Hi-index | 0.00 |
The satisfiability test of queries can be used in query optimization for avoiding submission and computation of unsatisfiable queries. Thus, applying the satisfiability test before executing a query can save evaluation time and transportation costs in distributed scenarios. Therefore, we propose a schema-based approach to the satisfiability test of XPath queries, which checks whether or not an XPath query conforms to the constraints in a given schema. If an XPath query does not conform to the constraints given in the schema, the evaluation of the query will return an empty result for every XML document. Thus, the XPath query is unsatisfiable. We present a complexity analysis of our approach, which proves that our approach is efficient at typical cases. We present an experimental analysis of our developed prototype, which shows the optimization potential of avoiding the evaluation of unsatisfiable queries.