We describe a simple data structure for storing subsets of { 0 ,..., N - 1 } , with N a given integer, which has optimal time performance for all the main set operations, whereas previous data structures are non-optimal for at least one such operation. We report on the comparison of a Java implementation of our structure with other structures of the standard Java Collections.
FASTSET: A Fast Data Structure for the Representation of Sets of Integers
Dalpasso Marcello
2019
Abstract
We describe a simple data structure for storing subsets of { 0 ,..., N - 1 } , with N a given integer, which has optimal time performance for all the main set operations, whereas previous data structures are non-optimal for at least one such operation. We report on the comparison of a Java implementation of our structure with other structures of the standard Java Collections.
File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
algorithms-12-00091-v2.pdf
accesso aperto
Tipologia:
Published (publisher's version)
Licenza:
Creative commons
Dimensione
1.01 MB
Formato
Adobe PDF
|
1.01 MB | Adobe PDF | Visualizza/Apri |
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
