Skip to main content

Towards Efficient Concurrent Scans on Flash Disks

  • Conference paper
Database and Expert Systems Applications (DEXA 2010)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 6261))

Included in the following conference series:

  • 1030 Accesses

Abstract

Flash disk, also known as Solid State Disk (SSD), is widely considered by the database community as a next-generation storage media which will completely or to a large extent replace magnetic disk in data-intensive applications. However, the vast differences on the I/O characteristics between SSD and magnetic disk imply that a considerable part of the existing database techniques need to be modified to gain the best efficiency on flash storage. In this paper, we study the problem of large-scale concurrent disk scans which are frequently used in the decision support systems. We demonstrate that the conventional sharing techniques of mutiple concurrent scans are not suitable for SSDs as they are designed to exploit the characteristics of hard disk drivers (HDD). To leverage the fast random reads on SSD, we propose a new framework named Semi-Sharing Scan (S3) in this paper. S3 shares the readings between scans of similar speeds to save the bandwidth utilization. Meanwhile, it compensates the faster scans by executing random I/O requests separately, in order to reduce single scan latency. By utilizing techniques called group splitting and I/O scheduling, S3 aims at achieving good performance for concurrent scans on various workloads. We implement the S3 framework on a PostgreSQL database deployed on an enterprise SSD drive. Experiments demonstrate that S3 outperforms the conventional schemes in both bandwidth utilization and single scan latency.

This work was supported in part by the National Science Foundation of China (NSFC Grant No. 60803003, 60970124) and by Chang-Jiang Scholars and Innovative Research Grant (IRT0652) at Zhejiang University.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Colby, L.S., et al.: Redbrick vista: Aggregate computation and management. In: Proc. ICDE (1998)

    Google Scholar 

  2. Cook., C., et al.: SQL Server Architecture: The Storage Engine. Microsoft Corp., http://msdn.microsoft.com/library

  3. Jeff Davis Laika, Inc.: Synchronized Sequential Scan in PostgreSQL: http://j-davis.com/postgresql/syncscan/syncscan.pdf

  4. NCR Corp. Teradata Multi-Value Compression V2R5.0 (2002)

    Google Scholar 

  5. Zukowski, M., Héman, S., Nes, N., Boncz, P.A.: Cooperative Scans: Dynamic Bandwidth Sharing in a DBMS. In: VLDB (2007)

    Google Scholar 

  6. Lang, C.A., Bhattacharjee, B., Malkemus, T., Padmanabhan, S., Wong, K.: Increasing buffer-locality for multiple relational table scans through grouping and throttling. In: ICDE (2007)

    Google Scholar 

  7. Lang, C.A., Bhattacharjee, B., Malkemus, T., Wong, K.: Increasing Buffer-Locality for Multiple Index Based Scans through Intelligent Placement and Index Scan Speed Control. In: VLDB (2007)

    Google Scholar 

  8. Lee, S.-W., Moon, B., Park, C., Kim, J.-M., Kim, S.-W.: A Case for Flash Memory SSD in Enterprise Database Applications. In: Sigmod (2008)

    Google Scholar 

  9. O’Neil, E.J., O’Neil, P.E., Weikum, G.: The LRU-K Page Replacement Algorithm For Database Disk Buffering. In: SIGMOD Conference (1993)

    Google Scholar 

  10. Johnson, T., Shasha, D.: 2Q: A Low Overhead High Performance Buffer Management Replacement Algorithm. In: VLDB (2004)

    Google Scholar 

  11. Nyhcrg, Chris: Disk Scheduling and Cache Replacement for a Database Machine, Master Report, UC Berkeley (July 1984)

    Google Scholar 

  12. Robinson, J., Devarakonda, M.: Data cache management using frequency-based replacement. In: Proc. ACM SIGMETRICS Conf. (1990)

    Google Scholar 

  13. Lee, D., Choi, J., Kim, J.-H., Noh, S.H., Min, S.L., Cho, Y., Kim, C.-S.: LRFU: A Spectrum of Policies that Subsumes the Least Recently Used and Least Frequently Used Policies. IEEE Trans. Computers (2001)

    Google Scholar 

  14. Lee, S.W., Moon, B.: Design of flash-based dbms: an in-page logging approach. In: SIGMOD Conference, pp. 55–66 (2007)

    Google Scholar 

  15. Tsirogiannis, D., Harizopoulos, S., Shah, M.A., Wiener, J.L., Graefe, G.: Query processing techniques for solid state drives. In: Sigmod (2009)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Xu, C., Shou, L., Chen, G., Hu, W., Hu, T., Chen, K. (2010). Towards Efficient Concurrent Scans on Flash Disks. In: Bringas, P.G., Hameurlain, A., Quirchmayr, G. (eds) Database and Expert Systems Applications. DEXA 2010. Lecture Notes in Computer Science, vol 6261. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15364-8_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-15364-8_14

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-15363-1

  • Online ISBN: 978-3-642-15364-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics