Scalable template-based query containment checking for web semantic caches

Khalil Amiri, Sang Hyun Park, Renu Tewari, Sriram Padmanabhan

Research output: Contribution to conferencePaper

24 Citations (Scopus)

Abstract

Semantic caches, originally proposed for client-server database systems, are being recently deployed to accelerate the serving of dynamic web content by transparently caching data on edge servers. Such caches require fast query containment tests to determine if a new query is contained in the results of cached queries. Query containment checking algorithms have been studied in the context of query optimization and materialized view selection, but their scalability remains a serious limitation. We argue that application queries are usually instantiations of a smaller number of base templates and show how this can be exploited to scale up containment checking. Our contributions include (i) algorithms to detect similarity between query predicates; (ii) efficient algorithms for proving containment among similar query predicates; (iii) a technique to dynamically aggregate similar queries in the cache to support efficient search; and (iv) integration of these schemes into a two-level containment checker. We describe our approach, report on its implementation in a dynamic web data cache, and show that it can reduce query containment cost by an order of magnitude for web workloads.

Original languageEnglish
Pages493-504
Number of pages12
DOIs
Publication statusPublished - 2003 Dec 1
EventNineteenth International Conference on Data Ingineering - Bangalore, India
Duration: 2003 Mar 52003 Mar 8

Other

OtherNineteenth International Conference on Data Ingineering
CountryIndia
CityBangalore
Period03/3/503/3/8

Fingerprint

Semantic Web
Servers
Scalability
Semantics
Costs

All Science Journal Classification (ASJC) codes

  • Software
  • Signal Processing
  • Information Systems

Cite this

Amiri, K., Park, S. H., Tewari, R., & Padmanabhan, S. (2003). Scalable template-based query containment checking for web semantic caches. 493-504. Paper presented at Nineteenth International Conference on Data Ingineering, Bangalore, India. https://doi.org/10.1109/ICDE.2003.1260816
Amiri, Khalil ; Park, Sang Hyun ; Tewari, Renu ; Padmanabhan, Sriram. / Scalable template-based query containment checking for web semantic caches. Paper presented at Nineteenth International Conference on Data Ingineering, Bangalore, India.12 p.
@conference{c65e5f5d3fcd460ca4a67ae954c9f0ac,
title = "Scalable template-based query containment checking for web semantic caches",
abstract = "Semantic caches, originally proposed for client-server database systems, are being recently deployed to accelerate the serving of dynamic web content by transparently caching data on edge servers. Such caches require fast query containment tests to determine if a new query is contained in the results of cached queries. Query containment checking algorithms have been studied in the context of query optimization and materialized view selection, but their scalability remains a serious limitation. We argue that application queries are usually instantiations of a smaller number of base templates and show how this can be exploited to scale up containment checking. Our contributions include (i) algorithms to detect similarity between query predicates; (ii) efficient algorithms for proving containment among similar query predicates; (iii) a technique to dynamically aggregate similar queries in the cache to support efficient search; and (iv) integration of these schemes into a two-level containment checker. We describe our approach, report on its implementation in a dynamic web data cache, and show that it can reduce query containment cost by an order of magnitude for web workloads.",
author = "Khalil Amiri and Park, {Sang Hyun} and Renu Tewari and Sriram Padmanabhan",
year = "2003",
month = "12",
day = "1",
doi = "10.1109/ICDE.2003.1260816",
language = "English",
pages = "493--504",
note = "Nineteenth International Conference on Data Ingineering ; Conference date: 05-03-2003 Through 08-03-2003",

}

Amiri, K, Park, SH, Tewari, R & Padmanabhan, S 2003, 'Scalable template-based query containment checking for web semantic caches' Paper presented at Nineteenth International Conference on Data Ingineering, Bangalore, India, 03/3/5 - 03/3/8, pp. 493-504. https://doi.org/10.1109/ICDE.2003.1260816

Scalable template-based query containment checking for web semantic caches. / Amiri, Khalil; Park, Sang Hyun; Tewari, Renu; Padmanabhan, Sriram.

2003. 493-504 Paper presented at Nineteenth International Conference on Data Ingineering, Bangalore, India.

Research output: Contribution to conferencePaper

TY - CONF

T1 - Scalable template-based query containment checking for web semantic caches

AU - Amiri, Khalil

AU - Park, Sang Hyun

AU - Tewari, Renu

AU - Padmanabhan, Sriram

PY - 2003/12/1

Y1 - 2003/12/1

N2 - Semantic caches, originally proposed for client-server database systems, are being recently deployed to accelerate the serving of dynamic web content by transparently caching data on edge servers. Such caches require fast query containment tests to determine if a new query is contained in the results of cached queries. Query containment checking algorithms have been studied in the context of query optimization and materialized view selection, but their scalability remains a serious limitation. We argue that application queries are usually instantiations of a smaller number of base templates and show how this can be exploited to scale up containment checking. Our contributions include (i) algorithms to detect similarity between query predicates; (ii) efficient algorithms for proving containment among similar query predicates; (iii) a technique to dynamically aggregate similar queries in the cache to support efficient search; and (iv) integration of these schemes into a two-level containment checker. We describe our approach, report on its implementation in a dynamic web data cache, and show that it can reduce query containment cost by an order of magnitude for web workloads.

AB - Semantic caches, originally proposed for client-server database systems, are being recently deployed to accelerate the serving of dynamic web content by transparently caching data on edge servers. Such caches require fast query containment tests to determine if a new query is contained in the results of cached queries. Query containment checking algorithms have been studied in the context of query optimization and materialized view selection, but their scalability remains a serious limitation. We argue that application queries are usually instantiations of a smaller number of base templates and show how this can be exploited to scale up containment checking. Our contributions include (i) algorithms to detect similarity between query predicates; (ii) efficient algorithms for proving containment among similar query predicates; (iii) a technique to dynamically aggregate similar queries in the cache to support efficient search; and (iv) integration of these schemes into a two-level containment checker. We describe our approach, report on its implementation in a dynamic web data cache, and show that it can reduce query containment cost by an order of magnitude for web workloads.

UR - http://www.scopus.com/inward/record.url?scp=0344065564&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0344065564&partnerID=8YFLogxK

U2 - 10.1109/ICDE.2003.1260816

DO - 10.1109/ICDE.2003.1260816

M3 - Paper

AN - SCOPUS:0344065564

SP - 493

EP - 504

ER -

Amiri K, Park SH, Tewari R, Padmanabhan S. Scalable template-based query containment checking for web semantic caches. 2003. Paper presented at Nineteenth International Conference on Data Ingineering, Bangalore, India. https://doi.org/10.1109/ICDE.2003.1260816