Answering queries using limited external query processors
Journal of Computer and System Sciences
A Query Translation Scheme for Rapid Implementation of Wrappers
DOOD '95 Proceedings of the Fourth International Conference on Deductive and Object-Oriented Databases
Tree pattern query minimization
The VLDB Journal — The International Journal on Very Large Data Bases
Containment and equivalence for a fragment of XPath
Journal of the ACM (JACM)
A Tree-Structured Query Interface for Querying Semi-Structured Data
SSDBM '04 Proceedings of the 16th International Conference on Scientific and Statistical Database Management
Secure XML querying with security views
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Rewriting XPath queries using materialized views
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Query caching and view selection for XML databases
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Structural properties of XPath fragments
Theoretical Computer Science - Database theory
A framework for using materialized XPath views in XML query processing
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Structured materialized views for XML queries
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Querying data sources that export infinite sets of views
Proceedings of the 12th International Conference on Database Theory
Multiple Materialized View Selection for XPath Query Rewriting
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
Efficient evaluation of query rewriting plan over materialized XML view
Journal of Systems and Software
Querying XML data sources that export very large sets of views
ACM Transactions on Database Systems (TODS)
Answering tree pattern queries using views: a revisit
Proceedings of the 14th International Conference on Extending Database Technology
On maximal contained rewriting of tree pattern queries using views
WISE'10 Proceedings of the 11th international conference on Web information systems engineering
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
Union rewritings for XPath fragments
Proceedings of the 15th Symposium on International Database Engineering & Applications
Communications of the ACM
Revisiting answering tree pattern queries using views
ACM Transactions on Database Systems (TODS)
Answering queries using views over probabilistic XML: complexity and tractability
Proceedings of the VLDB Endowment
Optimizing XML queries: Bitmapped materialized views vs. indexes
Information Systems
| Hi-index | 0.02 |
We study the problem of querying XML data sources that accept only a limited set of queries, such as sources accessible by Web services which can implement very large (potentially infinite) families of XPath queries. To compactly specify such families of queries we adopt the Query Set Specifications [14], a formalism close to context-free grammars. We say that query Q is expressible by the specification P if it is equivalent to some expansion of P. Q is supported by P if it has an equivalent rewriting using some finite set of P's expansions. We study the complexity of expressibility and support and identify large classes of XPath queries for which there are efficient (PTIME) algorithms. Our study considers both the case in which the XML nodes in the results of the queries lose their original identity and the one in which the source exposes persistent node ids.