We study the problem of answering queries over sources with limited access patterns. Given a first-order query Q, the problem is to decide whether there is an equivalent query whi...
We study the problem of answering queries over sources with limited access patterns. The problem is to decide whether a given query Q is feasible, i.e., equivalent to an executable...
A pattern is a finite string of constant and variable symbols. The erasing language generated by a pattern p is the set of all strings that can be obtained by substituting (possib...
Existing xml query pattern-based caching strategies focus on extracting the set of frequently issued query pattern trees (qpt) based on the support of the qpts in the history. Thes...
Recently, several approaches that mine frequent XML query patterns and cache their results have been proposed to improve query response time. However, frequent XML query patterns m...
Ling Chen 0002, Sourav S. Bhowmick, Liang-Tien Chi...