Scalable template-based query containment checking for web semantic caches

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 contai...

• Type: Conference
• Year: 2003
• Where: ICDE
• Authors: Khalil Amiri, Sanghyun Park, Renu Tewari, Sriram Padmanabhan
• Keywords: Containment Checking Algorithms, Database, Fast Query Containment, ICDE 2003, Query Containment Cost