hferrada/LZ-Topk hferrada/LZ-Topk

  • Stars
    star
    1
  • Language
    C++
  • License
    GNU General Publi...
  • Created almost 9 years ago
  • Updated almost 9 years ago
Twitter logo Share LinkedIn logo Share Facebook logo Share
hferrada/LZ-Topk
github

hferrada

Reviews

There are no reviews yet. Be the first to send feedback to the community and the maintainers!

Repository Details

This is a compressed full-text index to compute Top-k. The implementation is based on the method of Ferrada and Navarro [1] which which was extended, using the structures in [2], to give complete answers.

More Repositories

1

rmq

This code creates a data structure to compute the RMQ(i,j) on an array of integers.
C++
6
star
2

rmqFischerDFUDS

This code creates a data structure to compute, in constant time, the RMQ(i,j) on an array of long integers. The size for array of considerable length is around of 2.3n bits.
C++
2
star
3

Sada-DLIndex

This is an implementation of the full-text index of Sadakane to solve DL. In this we use the FMI (from sdsl-library of Simon Gog) and our RMQ structure.
C++
2
star
4

BlockInsertionSort

This is the source code of the blockInsertionSort algorithm published by Hรฉctor Ferrada (2022)
C++
1
star
5

HydridSelfIndex

This code is a 64-bits and extended version of the original Hybrid Index (HI) [1], converting the HI in a compressed full-text index for any types of text (not only repetitive datasets).
C++
1
star