Using user access patterns for semantic query caching

In this paper, we propose a solution that partly solves the selection and replacement problems for semantic query caching. We believe that the queries submitted by a client are not random. They have certain meaning and may follow certain rules. We use user access graphs to represent the query execution orders and propose algorithms that use such information for semantic query caching. Unlike the previous approaches, ours anticipates incoming queries based on the queries that have been submitted, analyzes the semantic relationship between them, and rewrites and caches the current query to answer multiple queries. Our initial experimental result shows that our solution improves cache performance. © Springer-Verlag Berlin Heidelberg 2003.