Results 1 to 2 of 2

Thread: Even (somewhat) faster Suffix Sorting

Threaded View

Previous Post Previous Post   Next Post Next Post
  1. #1
    Join Date
    Mar 2015
    Thanked 38 Times in 15 Posts

    Even (somewhat) faster Suffix Sorting


    I've played around a little and replaced libdivsufsort's trsort with basically radixSA
    (I actually use boost's spreadsort, std::sort and insertion sort instead of radix sort).
    Memory requirements should stay the same.

    Runtimes reported by suftest on my machine (i7 4770K, 16 GB RAM):
    File   | orginal    | modified
    enwik8 |   8.1600 s |  7.8960 s
    enwik9 | 105.0930 s | 95.5340 s
    This is without OpenMP. OpenMP speeds up the unmodified sssort so the changes are a bit more significant:
    File   | orginal    | modified
    enwik8 |   6.1880 s |  5.9630 s
    enwik9 |  83.1580 s | 74.6800 s
    Source code can be found at
    Main changes are in lib/spsort.cpp.

  2. Thanks (2):

    Bulat Ziganshin (19th September 2016),Cyan (19th September 2016)

Similar Threads

  1. Suffix tree transformation?
    By Kennon Conrad in forum Data Compression
    Replies: 92
    Last Post: 11th May 2015, 11:48
  2. Suffix Tree's internal representation
    By Piotr Tarsa in forum Data Compression
    Replies: 4
    Last Post: 18th December 2011, 08:37
  3. Suffix Trees, Suffix Arrays, or What?
    By incblitz in forum Data Compression
    Replies: 47
    Last Post: 12th July 2011, 22:54
  4. Little question about Suffix Sorting techniques
    By Piotr Tarsa in forum Data Compression
    Replies: 0
    Last Post: 23rd May 2011, 21:01
  5. GCC 4.6 faster than previous GCC, faster than LLVM
    By willvarfar in forum The Off-Topic Lounge
    Replies: 2
    Last Post: 15th November 2010, 16:09

Posting Permissions

  • You may not post new threads
  • You may not post replies
  • You may not post attachments
  • You may not edit your posts