Answering queries using views (extended abstract)
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Answering queries using templates with binding patterns (extended abstract)
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Answering recursive queries using views
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Rewriting aggregate queries using views
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Rewriting of regular expressions and regular path queries
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
A Scalable Algorithm for Answering Queries Using Views
VLDB '00 Proceedings of the 26th 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
Describing and Using Query Capabilities of Heterogeneous Sources
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
| Hi-index | 0.00 |
As XML emerge information representation and exchanging standard on the Web, XML turns into primary choice in many E-commercial applications. In web application, XML query receives much more attention. Unlike traditional web search, XML query directly returns needed information, and its engine caches query results rather than physical web pages. Such query is also called Content-Oriented Web query. In the XML query engine, it is more difficult to utilize the cached material to answer the user query than traditional web search engine because the former could be reduced to the answering semi-structured query using views, which is essentially an NP problem. Traditional algorithms take exponential time in the size of query and views, in addition, they takes no information generated in some special application into account. In the paper, a novel method was proposed under XML query engine environment, which makes use of the information that could be obtained in XML query engine as heuristic knowledge to prune the exponential query rewriting plan space. Theoretical analysis shows that the algorithm is polynomial time complexity in the size of query and view definition. The primary result of our prototype--COMMIX shows that the algorithm is valid and efficient.