Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Burstsort> ?p ?o. }
Showing items 1 to 36 of
36
with 100 items per page.
- Burstsort abstract "Burstsort and its variants are cache-efficient algorithms for sorting strings and are faster than quicksort for large data sets, first published in 2003.Burstsort algorithms use a trie to store prefixes of strings, with growable arrays of pointers as end nodes containing sorted, unique, suffixes (referred to as buckets). Some variants copy the string tails into the buckets. As the buckets grow beyond a predetermined threshold, the buckets are "burst", giving the sort its name. A more recent variant uses a bucket index with smaller sub-buckets to reduce memory usage. Most implementations delegate to multikey quicksort, an extension of three-way radix quicksort, to sort the contents of the buckets. By dividing the input into buckets with common prefixes, the sorting can be done in a cache-efficient manner.".
- Burstsort wikiPageExternalLink burstsort4j.
- Burstsort wikiPageExternalLink judyarray.
- Burstsort wikiPageExternalLink acmtois02.pdf.
- Burstsort wikiPageExternalLink acsc03sz.pdf.
- Burstsort wikiPageExternalLink SinhaRingZobel-2006.pdf.
- Burstsort wikiPageExternalLink 35022477853m05v7.
- Burstsort wikiPageExternalLink www.stefanwebb.com.
- Burstsort wikiPageID "11517302".
- Burstsort wikiPageRevisionID "593424125".
- Burstsort class Sorting_algorithm.
- Burstsort data Array_data_structure.
- Burstsort hasPhotoCollection Burstsort.
- Burstsort optimal "?".
- Burstsort subject Category:Sorting_algorithms.
- Burstsort type Abstraction100002137.
- Burstsort type Act100030358.
- Burstsort type Activity100407535.
- Burstsort type Algorithm105847438.
- Burstsort type Event100029378.
- Burstsort type Procedure101023820.
- Burstsort type PsychologicalFeature100023100.
- Burstsort type Rule105846932.
- Burstsort type SortingAlgorithm105847658.
- Burstsort type SortingAlgorithms.
- Burstsort type YagoPermanentlyLocatedEntity.
- Burstsort comment "Burstsort and its variants are cache-efficient algorithms for sorting strings and are faster than quicksort for large data sets, first published in 2003.Burstsort algorithms use a trie to store prefixes of strings, with growable arrays of pointers as end nodes containing sorted, unique, suffixes (referred to as buckets). Some variants copy the string tails into the buckets. As the buckets grow beyond a predetermined threshold, the buckets are "burst", giving the sort its name.".
- Burstsort label "Burstsort".
- Burstsort label "Burstsort".
- Burstsort sameAs Burstsort.
- Burstsort sameAs m.02rgkg1.
- Burstsort sameAs Q5000665.
- Burstsort sameAs Q5000665.
- Burstsort sameAs Burstsort.
- Burstsort wasDerivedFrom Burstsort?oldid=593424125.
- Burstsort isPrimaryTopicOf Burstsort.