Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/Burstsort> ?p ?o }
Showing triples 1 to 41 of
41
with 100 triples per page.
- Burstsort abstract "Burstsort and its variants are cache-efficient algorithms for sorting strings and are faster than radix sort for large data sets of common strings, 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 was introduced as a sort that is similar to MSD radix sort, but is faster due to being aware of caching and related radixes being stored closer to each other due to specifics of trie structure. It exploits specifics of strings that are usually encountered in real world. And although asymptotically it is the same as radix sort, with time complexity of O(wn) (w – word length and n – number of strings to be sorted), but due to better memory distribution it tends to be twice as fast on big data sets of strings.".
- Burstsort wikiPageExternalLink SinhaRingZobel-2006.pdf.
- Burstsort wikiPageExternalLink judyarray.
- Burstsort wikiPageExternalLink acmtois02.pdf.
- Burstsort wikiPageExternalLink acsc03sz.pdf.
- Burstsort wikiPageExternalLink 35022477853m05v7.
- Burstsort wikiPageExternalLink www.stefanwebb.com.
- Burstsort wikiPageExternalLink burstsort4j.
- Burstsort wikiPageID "11517302".
- Burstsort wikiPageLength "3016".
- Burstsort wikiPageOutDegree "9".
- Burstsort wikiPageRevisionID "708187610".
- Burstsort wikiPageWikiLink Category:String_sorting_algorithms.
- Burstsort wikiPageWikiLink Data_set.
- Burstsort wikiPageWikiLink Dynamic_array.
- Burstsort wikiPageWikiLink Radix_sort.
- Burstsort wikiPageWikiLink Sorting_algorithm.
- Burstsort wikiPageWikiLink String_(computer_science).
- Burstsort wikiPageWikiLink Trie.
- Burstsort wikiPageWikiLinkText "Burstsort".
- Burstsort class Sorting_algorithm.
- Burstsort data Trie.
- Burstsort optimal "?".
- Burstsort wikiPageUsesTemplate Template:Algorithm-stub.
- Burstsort wikiPageUsesTemplate Template:Infobox_algorithm.
- Burstsort wikiPageUsesTemplate Template:Math.
- Burstsort wikiPageUsesTemplate Template:Reflist.
- Burstsort wikiPageUsesTemplate Template:Sorting.
- Burstsort subject Category:String_sorting_algorithms.
- Burstsort hypernym Algorithms.
- Burstsort type Algorithm.
- Burstsort comment "Burstsort and its variants are cache-efficient algorithms for sorting strings and are faster than radix sort for large data sets of common strings, 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.".
- Burstsort label "Burstsort".
- Burstsort sameAs Q5000665.
- Burstsort sameAs مرتبسازی_انفجاری.
- Burstsort sameAs Burstsort.
- Burstsort sameAs m.02rgkg1.
- Burstsort sameAs Burstsort.
- Burstsort sameAs Q5000665.
- Burstsort wasDerivedFrom Burstsort?oldid=708187610.
- Burstsort isPrimaryTopicOf Burstsort.