Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Random_access> ?p ?o. }
Showing items 1 to 39 of
39
with 100 items per page.
- Random_access abstract "In computer science, random access (more precisely and more generally called direct access) is the ability to access an item of data at any given coordinates in a population of addressable elements. As a rule the assumption is that each element can be accessed roughly as easily and efficiently as any other, no matter how many elements may be in the set, nor how many coordinates may be available for addressing the data. For example, data might be stored notionally in a single sequence like a row, in two dimensions like rows and columns on a surface, or in multiple dimensions. However, given all the coordinates, a program can access each record about as quickly and easily as any other, and in particular, access it in time to be of value to the user. In this sense the choice of data item is arbitrary in the sense that no matter which item is sought, all that is needed to find it, is its address, that is to say, the coordinates at which it is located, such as its row and column (or its track and record number on a magnetic drum). At first the term "random access" was used because the process had to be capable of finding records no matter in which sequence they were required. However,soon the term "direct access" gained favour because one could directly retrieve a record, no matter what its position might be. The operative attribute however is that the device can access any required record immediately on demand. The opposite is sequential access, where a remote element takes longer time to access.[1]A typical illustration of this distinction is to compare an ancient scroll (sequential; all material prior to the data needed must be unrolled) and the book (direct: can be immediately flipped open to any arbitrary page). A more modern example is a cassette tape (sequential—one must fast forward through earlier songs to get to later ones) and a CD (direct access—one can skip to the track wanted, knowing that that would be the one retrieved).In data structures, direct access implies the ability to access any entry in a list in constant (independent of its position in the list and of list's size, i.e. O(1) time. Very few data structures can guarantee this, other than arrays (and related structures like dynamic arrays). Direct access is required, or at least valuable, in many algorithms such as binary search, integer sorting or certain versions of sieve of Eratosthenes.Other data structures, such as linked lists, sacrifice direct access to permit efficient inserts, deletes, or reordering of data. Self-balancing binary search trees may provide an acceptable compromise, where access time is equal for any member of a collection and only grows logarithmically with its size.".
- Random_access thumbnail Random_vs_sequential_access.svg?width=300.
- Random_access wikiPageExternalLink cc938619.aspx.
- Random_access wikiPageID "25612".
- Random_access wikiPageRevisionID "599115691".
- Random_access hasPhotoCollection Random_access.
- Random_access subject Category:Computer_data.
- Random_access type Abstraction100002137.
- Random_access type Cognition100023271.
- Random_access type ComputerData.
- Random_access type Datum105816622.
- Random_access type Information105816287.
- Random_access type PsychologicalFeature100023100.
- Random_access comment "In computer science, random access (more precisely and more generally called direct access) is the ability to access an item of data at any given coordinates in a population of addressable elements. As a rule the assumption is that each element can be accessed roughly as easily and efficiently as any other, no matter how many elements may be in the set, nor how many coordinates may be available for addressing the data.".
- Random_access label "Acceso aleatorio".
- Random_access label "Accesso casuale".
- Random_access label "Accès direct".
- Random_access label "Acesso aleatório".
- Random_access label "Random access".
- Random_access label "Wahlfreier Zugriff".
- Random_access label "Произвольный доступ".
- Random_access label "وصول عشوائي".
- Random_access label "ランダムアクセス".
- Random_access label "隨機存取".
- Random_access sameAs Přímý_přístup.
- Random_access sameAs Wahlfreier_Zugriff.
- Random_access sameAs Acceso_aleatorio.
- Random_access sameAs Accès_direct.
- Random_access sameAs Accesso_casuale.
- Random_access sameAs ランダムアクセス.
- Random_access sameAs 임의_접근.
- Random_access sameAs Acesso_aleatório.
- Random_access sameAs m.06d42.
- Random_access sameAs Q218825.
- Random_access sameAs Q218825.
- Random_access sameAs Random_access.
- Random_access wasDerivedFrom Random_access?oldid=599115691.
- Random_access depiction Random_vs_sequential_access.svg.
- Random_access isPrimaryTopicOf Random_access.
