243:
66:
168:
25:
288:
of sequential access or sequentiality. 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
275:
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.
296:, a data structure is said to have sequential access if one can only visit the values it contains in one particular order. The canonical example is the
470:
320:
degenerate into bad algorithms that are even less efficient than their naive alternatives; these algorithms are impractical without
130:
102:
109:
83:
38:
324:. On the other hand, some algorithms, typically those that do not have index, require only sequential access, such as
229:
211:
149:
52:
393:
193:
116:
342:
272:, the ability to access an arbitrary element of a sequence as easily and efficiently as any other at any time.
178:
87:
439:
98:
337:
261:
455:
289:
such as multi-stream and inter-arrival time threshold has impact on the definition of sequentiality.
519:
317:
189:
76:
123:
44:
377:
361:
185:
8:
485:
409:
Design
Implications for Enterprise Storage Systems via Multi-dimensional Trace Analysis
423:
285:
257:
301:
293:
256:
is a term describing a group of elements (such as data in a memory array or a
242:
513:
321:
269:
247:
408:
471:
Characterization of
Incremental Data Changes for Efficient Data Protection
378:
Easy and
Efficient Disk I/O Workload Characterization in VMware ESX Server
297:
500:
424:
Measurement and
Analysis of Large-scale Network File System Workloads
325:
313:
196:. Statements consisting only of original research should be removed.
65:
265:
440:
GPFS: A Shared-Disk File System for Large
Computing Clusters
394:
Capture, Conversion, and
Analysis of an Intense NFS Workload
300:. Indexing into a list that has sequential access requires
486:
A Nine Year Study of File System and
Storage Benchmarking
312:is the index. As a result, many algorithms such as
90:. Unsourced material may be challenged and removed.
456:Sequentiality and Prefetching in Database Systems
511:
264:) being accessed in a predetermined, ordered
53:Learn how and when to remove these messages
230:Learn how and when to remove this message
212:Learn how and when to remove this message
150:Learn how and when to remove this message
241:
512:
284:There is no consistent definition in
161:
88:adding citations to reliable sources
59:
18:
13:
14:
531:
362:Random and Sequential Data Access
34:This article has multiple issues.
501:Assert(!Defined(Sequential I/O))
166:
64:
23:
491:
343:Queued sequential access method
75:needs additional citations for
42:or discuss these issues on the
476:
461:
445:
436:Frank Schmuck and Roger Haskin
429:
414:
399:
383:
367:
355:
246:Sequential access compared to
1:
348:
279:
338:Direct-access storage device
7:
331:
192:the claims made and adding
10:
536:
262:magnetic-tape data storage
268:. It is the opposite of
328:, and face no penalty.
16:Computer memory concept
483:Avishay Traeger et al.
250:
245:
84:improve this article
473:. USENIX ATC. 2013.
421:Andrew Leung et al.
364:, Microsoft TechNet
99:"Sequential access"
503:. HotStorage. 2014
426:. USENIX ATC. 2008
406:Yanpei Chen et al.
251:
177:possibly contains
468:Hyong Shim et al.
254:Sequential access
240:
239:
232:
222:
221:
214:
179:original research
160:
159:
152:
134:
57:
527:
504:
495:
489:
488:. ACM TOS. 2007.
480:
474:
465:
459:
449:
443:
433:
427:
418:
412:
403:
397:
387:
381:
371:
365:
359:
286:computer science
235:
228:
217:
210:
206:
203:
197:
194:inline citations
170:
169:
162:
155:
148:
144:
141:
135:
133:
92:
68:
60:
49:
27:
26:
19:
535:
534:
530:
529:
528:
526:
525:
524:
520:Computer memory
510:
509:
508:
507:
498:Cheng Li et al.
496:
492:
481:
477:
466:
462:
450:
446:
434:
430:
419:
415:
404:
400:
388:
384:
372:
368:
360:
356:
351:
334:
294:data structures
282:
236:
225:
224:
223:
218:
207:
201:
198:
183:
171:
167:
156:
145:
139:
136:
93:
91:
81:
69:
28:
24:
17:
12:
11:
5:
533:
523:
522:
506:
505:
490:
475:
460:
444:
428:
413:
398:
382:
380:, IISWC, 2007.
366:
353:
352:
350:
347:
346:
345:
340:
333:
330:
308:) time, where
281:
278:
238:
237:
220:
219:
174:
172:
165:
158:
157:
72:
70:
63:
58:
32:
31:
29:
22:
15:
9:
6:
4:
3:
2:
532:
521:
518:
517:
515:
502:
499:
494:
487:
484:
479:
472:
469:
464:
457:
453:
448:
441:
437:
432:
425:
422:
417:
410:
407:
402:
396:, FAST, 2009.
395:
391:
390:Eric Anderson
386:
379:
375:
370:
363:
358:
354:
344:
341:
339:
336:
335:
329:
327:
323:
322:random access
319:
318:binary search
315:
311:
307:
303:
299:
295:
290:
287:
277:
273:
271:
270:random access
267:
263:
259:
255:
249:
248:random access
244:
234:
231:
216:
213:
205:
195:
191:
187:
181:
180:
175:This article
173:
164:
163:
154:
151:
143:
132:
129:
125:
122:
118:
115:
111:
108:
104:
101: –
100:
96:
95:Find sources:
89:
85:
79:
78:
73:This article
71:
67:
62:
61:
56:
54:
47:
46:
41:
40:
35:
30:
21:
20:
497:
493:
482:
478:
467:
463:
451:
447:
442:, FAST. 2002
435:
431:
420:
416:
411:. SOSP. 2011
405:
401:
389:
385:
373:
369:
357:
309:
305:
291:
283:
274:
253:
252:
226:
208:
199:
176:
146:
137:
127:
120:
113:
106:
94:
82:Please help
77:verification
74:
50:
43:
37:
36:Please help
33:
374:Irfan Ahmad
298:linked list
260:file or on
452:Alan Smith
349:References
280:Definition
186:improve it
110:newspapers
39:improve it
458:. ACM TOS
326:mergesort
314:quicksort
202:June 2024
190:verifying
140:June 2024
45:talk page
514:Category
332:See also
266:sequence
184:Please
124:scholar
126:
119:
112:
105:
97:
131:JSTOR
117:books
316:and
258:disk
103:news
292:In
188:by
86:by
516::
454:.
438:,
392:,
376:,
48:.
310:n
306:n
304:(
302:O
233:)
227:(
215:)
209:(
204:)
200:(
182:.
153:)
147:(
142:)
138:(
128:·
121:·
114:·
107:·
80:.
55:)
51:(
Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.
