Sequentiality and prefetching in database systems

@article{Smith1978SequentialityAP,
  title={Sequentiality and prefetching in database systems},
  author={A. Smith},
  journal={ACM Trans. Database Syst.},
  year={1978},
  volume={3},
  pages={223-247}
}
  • A. Smith
  • Published 1978
  • Computer Science
  • ACM Trans. Database Syst.
Sequentiality of access is an inherent characteristic of many database systems. We use this observation to develop an algorithm which selectively prefetches data blocks ahead of the point of reference. The number of blocks prefetched is chosen by using the empirical run length distribution and conditioning on the observed number of sequential block references immediately preceding reference to the current block. The optimal number of blocks to prefetch is estimated as a function of a number of… Expand
Prefetching in File Systems for MIMD Multiprocessors
  • D. Kotz, C. Ellis
  • Computer Science
  • IEEE Trans. Parallel Distributed Syst.
  • 1990
TLDR
The hit ratio may not be an adequate measure of performance when the workload consists of parallel computations and parallel file access patterns, but caching with prefetching can significantly improve the hit ratio and the average time to perform an I/O (input/output) operation. Expand
A Prefetching Scheme Exploiting both Data Layout and Access History on Disk
TLDR
The technique, called DiskSeen, is intended to be supplementary to, and to work synergistically with, any present file-level prefetch policies, and seeks to improve the sequentiality of disk accesses and overall prefetching performance. Expand
Disk caching in large database and timeshared systems
  • B. Zivkov, A. Smith
  • Computer Science
  • Proceedings Fifth International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems
  • 1997
TLDR
It is found that for this workload, sequential prefetching produces a significant but still limited improvement in the miss ratio, even using a powerful technique for detecting sequentiality, which is unique in the variety and quality of the data used. Expand
ASEP: An Adaptive Sequential Prefetching Scheme for Second-level Storage System
TLDR
An Adaptive SEquential Prefetching (named ASEP) is proposed that uncovers this anomaly influence and adaptively adjusts the prefetching depth by considering the access characteristics in second-level buffer cache. Expand
CPU Cache Prefetching: Timing Evaluation of Hardware Implementations
TLDR
This paper presents extensive quantitative results of a detailed cycle-by-cycle trace-driven simulation of a uniprocessor memory system in which most of the relevant parameters are varied in order to determine when and if hardware prefetching is useful. Expand
Data Prefetching based on Sequential Stream Recognition
    This paper presents a cache prefetching algorithm for mid-size and large storage systems. A storage system sees physical block addresses of the submitted I/O requests but has no knowledge of theExpand
    Caching in Large Databases and Timeshared Systems 1 Disk Caching in Large Databases and Timeshared Systems 1
    We present the results of a variety of trace-driven simulations of disk cache design. Our traces come from a variety of mainframe timesharing and database systems in production use. We compute missExpand
    Informed prefetching and caching
    TLDR
    This paper shows how to use application-disclosed access patterns (hints) to expose and exploit I/O parallelism and to allocate dynamically file buffers among three competing demands: prefetching hinted blocks, caching hinted blocks for reuse, and caching recently used data for unhinted accesses. Expand
    Cache management for shared sequential data access
    TLDR
    This paper presents a new set of cache management algorithms for shared data objects that are accessed sequentially, and presents a simple job scheduling strategy that increases locality of reference between jobs. Expand
    DiskSeen: Exploiting Disk Layout and Access History to Enhance I/O Prefetch
    TLDR
    The implementation of the DiskSeen scheme in the Linux 2.6 kernel shows that it can significantly improve the effectiveness of prefetching, reducing execution times by 20%-53% for micro-benchmarks and real applications such as grep, CVS, and TPC-H. Expand
    ...
    1
    2
    3
    4
    5
    ...

    References

    SHOWING 1-10 OF 51 REFERENCES
    Evaluation Techniques for Storage Hierarchies
    TLDR
    A new and efficient method of determining, in one pass of an address trace, performance measures for a large class of demand-paged, multilevel storage systems utilizing a variety of mapping schemes and replacement algorithms. Expand
    A model for masking rotational latency by dynamic disk allocation
    TLDR
    The background and algorithms for masking the rotational latency of a disk or drum are presented and it is shown that latency may be masked using a small amount of buffer memory. Expand
    Empirical Data Reference Behavior in Data Base Systems
    TLDR
    With very few exceptions the reference strings that have been measured characterize virtual memory utilization, reflecting the fact that the motivating force behind these research activities is the desire to understand the behavior of virtual memory paging systems. Expand
    An Analysis of Buffer Paging in Virtual Storage Systems
    • W. Tuel
    • Computer Science
    • IBM J. Res. Dev.
    • 1976
    TLDR
    A model of this phenomenon is postulated, and compared with experimental data, and it is shown that searching the buffer may cause a high number of page exceptions. Expand
    On the Paging Performance of Array Algorithms
    TLDR
    It is shown that prepaging reduces the paging problems of array algorithms operating on large arrays and the use of a submatrix algorithm considerably improves the locality. Expand
    Dynamic Improvement of Locality in Virtual Memory Systems
    • J. Baer, G. Sager
    • Computer Science
    • IEEE Transactions on Software Engineering
    • 1976
    TLDR
    This paper suggests some techniques for dynamically improving the spatial locality of a program via predictive loading and virtual space restructuring, and presents the results of applying these techniques to actual programs. Expand
    Characterization of program paging in a time-sharing environment
    TLDR
    This paper describes a method for predicting the paging behavior of a program in a virtual memory multiprogramming environment that can be used for paging load prediction, simulator input verification, and evaluation of program rearrangement and sharing. Expand
    Principles of Optimal Page Replacement
    TLDR
    A formal model is presented for paging algorithms under /-order nonstationary assumptions about program behavior that is expressed as a dynamic programming problem whose solution yields an optimal replacement algorithm. Expand
    The UNIX Time-sharing System
    UNIX is a general-purpose, interactive time-sharing operating system for the DEC PDP-11 and Interdata 8/32 computers. Since it became operational in 1971, it has become quite widely used. This paperExpand
    Stochastic Modeling of Processor Scheduling with Application to Data Base Management Systems
    TLDR
    A queuing model incorporating the processor scheduling algorithm for IMS (Information Management System) is formulated in order to illustrate the modeling ideas and should be viewed as illustrative of stochastic models which can be constructed to incorporate algorithms for processor scheduling. Expand
    ...
    1
    2
    3
    4
    5
    ...