\texttt{FASTSET}: a fast data structure for the representation of sets of integers (Q2004853)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7257157
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | \texttt{FASTSET}: a fast data structure for the representation of sets of integers |
scientific article; zbMATH DE number 7257157 |
Statements
\texttt{FASTSET}: a fast data structure for the representation of sets of integers (English)
0 references
7 October 2020
0 references
Summary: We describe a simple data structure for storing subsets of \(\{0, \dots, 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.
0 references
data structures
0 references
bitmask
0 references
set representation
0 references
0.7779015302658081
0 references
0.7690994143486023
0 references
0.7288965582847595
0 references
0.7145910859107971
0 references
