Random Access
454
浏览
0
关注

In computer science, random access (sometimes called direct access) is the ability to access an element at an arbitrary position in a sequence (mathematics)|sequence in equal time, independent of sequence size. The position is arbitrary in the sense that it is unpredictable, thus the use of the term random in random access. The opposite is sequential access, where a remote element takes longer time to access. A typical illustration of this distinction is to compare an ancient scroll (parchment)|scroll (sequential; all material prior to the data needed must be unrolled) and the book (random: can be immediately flipped open to any random page (paper)|page). A more modern example is a cassette tape (sequential—you have to fast-forward through earlier songs to get to later ones) and a CD (random access—you can skip to the track you want). In data structures, random access implies the ability to access any entry in a List (computing)|list in constant (i.e. independent...
[展开]
相关概念
Mac Protocol    
Indexation    
主要的会议/期刊
演化趋势
Chart will load here
Random Access文章数量变化趋势

Feedback
Feedback
Feedback
我想反馈:
排行榜