ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
advertisementadvertisement
Data & Knowledge Engineering
Volume 64, Issue 1, January 2008, Pages 134-169
Fourth International Conference on Business Process Management (BPM 2006) - Four selected and extended papers; 8th International Conference on Enterprise Information Systems (ICEIS' 2006) - Three selected and extended papers
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Article
Purchase PDF (1974 K)

  E-mail Article   
  Add to my Quick Links   
Bookmark and share in 2collab (opens in new window)
Request permission to reuse this article
  Cited By in Scopus (0)
 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/j.datak.2007.06.018    How to Cite or Link Using DOI (Opens New Window)
Copyright © 2007 Elsevier B.V. All rights reserved.

Filtering unsatisfiable XPath queries

Jinghua Groppea, E-mail The Corresponding Author and Sven GroppeCorresponding Author Contact Information, a, E-mail The Corresponding Author

aUniversity of Lübeck, Institute of Information Systems (IFIS), Ratzeburger Allee 160, D-23538 Lübeck, Germany

Received 22 June 2007; 
accepted 22 June 2007. 
Available online 22 August 2007.

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

Abstract

The satisfiability test checks, whether or not the evaluation of a query returns the empty set for any input document, and can be used in query optimization for avoiding the submission and the computation of unsatisfiable queries. Thus, applying the satisfiability test before executing a query can save processing time and query costs. We focus on the satisfiability problem for queries formulated in the XML query language XPath, and 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 any valid XML document. Thus, the XPath query is unsatisfiable. We present a complexity analysis of our approach, which proves that our approach is efficient for typical cases. We present an experimental analysis of our developed prototype, which shows the optimization potential of avoiding the evaluation of unsatisfiable queries.

Keywords: Queries; XML; XPath; Satisfiability tester; Query optimization

Article Outline

1. Introduction
2. XPath and XML Schema
2.1. XPath
2.2. XML Schema
3. Data model for the XML Schema language
3.1. Notations
3.2. Concepts
3.3. Functions
4. XPath–XSchema evaluator
4.1. Schema paths
4.2. Evaluating XPath expressions
4.3. Evaluating axis and node-test
4.4. Evaluating predicates
4.5. Integrating data type checking
4.6. Integrating occurrence constraints checking
4.7. Complexity analysis
5. Satisfiability tester
6. Performance analysis
6.1. Test system and data
6.2. Filtering queries with incorrect semantics or structure
6.3. Filtering queries not conforming to data-types or occurrence constraints
6.4. Measuring the overhead of evaluating satisfiable queries
7. Further related work
8. Summary and conclusions
Appendix A. Benchmark.xsd
References
Vitae





























Data & Knowledge Engineering
Volume 64, Issue 1, January 2008, Pages 134-169
Fourth International Conference on Business Process Management (BPM 2006) - Four selected and extended papers; 8th International Conference on Enterprise Information Systems (ICEIS' 2006) - Three selected and extended papers
 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.