Template-Based Proxy Caching for Table-Valued Functions

Luo, Qiong; Xue, Wei

doi:10.1007/978-3-540-24571-1_31

Cited by 4 publications

(4 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Our use of templates matches well with modern database applications in which forms and prepared statements are used to interrogate a database [Amiri et al 2003;Luo and Xue 2004], resulting in queries within the same template. Scientific domains also include user-written queries.…”

Section: Introductionmentioning

confidence: 66%

See 1 more Smart Citation

Data management and query---Estimating query result sizes for proxy caching in scientific database federations

Malik

Burns

Chawla

et al. 2006

Proceedings of the 2006 ACM/IEEE Conference on Supercomputing - SC '06

View full text Add to dashboard Cite

In a proxy cache for federations of scientific databases it is important to estimate the size of a query before making a caching decision. With accurate estimates, near-optimal cache performance can be obtained. On the other extreme, inaccurate estimates can render the cache totally ineffective.We present classification and regression over templates (CAROT), a general method for estimating query result sizes, which is suited to the resource-limited environment of proxy caches and the distributed nature of database federations. CAROT estimates query result sizes by learning the distribution of query results, not by examining or sampling data, but from observing workload. We have integrated CAROT into the proxy cache of the National Virtual Observatory (NVO) federation of astronomy databases. Experiments conducted in the NVO show that CAROT dramatically outperforms conventional estimation techniques and provides near-optimal cache performance.

show abstract

Section: Introductionmentioning

confidence: 66%

“…This allows for fast template matching. Template detection builds upon existing query matching algorithms [Amiri et al 2003;Luo and Naughton 2001;Luo and Xue 2004].…”

Section: Template Detectionmentioning

confidence: 99%

Data management and query---Estimating query result sizes for proxy caching in scientific database federations

Malik

Burns

Chawla

et al. 2006

Proceedings of the 2006 ACM/IEEE Conference on Supercomputing - SC '06

View full text Add to dashboard Cite

show abstract

“…The same authors in [27] use a template-based approach to tackle the case of queries with embedded calls to user defined functions. The problem of caching OLAP results in a distributed environment is studied in [18].…”

Section: Related Workmentioning

confidence: 99%

Policies for Caching OLAP Queries in Internet Proxies

Loukopoulps

Ahmad

2006

IEEE Trans. Parallel Distrib. Syst.

View full text Add to dashboard Cite

The Internet now offers more than just simple information to the users. Decision makers can now issue analytical, as opposed to transactional, queries that involve massive data (such as, aggregations of millions of rows in a relational database) in order to identify useful trends and patterns. Such queries are often referred to as On-Line-Analytical Processing (OLAP). Typically, pages carrying query results do not exhibit temporal locality and, therefore, are not considered for caching at Internet proxies. In OLAP processing, this is a major problem as the cost of these queries is significantly larger than that of the transactional queries. This paper proposes a technique to reduce the response time for OLAP queries originating from geographically distributed private LANs and issued through the Web toward a central data warehouse (DW) of an enterprise. An active caching scheme is introduced that enables the LAN proxies to cache some parts of the data, together with the semantics of the DW, in order to process queries and construct the resulting pages. OLAP queries arriving at the proxy are either satisfied locally or from the DW, depending on the relative access costs. We formulate a cost model for characterizing the respective latencies, taking into consideration the combined effects of both common Web access and query processing. We propose a cache admittance and replacement algorithm that operates on a hybrid Web-OLAP input, outperforming both pure-Web and pure-OLAP caching schemes.

show abstract

“…The form-based proxy caching framework presented in this paper is an integration and extension of our previous work on form-based active proxy caching for keyword-based queries [27] and function-embedded queries [28]. In comparison with our previous work, we have added real-world query trace evaluation for keyword-based queries, and have significantly extended our active caching techniques for function-embedded queries and conducted more extensive performance evaluation for them.…”

Section: Related Workmentioning

confidence: 99%

Form-based proxy caching for database-backed web sites: keywords and functions

2006

Self Cite

View full text Add to dashboard Cite

Web caching proxy servers are essential for improving web performance and scalability, and recent research has focused on making proxy caching work for database-backed web sites. In this paper, we explore a new proxy caching framework that exploits the query semantics of HTML forms. We identify two common classes of form-based queries from real-world database-backed web sites, namely, keyword-based queries and function-embedded queries. Using typical examples of these queries, we study two representative caching schemes within our framework: (i) traditional passive query caching, and (ii) active query caching, in which the proxy cache can service a request by evaluating a query over the contents of the cache. Results from our experimental implementation show that our form-based proxy is a general and flexible approach that efficiently enables active caching schemes for database-backed web sites. Furthermore, handling query containment at the proxy yields significant performance advantages over passive query caching, but extending the power of the active cache to do full semantic caching appears to be less generally effective.

show abstract

Template-Based Proxy Caching for Table-Valued Functions

Cited by 4 publications

References 15 publications

Data management and query---Estimating query result sizes for proxy caching in scientific database federations

Data management and query---Estimating query result sizes for proxy caching in scientific database federations

Policies for Caching OLAP Queries in Internet Proxies

Form-based proxy caching for database-backed web sites: keywords and functions

Contact Info

Product

Resources

About