Intelligent database caching through the use of page-answers and page-traces

Kamel, Nabil; King, Robert B.

doi:10.1145/146931.146933

Cited by 9 publications

(3 citation statements)

References 28 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The ideas are applicable in conventional database systems also, but were not developed and explored in that context, or in the context of client-server architectures. The work of Kamel and King (1992) deals with intelligent database caching, but is meant for applications that have a predetermined set of queries requiring repetitive reevaluation, such as for integrity constraint checking.…”

Section: Related Workmentioning

confidence: 99%

A predicate-based caching scheme for client-server database architectures

Keller

Basu

1996

The VLDB Journal The International Journal on Very Large Data B

160

View full text Add to dashboard Cite

Abstract. We propose a new client-side data-caching scheme for relational databases with a central server and multiple clients. Data are loaded into each client cache based on queries executed on the central database at the server. These queries are used to form predicates that describe the cache contents. A subsequent query at the client may be satisfied in its local cache if we can determine that the query result is entirely contained in the cache. This issue is called cache completeness. A separate issue, cache currency, deals with the effect on client caches of updates committed at the central database. We examine the various performance tradeoffs and optimization issues involved in addressing the questions of cache currency and completeness using predicate descriptions and suggest solutions that promote good dynamic behavior. Lower query-response times, reduced message traffic, higher server throughput, and better scalability are some of the expected benefits of our approach over commonly used relational server-side and object ID-based or page-based client-side caching.

show abstract

Section: Related Workmentioning

confidence: 99%

A predicate-based caching scheme for client-server database architectures

Keller

Basu

1996

The VLDB Journal The International Journal on Very Large Data B

160

View full text Add to dashboard Cite

show abstract

“…The caches in the MF-agents can be constructed so that they perform the same functions as a Page-answer Database [10], which is derived from the server database. Each time a query is issued by its MH, it is first evaluated in the second cache in the MF-agent, then any remaining tuples are obtained from the server database.…”

Section: Hierarchical Mad Caching Consistencymentioning

confidence: 99%

A mobility-aware dynamic database caching scheme for wireless mobile computing and communications

Liu

Maguire

1996

Distrib Parallel Databases

View full text Add to dashboard Cite

This paper describes a mobility-aware dynamic database caching scheme for wireless mobile computing and communications. A mobile-floating agent scheme is proposed, in which caching techniques are cognizant of the mobile nature of mobile users and the location-sensitive nature of mobile systems. The mobile-floating agent maintains a second class cache in the fixed network and employs Barbara's "invalidation reports broadcasting" cache consistency strategies to maintain a dynamic cache consistent with the first class cache in the mobile client. The "invalidation reports broadcasting" scheme is combined with knowledge of the mobility behavior of each individual mobile user and broadcasts of invalidation reports only occur within the user's mobility area. The evaluation results show that, for a large system (200 cells), this scheme can reduce the system cost by more than 87%, for even highly mobile users, compared with a fully replicated database system.

show abstract

“…Compacting page-query databases: The page-query concept was first introduced in [7] and further developed in [8] for artificial intelligence applications using large main memories, and in [9] for secondary memory auxiliary databases. The current paper extends this work further by showing how to compact auxiliary databases organized as collections of arbitrarily overlapping page-queries and in the presence of updates.…”

Section: Related Workmentioning

confidence: 99%

Page-query compaction of secondary memory auxiliary databases

Kamel

1994

Distrib Parallel Databases

Self Cite

View full text Add to dashboard Cite

Prestoring redundant data in secondary memory auxiliary databases is an idea that can often yield improved retrieval performance through better clustering of related data. The clusters can be based on either whole query results or, as this paper indicates, on more specialized units called page-queries. The deliberate redundancy introduced by the designer is typically accompanied by much unnecessary redundancy among the elements of the auxiliary database. This paper presents algorithms for efficiently removing unwanted redundancy in auxiliary databases organized into page-query units. The algorithms presented here extend prior work done for secondary memory compaction in two respects: First, since it is generally not possible to remove all unwanted redundancies, the paper shows how can the compaction be done to remove the most undesirable redundancy from a system performance point-of-view. For example, among the factors considered in determining the worst redundancies are the update behavior and the effects of a particular compaction scheme on memory utilization. Second, unlike traditional approaches for database compaction which aim merely at reducing the storage space, this paper considers the paging characteristics in deciding on an optimal compaction scheme. This is done through the use of page-queries. Simulation results are presented and indicate that page-query compaction results in less storage requirements and more time savings than could be obtained by standard non-page-query compaction.

show abstract

Intelligent database caching through the use of page-answers and page-traces

Cited by 9 publications

References 28 publications

A predicate-based caching scheme for client-server database architectures

A predicate-based caching scheme for client-server database architectures

A mobility-aware dynamic database caching scheme for wireless mobile computing and communications

Page-query compaction of secondary memory auxiliary databases

Contact Info

Product

Resources

About