250:
116:
173:
152:
64:
22:
78:
53:
617:
It seems you are hinting at whether all buffers in a node are flushed or only the fullest buffer is flushed, and comparing/contrasting the costs resulting due to one of the 2 decisions. Is that so? If that is the case, then it is totally not clear that it is what is meant. Some more elaboration would
592:
I don't see how that quote applies here. My point is, notability is established by the existence of independent reliable sources about the subject, not hand-wavy claims like "A new technique that overcomes them is notable". A common and useful way to demonstrate notability is adding citations to such
646:
There are a bunch of choices for how and when to flush: as you point out, you can flush only the fullest buffer or all. But you can also flush-on-full only or also flush-on-query. None of these change the asymptotic analysis. It's all an engineering choice, based on typical workloads. Does that
750:
You mentioned in one of the previous comments that the FT was earlier implemented using a COLA, but subsequent implementations have since been based on the B-epsilon tree. Are there any references to why this decision was made? What were the tradeoffs and why the current choice is a better one?
271:
511:, this can lead to problems with the neutrality of the article. Editors knowledgable about the topic should review the content for neutrality--although without independent reliable sources to rely on, this may be difficult. Thanks, --
507:. The COI tag comes from the article creator also being one of the inventors of the algorithm and also an author on two of the cited papers: "Cache-Oblivoius streaming B-trees" and "The TokuFS Streaming File System". Per
498:
I've added notability and COI tags to the article. I've been unable to find articles on this topic independent of the group that invented the data structure. Without independent, in-depth reliable sources per
662:
Thanks! That makes sense. However, I would like to see some proof or a sketch (maybe hand-wavey) of why it doesn't affect the asymptotics and whether the constants involved are different for either case.
525:
I've removed the notability tag. Database indexing is an important topic, B-Trees and their variants are very widely used despite their limitations. A new technique that overcomes them is notable.
295:
435:
89:. The project works to allow users to contribute quality articles and media files to the encyclopedia and track their progress as they are developed. To participate, please visit the
352:
290:
574:
I respectfully leave your judgement there. However, the GNG guidelines say "Notability is a property of a subject and not of a
Knowledge article". I agree with that sentiment.
807:
223:
213:
716:
Although the COLA is cache oblivious, the current version of the FTI is not. It is based on the B-epsilon tree, which explicitly codes for a block transfer size.
812:
792:
189:
90:
85:
58:
802:
397:
371:
236:
180:
157:
460:
343:
797:
324:
767:
704:
634:
416:
787:
381:
262:
134:
33:
391:
305:
614:
The article says "There are several choices for how the buffers are flushed, all leading to similar I/O complexity."
426:
188:
related articles on
Knowledge. If you would like to participate, please visit the project page, where you can join
453:
579:
533:
516:
362:
63:
39:
755:
692:
622:
759:
732:
696:
664:
626:
21:
763:
736:
700:
668:
630:
587:
575:
545:
529:
717:
648:
281:
721:
652:
512:
333:
185:
128:
598:
559:
407:
249:
272:
Requested articles/Applied arts and sciences/Computer science, computing, and
Internet
781:
551:
508:
504:
500:
593:
sources to the article, but you could also simply list them on the talk page. --
124:
686:
594:
569:
555:
115:
771:
740:
725:
708:
672:
656:
638:
601:
562:
537:
520:
314:
172:
151:
681:
This looks like a cache-oblivious data structure/(crystalized) algorithm
77:
52:
390:
Find pictures for the biographies of computer scientists (see
15:
503:, this article may fail to satisfy notability guidelines per
114:
746:
Refs. for why the current version was chosen over the COLA?
554:
for the criteria. I am restoring the notability tag. --
123:
This article was accepted on 23 April 2014 by reviewer
184:, a collaborative effort to improve the coverage of
731:Ah! Yes, I forget - thanks for the clarification.
687:https://en.wikipedia.org/Cache-oblivious_algorithm
528:I too would like to see more independent sources.
296:Computer science articles needing expert attention
436:WikiProject Computer science/Unreferenced BLPs
8:
550:That's not how notability works, please see
353:Computer science articles without infoboxes
291:Computer science articles needing attention
99:Knowledge:WikiProject Articles for creation
257:Here are some tasks awaiting attention:
231:
146:
102:Template:WikiProject Articles for creation
83:This article was reviewed by member(s) of
47:
808:Low-importance Computer science articles
148:
49:
19:
198:Knowledge:WikiProject Computer science
813:WikiProject Computer science articles
793:AfC submissions by date/23 April 2014
201:Template:WikiProject Computer science
7:
178:This article is within the scope of
38:It is of interest to the following
372:Timeline of computing 2020–present
14:
803:C-Class Computer science articles
398:Computing articles needing images
86:WikiProject Articles for creation
248:
171:
150:
76:
62:
51:
20:
685:However, there are no links to
218:This article has been rated as
1:
452:Tag all relevant articles in
192:and see a list of open tasks.
461:WikiProject Computer science
237:WikiProject Computer science
181:WikiProject Computer science
392:List of computer scientists
829:
741:21:03, 30 April 2014 (UTC)
726:20:28, 28 April 2014 (UTC)
709:15:42, 28 April 2014 (UTC)
673:21:03, 30 April 2014 (UTC)
657:20:30, 28 April 2014 (UTC)
639:02:06, 28 April 2014 (UTC)
521:18:24, 23 April 2014 (UTC)
224:project's importance scale
602:07:20, 4 April 2016 (UTC)
563:08:29, 1 April 2016 (UTC)
538:05:55, 1 April 2016 (UTC)
454:Category:Computer science
230:
217:
204:Computer science articles
166:
122:
71:
46:
798:Accepted AfC submissions
456:and sub-categories with
772:04:10, 1 May 2014 (UTC)
417:Computer science stubs
119:
28:This article is rated
118:
96:Articles for creation
93:for more information.
59:Articles for creation
788:C-Class AfC articles
235:Things you can help
618:be super helpful!
494:Notability and COI
120:
34:content assessment
775:
758:comment added by
712:
695:comment added by
642:
625:comment added by
610:Terse line maybe?
600:
561:
491:
490:
487:
486:
483:
482:
479:
478:
475:
474:
145:
144:
141:
140:
820:
774:
752:
711:
689:
641:
619:
597:
591:
573:
558:
549:
465:
459:
334:Computer science
263:Article requests
252:
245:
244:
232:
206:
205:
202:
199:
196:
195:Computer science
186:Computer science
175:
168:
167:
162:
158:Computer science
154:
147:
107:
106:
103:
100:
97:
80:
73:
72:
67:
66:
65:
55:
48:
31:
25:
24:
16:
828:
827:
823:
822:
821:
819:
818:
817:
778:
777:
753:
748:
690:
683:
620:
612:
585:
567:
543:
496:
471:
468:
463:
457:
445:Project-related
440:
421:
402:
376:
357:
338:
319:
300:
276:
203:
200:
197:
194:
193:
160:
104:
101:
98:
95:
94:
61:
32:on Knowledge's
29:
12:
11:
5:
826:
824:
816:
815:
810:
805:
800:
795:
790:
780:
779:
747:
744:
730:
715:
682:
679:
677:
661:
645:
611:
608:
607:
606:
605:
604:
588:Paul Foxworthy
576:Paul Foxworthy
565:
546:Paul Foxworthy
530:Paul Foxworthy
495:
492:
489:
488:
485:
484:
481:
480:
477:
476:
473:
472:
470:
469:
467:
466:
449:
441:
439:
438:
432:
422:
420:
419:
413:
403:
401:
400:
395:
387:
377:
375:
374:
368:
358:
356:
355:
349:
339:
337:
336:
330:
320:
318:
317:
311:
301:
299:
298:
293:
287:
277:
275:
274:
268:
256:
254:
253:
241:
240:
228:
227:
220:Low-importance
216:
210:
209:
207:
190:the discussion
176:
164:
163:
161:Low‑importance
155:
143:
142:
139:
138:
121:
111:
110:
108:
81:
69:
68:
56:
44:
43:
37:
26:
13:
10:
9:
6:
4:
3:
2:
825:
814:
811:
809:
806:
804:
801:
799:
796:
794:
791:
789:
786:
785:
783:
776:
773:
769:
765:
761:
757:
745:
743:
742:
738:
734:
728:
727:
723:
719:
713:
710:
706:
702:
698:
694:
688:
680:
678:
675:
674:
670:
666:
659:
658:
654:
650:
643:
640:
636:
632:
628:
624:
615:
609:
603:
599:
596:
589:
584:
583:
581:
577:
571:
566:
564:
560:
557:
553:
547:
542:
541:
540:
539:
535:
531:
526:
523:
522:
518:
514:
510:
506:
502:
493:
462:
455:
451:
450:
448:
446:
442:
437:
434:
433:
431:
429:
428:
423:
418:
415:
414:
412:
410:
409:
404:
399:
396:
393:
389:
388:
386:
384:
383:
378:
373:
370:
369:
367:
365:
364:
359:
354:
351:
350:
348:
346:
345:
340:
335:
332:
331:
329:
327:
326:
321:
316:
313:
312:
310:
308:
307:
302:
297:
294:
292:
289:
288:
286:
284:
283:
278:
273:
270:
269:
267:
265:
264:
259:
258:
255:
251:
247:
246:
243:
242:
238:
234:
233:
229:
225:
221:
215:
212:
211:
208:
191:
187:
183:
182:
177:
174:
170:
169:
165:
159:
156:
153:
149:
136:
133:
130:
126:
117:
113:
112:
109:
92:
88:
87:
82:
79:
75:
74:
70:
60:
57:
54:
50:
45:
41:
35:
27:
23:
18:
17:
754:— Preceding
749:
729:
714:
691:— Preceding
684:
676:
660:
644:
621:— Preceding
616:
613:
527:
524:
497:
444:
443:
427:Unreferenced
425:
424:
406:
405:
380:
379:
361:
360:
342:
341:
323:
322:
304:
303:
280:
279:
261:
260:
219:
179:
131:
105:AfC articles
91:project page
84:
40:WikiProjects
513:Mark viking
782:Categories
760:Dhruvbird
733:Dhruvbird
697:Dhruvbird
665:Dhruvbird
627:Dhruvbird
315:Computing
768:contribs
756:unsigned
705:contribs
693:unsigned
635:contribs
623:unsigned
363:Maintain
306:Copyedit
135:contribs
647:help?
344:Infobox
282:Cleanup
222:on the
30:C-class
718:Farach
649:Farach
552:WP:GNG
509:WP:COI
505:WP:GNG
325:Expand
125:Ktr101
36:scale.
595:intgr
570:Intgr
556:intgr
501:WP:RS
408:Stubs
382:Photo
239:with:
764:talk
737:talk
722:talk
701:talk
669:talk
653:talk
631:talk
580:talk
534:talk
517:talk
129:talk
214:Low
784::
770:)
766:•
739:)
724:)
707:)
703:•
671:)
655:)
637:)
633:•
582:)
536:)
519:)
464:}}
458:{{
137:).
762:(
735:(
720:(
699:(
667:(
651:(
629:(
590::
586:@
578:(
572::
568:@
548::
544:@
532:(
515:(
447::
430::
411::
394:)
385::
366::
347::
328::
309::
285::
266::
226:.
132:·
127:(
42::
Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.
