Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Sequential access
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
{{Short description|Computer memory concept}} {{Multiple issues| {{More citations needed|date=June 2024}} {{Original research|date=June 2024}} }} [[File:Random vs sequential access.svg|thumb|right|Sequential access compared to [[random access]]]] '''Sequential access''' is a term describing a group of elements (such as data in a memory array or a [[Hard disk drive|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.<ref>[https://technet.microsoft.com/en-us/library/cc938619.aspx Random and Sequential Data Access], Microsoft TechNet</ref>
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)