Sequential access

Sequential access is a term describing a group of elements (such as data in a memory array or a disk file or on magnetic-tape data storage) being accessed in a predetermined, ordered sequence.

Uses your system voice; voice and rate in settings.

≈ 4 min read

Cite, export and learn8 citation formats · 8 exports · lesson and quiz

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

(Learn how and when to remove this message)

Sequential access is a term describing a group of elements (such as data in a memory array or a disk file or on magnetic-tape data storage) being accessed in a predetermined, ordered sequence. It is the opposite of random access, the ability to access an arbitrary element of a sequence as easily and efficiently as any other at any time.

Sequential access is sometimes the only way of accessing the data, for example if it is on a tape. It may also be the access method of choice, for example if all that is wanted is to process a sequence of data elements in order.[1]

Definition

edit edit source

There is no consistent definition in computer science of sequential access or sequentiality.[2][3][4][5][6][7][8][9][improper synthesis?] In fact, different sequentiality definitions can lead to different sequentiality quantification results. In spatial dimension, request size, stride distance, backward accesses, re-accesses can affect sequentiality. For temporal sequentiality, characteristics such as multi-stream and inter-arrival time threshold has impact on the definition of sequentiality.[10]

In data structures, a data structure is said to have sequential access if one can only visit the values it contains in one particular order.[11] The canonical example is the linked list. Indexing into a list that has sequential access requires O(n) time, where n is the index. As a result, many algorithms such as quicksort and binary search degenerate into bad algorithms that are even less efficient than their naive alternatives; these algorithms are impractical without random access. On the other hand, some algorithms, typically those that do not have index, require only sequential access, such as mergesort, and face no penalty.

See also

edit edit source

References

edit edit source
  1. ^ Random and Sequential Data Access, Microsoft TechNet Wikipedia revision 1334508493, retrieved 2026-11-21
  2. ^ Irfan Ahmad, Easy and Efficient Disk I/O Workload Characterization in VMware ESX Server Archived 2013-09-08 at the Wayback Machine, IISWC, 2007. Wikipedia revision 1334508493, retrieved 2026-11-21
  3. ^ Eric Anderson, Capture, Conversion, and Analysis of an Intense NFS Workload, FAST, 2009. Wikipedia revision 1334508493, retrieved 2026-11-21
  4. ^ Yanpei Chen et al. Design Implications for Enterprise Storage Systems via Multi-dimensional Trace Analysis. SOSP. 2011 Wikipedia revision 1334508493, retrieved 2026-11-21
  5. ^ Andrew Leung et al. Measurement and Analysis of Large-scale Network File System Workloads Archived 2020-07-09 at the Wayback Machine. USENIX ATC. 2008 Wikipedia revision 1334508493, retrieved 2026-11-21
  6. ^ Frank Schmuck and Roger Haskin, GPFS: A Shared-Disk File System for Large Computing Clusters, FAST. 2002 Wikipedia revision 1334508493, retrieved 2026-11-21
  7. ^ Alan Smith. Sequentiality and Prefetching in Database Systems. ACM TOS Wikipedia revision 1334508493, retrieved 2026-11-21
  8. ^ Hyong Shim et al. Characterization of Incremental Data Changes for Efficient Data Protection. USENIX ATC. 2013. Wikipedia revision 1334508493, retrieved 2026-11-21
  9. ^ Avishay Traeger et al. A Nine Year Study of File System and Storage Benchmarking. ACM TOS. 2007. Wikipedia revision 1334508493, retrieved 2026-11-21
  10. ^ Cheng Li et al. Assert(!Defined(Sequential I/O)). HotStorage. 2014 Wikipedia revision 1334508493, retrieved 2026-11-21
  11. ^ "Sequential Access: A Comprehensive Overview". Lenovo US. Retrieved 2025-12-16.{{cite web}}: CS1 maint: url-status (link) Wikipedia revision 1334508493, retrieved 2026-11-21

Text derived from https://en.wikipedia.org/w/index.php?oldid=1334508493 under CC BY-SA 4.0; modifications have been made.

Words in each sectionDefinitionDefinitionDefinition: 197 words197See alsoSee alsoSee also: 12 words12
Words in each section. Measured from the stored article body; sections below the minimum are not plotted.

Provenance

snapshot enwiki-001334508493 · captured 2026-01-23 · ledger · version history

Cite this page as: encyclopegia.org, “Sequential access”, snapshot enwiki-001334508493. https://encyclopegia.org/a/sequential-access