World Wide Web Journal - Special issue on XML: principles, tools, and techniques
Typechecking for XML transformers
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Expressive and efficient pattern languages for tree-structured data (extended abstract)
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Extended path expressions of XML
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Minimization of tree pattern queries
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Containment for XPath Fragments under DTD Constraints
ICDT '03 Proceedings of the 9th International Conference on Database Theory
Structural Properties of XPath Fragments
ICDT '03 Proceedings of the 9th International Conference on Database Theory
EDBT '02 Proceedings of the Worshops XMLDM, MDDE, and YRWS on XML-Based Data Management and Multimedia Engineering-Revised Papers
DBPL '01 Revised Papers from the 8th International Workshop on Database Programming Languages
XPath Containment in the Presence of Disjunction, DTDs, and Variables
ICDT '03 Proceedings of the 9th International Conference on Database Theory
Containment and equivalence for a fragment of XPath
Journal of the ACM (JACM)
Tree logical classes for efficient evaluation of XQuery
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Secure XML querying with security views
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Frontiers of tractability for typechecking simple XML transformations
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Efficient algorithms for processing XPath queries
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
On testing satisfiability of tree pattern queries
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Information preserving XML schema embedding
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Two-variable logic on data trees and XML reasoning
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Structural characterizations of the semantics of XPath as navigation tool on a document
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Inference of concise DTDs from XML data
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Comparing XML path expressions
Proceedings of the 2006 ACM symposium on Document engineering
A system for the static analysis of XPath
ACM Transactions on Information Systems (TOIS)
Frontiers of tractability for typechecking simple XML transformations
Journal of Computer and System Sciences
Testing XML constraint satisfiability
Electronic Notes in Theoretical Computer Science (ENTCS)
Efficient static analysis of XML paths and types
Proceedings of the 2007 ACM SIGPLAN conference on Programming language design and implementation
Static validation of XSL transformations
ACM Transactions on Programming Languages and Systems (TOPLAS)
The complexity of query containment in expressive fragments of XPath 2.0
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Deciding XPath containment with MSO
Data & Knowledge Engineering
Static analysis of XML processing with data values
ACM SIGMOD Record
Filtering unsatisfiable XPath queries
Data & Knowledge Engineering
Inferring XML schema definitions from XML data
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Information preserving XML schema embedding
ACM Transactions on Database Systems (TODS)
XPath satisfiability in the presence of DTDs
Journal of the ACM (JACM)
Data & Knowledge Engineering
Learning deterministic regular expressions for the inference of schemas from XML data
Proceedings of the 17th international conference on World Wide Web
Static analysis of active XML systems
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
XPath, transitive closure logic, and nested tree walking automata
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Structural summaries for efficient XML query processing
Ph.D. '08 Proceedings of the 2008 EDBT Ph.D. workshop
XML fragment caching for large-scale mobile commerce applications
Proceedings of the 10th international conference on Electronic commerce
Output schemas of XSLT stylesheets and their applications
Information Sciences: an International Journal
Complexity of Data Tree Patterns over XML Documents
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Generating XML structure using examples and constraints
Proceedings of the VLDB Endowment
ACM Computing Surveys (CSUR)
Reasoning about XML with Temporal Logics and Automata
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Two-variable logic on data trees and XML reasoning
Journal of the ACM (JACM)
An X-ray on web-available XML schemas
ACM SIGMOD Record
Satisfiability and relevance for queries over active documents
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Segmentation-Based Caching for Mobile Auctions
Proceedings of the 2008 conference on Techniques and Applications for Mobile Commerce: Proceedings of TAMoCo 2008
Identifying query incompatibilities with evolving XML schemas
Proceedings of the 14th ACM SIGPLAN international conference on Functional programming
A Tractable Subclass of DTDs for XPath Satisfiability with Sibling Axes
DBPL '09 Proceedings of the 12th International Symposium on Database Programming Languages
Satisfiability of simple xpath fragments in the presence of dtds
Proceedings of the eleventh international workshop on Web information and data management
Transitive closure logic, nested tree walking automata, and XPath
Journal of the ACM (JACM)
The view update problem for XML
Proceedings of the 2010 EDBT/ICDT Workshops
Efficient and expressive tree filters
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Xml publishing: bridging theory and practice
DBPL'07 Proceedings of the 11th international conference on Database programming languages
A decision procedure for XPath satisfiability in the presence of DTD containing choice
APWeb'08 Proceedings of the 10th Asia-Pacific web conference on Progress in WWW research and development
Semantic-driven multimedia retrieval with the MPEG Query Format
Multimedia Tools and Applications
Learning Deterministic Regular Expressions for the Inference of Schemas from XML Data
ACM Transactions on the Web (TWEB)
CSC: supporting queries on compressed cached XML
ADC '09 Proceedings of the Twentieth Australasian Conference on Australasian Database - Volume 92
Satisfiability and containment problem of structural recursions with conditions
ADBIS'10 Proceedings of the 14th east European conference on Advances in databases and information systems
Extending the tractability results on XPath satisfiability with sibling axes
XSym'10 Proceedings of the 7th international XML database conference on Database and XML technologies
Destabilizers and independence of XML updates
Proceedings of the VLDB Endowment
Inconsistent path detection for XML IDEs
Proceedings of the 33rd International Conference on Software Engineering
Impact of XML Schema Evolution
ACM Transactions on Internet Technology (TOIT)
On equivalence and rewriting of XPath queries using views under DTD constraints
DEXA'11 Proceedings of the 22nd international conference on Database and expert systems applications - Volume Part II
Characterization of the interaction of XML functional dependencies with DTDs
ICDT'07 Proceedings of the 11th international conference on Database Theory
Optimizing schema languages for XML: numerical constraints and interleaving
ICDT'07 Proceedings of the 11th international conference on Database Theory
Satisfiability of XPath queries with sibling axes
DBPL'05 Proceedings of the 10th international conference on Database Programming Languages
Automata and logics for words and trees over an infinite alphabet
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
A prototype of a schema-based XPath satisfiability tester
DEXA'06 Proceedings of the 17th international conference on Database and Expert Systems Applications
ADBIS'06 Proceedings of the 10th East European conference on Advances in Databases and Information Systems
Validity-sensitive querying of XML databases
EDBT'06 Proceedings of the 2006 international conference on Current Trends in Database Technology
Count-Constraints for generating XML
NGITS'06 Proceedings of the 6th international conference on Next Generation Information Technologies and Systems
Learning twig and path queries
Proceedings of the 15th International Conference on Database Theory
XPath satisfiability with downward and sibling axes is tractable under most of real-world DTDs
Proceedings of the twelfth international workshop on Web information and data management
XPath query satisfiability is in PTIME for real-world DTDs
XSym'07 Proceedings of the 5th international conference on Database and XML Technologies
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Hi-index | 0.00 |
We study the satisfiability problem associated with XPath in the presence of DTDs. This is the problem of determining, given a query p in an XPath fragment and a DTD D, whether or not there exists an XML document T such that T conforms to D and the answer of p on T is nonempty. We consider a variety of XPath fragments widely used in practice, and investigate the impact of different XPath operators on satisfiability analysis. We first study the problem for negation-free XPath fragments with and without upward axes, recursion and data-value joins, identifying which factors lead to tractability and which to NP-completeness. We then turn to fragments with negation but without data values, establishing lower and upper bounds in the absence and in the presence of upward modalities and recursion. We show that with negation the complexity ranges from PSPACE to EXPTIME. Moreover, when both data values and negation are in place, we find that the complexity ranges from NEXPTIME to undecidable. Finally, we give a finer analysis of the problem for particular classes of DTDs, exploring the impact of various DTD constructs, identifying tractable cases, as well as providing the complexity in the query size alone.