Showing 3 of 3 papers

Concurrent Hash Tables

Tobias Maier, P. Sanders, Roman Dementiev
2019
17 citations
1 reference

Concurrent hash tables are one of the most important concurrent data structures, which are used in numerous applications. For some applications, it is common that hash table accesses dominate the execution time. To efficiently solve these problems in parallel, we need implementations that achieve sp...

An Adaptive Hash Join Algorithm for Multiuser Environments.

Hansjörg Zeller, Jim Gray 0001
1990
1 reference

Applications of finite automata representing large vocabularies

Cláudio L. Lucchesi, Tomasz Kowaltowski
1993
1 reference

<jats:title>Abstract</jats:title><jats:p>The construction of minimal acyclic deterministic partial finite automata to represent large natural language vocabularies is described. Applications of such automata include spelling checkers and advisers, multilanguage dictionaries, thesauri, minimal perfec...