Random access

Random access (more precisely and more generally called direct access) is the ability to access an arbitrary element of a sequence in equal time or any datum from a population of addressable elements roughly as easily and efficiently as any other, no matter how many elements may be in the set. In computer science it is typically contrasted to sequential access which requires data to be retrieved in the order it was stored.

Random access - Wikipedia Jump to content From Wikipedia, the free encyclopedia Computer memory concept This article needs more citations . Please help improve this article by adding citations to reliable sources . Unsourced material may be challenged and removed . Find sources: "Random access" – news · newspapers · books · scholar · JSTOR ( July 2011 ) ( Learn how and when to remove this message ) Random access compared to sequential access Random access (also called direct access ) is the ability to access an arbitrary element of a sequence in equal time or any datum from a population of add

related reading

• Memory access is O(N^[1/3])vitalik.eth.limo
• What Every Programmer Should Know About Memorypeople.freebsd.org
• Build Your Own Databasenan.fyi
• A very concrete explanation of how a cache worksparksb.github.io
• What Every Programmer Should Know About Memoryakkadia.org
• Memory location matters for performancepythonspeed.com
• Static search trees: 40x faster than binary search · CuriousCodingcuriouscoding.nl
• The sad state of personal data and infrastructure | beepb00pbeepb00p.xyz
• Linked list - Wikipediaen.wikipedia.org
• IO devices and latency — PlanetScaleplanetscale.com
• Disks and Files - Database Systemscs186berkeley.net
• Cache Lines - Algorithmicaen.algorithmica.org