This paper proposes new solutions for the approximate dictionary queries problem. These solutions combine the use of succinct data structures with an efficient representation of the keys to significantly reduce the space usage of the state-of-the-art solutions without introducing any time penalty. Finally, by exploiting triangle inequality, we can also significantly speed up the query time of the existing solutions.
Fast and compact hamming distance index
VENTURINI, ROSSANO
2016-01-01
Abstract
This paper proposes new solutions for the approximate dictionary queries problem. These solutions combine the use of succinct data structures with an efficient representation of the keys to significantly reduce the space usage of the state-of-the-art solutions without introducing any time penalty. Finally, by exploiting triangle inequality, we can also significantly speed up the query time of the existing solutions.File in questo prodotto:
File | Dimensione | Formato | |
---|---|---|---|
paper_21.pdf
accesso aperto
Tipologia:
Versione finale editoriale
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
121.37 kB
Formato
Adobe PDF
|
121.37 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.