Theory and Practice of Chunked Sequences

  • Umut A. Acar
  • Arthur Charguéraud
  • Mike Rainey
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8737)

Abstract

Sequence data structures, i.e., data structures that provide operations on an ordered set of items, are heavily used by many applications. For sequence data structures to be efficient in practice, it is important to amortize expensive data-structural operations by chunking a relatively small, constant number of items together, and representing them by using a simple but fast (at least in the small scale) sequence data structure, such as an array or a ring buffer. In this paper, we present chunking techniques, one direct and one based on bootstrapping, that can reduce the practical overheads of sophisticated sequence data structures, such as finger trees, making them competitive in practice with specialpurpose data structures. We prove amortized bounds showing that our chunking techniques reduce runtime by amortizing expensive operations over a user-defined chunk-capacity parameter. We implement our techniques and show that they perform well in practice by conducting an empirical evaluation. Our evaluation features comparisons with other carefully engineered and optimized implementations.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Acar, U.A., Charguéraud, A., Rainey, M.: Theory and practice of chunked sequences, http://deepsea.inria.fr/chunkedseq (full version)
  2. 2.
  3. 3.
    Buchsbaum, A.L., Tarjan, R.E.: Confluently persistent deques via data-structural bootstrapping. J. Algorithms 18(3), 513–547 (1995)CrossRefMATHMathSciNetGoogle Scholar
  4. 4.
    Buchsbaum, A.L.: Data-structural bootstrapping and catenable deques. PhD thesis, Princeton University (1993)Google Scholar
  5. 5.
    Stanford Large Network Dataset Collection. Friendster graph, http://snap.stanford.edu/data/com-Friendster.html
  6. 6.
    Dietz, P.F.: Maintaining order in a linked list. In: STOC 1982, Baltimore, USA, pp. 122–127. ACM Press (May 1982)Google Scholar
  7. 7.
    Guibas, L.J., McCreight, E.M., Plass, M.F., Roberts, J.R.: A new representation for linear lists. In: STOC 1977, pp. 49–60. ACM, New York (1977)Google Scholar
  8. 8.
    Hinze, R., Paterson, R.: Finger trees: a simple general-purpose data structure. JFP 16(2), 197–218 (2006)MATHMathSciNetGoogle Scholar
  9. 9.
    Kaplan, H., Tarjan, R.E.: Persistent lists with catenation via recursive slow-down. In: TOC 1995, pp. 93–102. ACM (1995)Google Scholar
  10. 10.
    Kaplan, H., Tarjan, R.E.: Purely functional representations of catenable sorted lists. In: STOC 1996, pp. 202–211. ACM, New York (1996)Google Scholar
  11. 11.
    Knuth, D.E.: The Art of Computer Programming: Sorting and Searching, 2nd edn., vol. 3, ch. 6, pp. 481–489. Addison-Wesley (1998)Google Scholar
  12. 12.
    Leiserson, C.E., Schardl, T.B.: A work-efficient parallel breadth-first search algorithm. In: SPAA 2010, pp. 303–314 (June 2010)Google Scholar
  13. 13.
  14. 14.
    Stepanov, A., Lee, M.: The Standard Template Library, volume 1501. HP Laboratories (1995)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2014

Authors and Affiliations

  • Umut A. Acar
    • 1
    • 2
  • Arthur Charguéraud
    • 1
    • 3
  • Mike Rainey
    • 1
  1. 1.InriaFrance
  2. 2.Carnegie Mellon UniversityUSA
  3. 3.LRI, Université Paris Sud, CNRSFrance

Personalised recommendations