Answering queries using views (extended abstract)
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Queries with incomplete answers over semistructured data
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Query rewriting for semistructured data
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
View-based query processing for regular path queries with inverse
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Handbook of Applied Cryptography
Handbook of Applied Cryptography
Understanding and Deploying LDAP Directory Services
Understanding and Deploying LDAP Directory Services
Logic-based techniques in data integration
Logic-based artificial intelligence
Proceedings of the 27th International Conference on Very Large Data Bases
Semantic Data Caching and Replacement
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Querying Heterogeneous Information Sources Using Source Descriptions
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Argos: Efficient Refresh in an XQL-Based Web Caching System
Selected papers from the Third International Workshop WebDB 2000 on The World Wide Web and Databases
Schemes of storing XML query cache
ADC '05 Proceedings of the 16th Australasian database conference - Volume 39
Processing XML path expressions using XML materialised views
BNCOD'03 Proceedings of the 20th British national conference on Databases
EDBT'06 Proceedings of the 2006 international conference on Current Trends in Database Technology
| Hi-index | 0.00 |
The problem of cache answerability has traditionally been studied over conjunctive queries performed on top of a relational database system. However, with the proliferation of semistructured data and, in particular, of XML as the de facto standard for information interchange on the Internet, most of the assumptions and methods used for traditional systems - and cache answerability is no exception - need to be revisited from the point of view of the semistructured data and query model. In this paper, we present a formal framework for the efficient processing of XPath queries over XML documents in a cache environment that is based on the classic rewriting approach. Furthermore, we provide details on the implementation of our formal methods on top of HLCACHES, an LDAP-based distributed caching system for XML, and argue that our approach is more efficient than traditional query rewriting algorithms while, at the same time, supporting the full expressive power of XPath queries.