| M. Carey, M. Franklin, and M. Zaharioudakis. Fine-grained sharing in page server database systems. In Proc. ACM SIGMOD Conf. ACM, 1994. |
....2 P. Godfrey J. Gryz In distributed database environments, another layer of caching is possible: to cache information between servers and clients. Two caching approaches, page caching and tuple caching in which memory pages or tuples are cached, respectively, have been studied in this context [4, 10]. Semantic query caching (SQC) offers a third approach. In [4] it is shown that semantic caching may outperform the page and tuple caching due to semantic locality: subsequent queries often are related conceptually with previous queries, so ultimately will be pulling data from the same logical ....
....layer of caching is possible: to cache information between servers and clients. Two caching approaches, page caching and tuple caching in which memory pages or tuples are cached, respectively, have been studied in this context [4, 10] Semantic query caching (SQC) offers a third approach. In [4], it is shown that semantic caching may outperform the page and tuple caching due to semantic locality: subsequent queries often are related conceptually with previous queries, so ultimately will be pulling data from the same logical sources. Thus semantic caches will often contain some of the ....
M. Carey, M. Franklin, and M. Zaharioudakis. Fine-grained sharing in page server database system. In Proceedings of Sigmod, 1994.
....query is answerable from cache, no communication with the servers is necessary. If a query is only partially answerable from cache, the amount of data needed from the servers may be substantially reduced. 1 SQC provides an alternative approach to page caching and tuple caching architectures [3, 6], in which the unit of transfer between servers and clients is a page or a tuple, respectively. The key advantage of SQC over other approaches is its flexibility: it can be used to answer new queries which are semantically related to previous queries that were cached. 2 Tuple based and ....
M. Carey, M. Franklin, and M. Zaharioudakis. Fine-grained sharing in page server database system. In Proceedings of Sigmod, 1994.
....fetched data pages. In distributed database environments, another layer of caching is possible: to cache information between servers and clients. Two caching approaches, page caching and tuple caching in which memory pages or tuples are cached, respectively, have been studied in this context [5, 11]. Semantic query caching offers a third approach. In [5] it is shown that semantic caching may generally outperform the page and tuple caching approaches. This is due to semantic locality: subsequent queries often are related conceptually with previous queries, so ultimately will be pulling data ....
....another layer of caching is possible: to cache information between servers and clients. Two caching approaches, page caching and tuple caching in which memory pages or tuples are cached, respectively, have been studied in this context [5, 11] Semantic query caching offers a third approach. In [5], it is shown that semantic caching may generally outperform the page and tuple caching approaches. This is due to semantic locality: subsequent queries often are related conceptually with previous queries, so ultimately will be pulling data from the same logical sources. Thus, semantic caches ....
M. Carey, M. Franklin, and M. Zaharioudakis. Fine-grained sharing in page server database system. In Proceedings of Sigmod, 1994.
....current query is answerable from cache, no communication with the servers is necessary. If a query is only partially answerable from cache, the amount of data needed from the servers may be substantially reduced. SQC provides an alternative approach to page caching and tuplecaching architectures [2, 7], in which the unit of transfer between servers and clients is a page or a tuple, respectively. The key advantage of SQC over other approaches is flexibility: it can be used to answer new queries which are semantically related to previous queries that were cached. 1 Tuple based and page based ....
M. Carey, M. Franklin, and M. Zaharioudakis. Fine-grained sharing in page server database system. In Proceedings of Sigmod, 1994.
....query is answerable from cache, no communication with the servers is necessary. If a query is only partially answerable from cache, the amount of data needed from the servers may be substantially reduced. 1 SQC provides an alternative approach to page caching and tuple caching architectures [3, 6], in which the unit of transfer between servers and clients is a page or a tuple, respectively. The key advantage of SQC over other approaches is its flexibility: it can be used to answer new queries which are semantically related to previous queries that were cached. 2 Tuple based and ....
M. Carey, M. Franklin, and M. Zaharioudakis. Fine-grained sharing in page server database system. In Proceedings of Sigmod, 1994.
....of the architectures: 1) data granularity, 2) remainder queries vs. faulting, and (3) cache replacement policy. We address these factors briefly below. 2.1.1 Data Granularity In any system that uses data shipping, the granularity of data management is a key performance concern. As described in [CFZ94, Fra96], the granularity decisions that must be made include: 1) client server transfer, 2) consistency maintenance, and (3) cache management. In this study (in contrast to [DFMV90] all architectures ship data in page sized units. Also, we examine the architectures in the context of read only ....
....locality. Semantic locality differs from spatial locality in that it is not dependent on the static clustering of tuples to pages; rather it dynamically adapts to the pattern of query accesses. 2. 2 Page Caching Architecture In page caching architectures (also referred to as pageserver systems [DFMV90, CFZ94]) the unit of transfer between servers and clients is a page. Queries are posed at clients, and processed locally down to the level of requests for individual pages. If a requested page is not present in the local cache, a request for the page is sent to the server. In response to such a request, ....
M. Carey, M. Franklin, M. Zaharioudakis, Fine-grained sharing in page server database systems, Proc. ACM SIGMOD Conf., 1994.
No context found.
M. Carey, M. Franklin, and M. Zaharioudakis. Fine-grained sharing in page server database systems. In Proc. ACM SIGMOD Conf. ACM, 1994.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC