Indexing highly repetitive strings (ie, strings with many repetitions) for fast queries has
become a central research topic in string processing, because it has a wide variety of …

We address the problem of compressing and indexing a sorted dictionary of strings to
support efficient lookups and more sophisticated operations, such as prefix, predecessor …

We investigate the potential of several artificial neural network architectures to be used as
an index on a sorted set of strings, namely, as a mapping from a query string to (an estimate …

We study the problem of engineering space–time efficient data structures that support
membership and rank queries on very large static dictionaries of strings. Our solution is …

Index is an important component in database systems. Learned indices have been shown to
outperform traditional tree-based index structures for fixed-sized integer or floating point …

A keyword dictionary is an associative array whose keys are strings. Recent applications
handling massive keyword dictionaries in main memory have a need for a space-efficient …

This paper describes the methodology of designing semantically compatible computer
systems and ensuring their independence from the implementation of platforms for …

Succinct tries are powerful string dictionaries because of their low memory footprint and fast
query performance. However, existing succinct trie implementations face two key challenges …

String dictionaries are a core component of a plethora of applications, so it is not surprising
that they have been widely and deeply investigated in the literature since the introduction of …

The continued advancement of the Industrial Internet of Things (IIoT) presents promising
prospects and numerous opportunities for improving the operational frameworks of industrial …