Answering queries using views (extended abstract)
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Query containment for conjunctive queries with regular expressions
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Storing semistructured data with STORED
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
Query rewriting for semistructured data
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
Materialized views: techniques, implementations, and applications
Materialized views: techniques, implementations, and applications
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Representing and querying XML with incomplete information
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
XCache: a semantic caching system for XML queries
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Graph Structured Views and Their Incremental Maintenance
ICDE '98 Proceedings of the Fourteenth International Conference on Data Engineering
Incremental Maintenance for Materialized Views over Semistructured Data
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
Relational Databases for Querying XML Documents: Limitations and Opportunities
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Form-Based Proxy Caching for Database-Backed Web Sites
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
Query Decomposition and View Maintenance for Query Languages for Unstructured Data
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Efficient Cache Answerability for XPath Queries
Proceedings of the VLDB 2002 Workshop EEXTT and CAiSE 2002 Workshop DTWeb on Efficiency and Effectiveness of XML Tools and Techniques and Data Integration over the Web-Revised Papers
Active Query Caching for Database Web Servers
Selected papers from the Third International Workshop WebDB 2000 on The World Wide Web and Databases
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
Deferred incremental refresh of XML materialized views: algorithms and performance evaluation
ADC '03 Proceedings of the 14th Australasian database conference - Volume 17
Answering Regular Path Queries Using Views
ICDE '00 Proceedings of the 16th International Conference on Data Engineering
Aggregate Path Index for Incremental Web View Maintenance
WECWIS '00 Proceedings of the Second International Workshop on Advance Issues of E-Commerce and Web-Based Information Systems (WECWIS 2000)
Hi-index | 0.00 |
Recently, semantic caching for the database-backed web applications has received much attention. The results of frequent queries could be cached for repeated reuse or for efficient processing of the relevant queries. Since the emergence of XML as a standard for data exchange on the web, today's web applications are to retrieve information from the remote XML sources across the network, and thus, it is desirable to maintain the XML query results in the cache for the web applications. In this paper, we investigate the problem of processing an XML path expression, which is one of the core features of XML query languages, using the XML cache maintained as materialised views. Algorithms to rewrite the given XML path expression using its relevant materialised view are proposed. Also provided are the implementation details of how an XML path expression is processed with its relevant XML materialised view when a relational DBMS is employed for storing XML base documents as well as their materialised views. The preliminary experimental results show that our scheme is feasible and promising.