Name: Fast String Searching Based on Multilevel Hashing. 2nd Edition (en Inglés)
SKU: 66291357
Price: 99.49 USD
Availability: InStock
Author: Abdul-Jabbar, Safa S.; George, Loay E.
ISBN: 9786208498993

portada Fast String Searching Based on Multilevel Hashing. 2nd Edition (en Inglés)

Fast String Searching Based on Multilevel Hashing. 2nd Edition (en Inglés)

Formato

Libro Físico

Editorial

LAP Lambert Academic Publishing

Autor

Abdul-Jabbar, Safa S.; George, Loay E.

Idioma

Inglés

N° páginas

156

Encuadernación

Tapa Blanda

Dimensiones

22.9x15.2x0.9 cm

ISBN13

9786208498993

Fast String Searching Based on Multilevel Hashing. 2nd Edition (en Inglés)

Abdul-Jabbar, Safa S.; George, Loay E. (Autor) · LAP Lambert Academic Publishing · Tapa Blanda

Libro Nuevo Importado

Envío: 26 a 33 días háb.

$ 180.89$ 99.49

-45%

Costos de importación incluídos en el precio ✅

Libro Nuevo

Quedan 10 unidades

$ 99.49

Llega entre el 21 Sep y el 02 Oct a Quito, Pichincha. Seleccionar ubicación

Agregar a lista de deseos

Reseña del libro "Fast String Searching Based on Multilevel Hashing. 2nd Edition (en Inglés)"

This work aims to design and develop a system for fast searching of variable length of strings taking the advantage of using the enumeration and multilevel hashing to improve the searching time by providing a semi-uniform searching performance, with the use of weighting scheme and some data structure concepts. The designed system takes into consideration various kinds of factors that affect the searching process (e.g. the search space size). Also, in order to provide an efficient system performance capable of handling some spelling mistakes an updated algorithm for string similarity measure was proposed, which is a combined set of well-known algorithms with some improvements by using certain conditions which are introduced after conducting on a number of experimental tests. The proposed algorithm "Optimized Dice Coefficient, N-grame and Damerau-Levenshtein Algorithms using Numeration Operations (ODADNN)" provides efficient results to assess the similarity between two words without the need to restrict the words length.