FASTSET: A Fast Data Structure for the Representation of Sets of Integers
Dipartimento di Scienze Matematiche, Informatiche e Fisiche, University of Udine, Via delle Scienze 206, 33100 Udine, Italy
Dipartimento di Ingegneria dell’Informazione, University of Padova, Via Gradenigo 6/A, 35131 Padova, Italy
Author to whom correspondence should be addressed.
Received: 9 April 2019 / Revised: 23 April 2019 / Accepted: 24 April 2019 / Published: 1 May 2019
PDF [1007 KB, uploaded 13 May 2019]
We describe a simple data structure for storing subsets of
, 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.
This is an open access article distributed under the Creative Commons Attribution License
which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).
Share & Cite This Article
MDPI and ACS Style
Lancia, G.; Dalpasso, M. FASTSET: A Fast Data Structure for the Representation of Sets of Integers. Algorithms 2019, 12, 91.
Lancia G, Dalpasso M. FASTSET: A Fast Data Structure for the Representation of Sets of Integers. Algorithms. 2019; 12(5):91.
Lancia, Giuseppe; Dalpasso, Marcello. 2019. "FASTSET: A Fast Data Structure for the Representation of Sets of Integers." Algorithms 12, no. 5: 91.
Show more citation formats
Show less citations formats
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.
[Return to top]
For more information on the journal statistics, click here
Multiple requests from the same IP address are counted as one view.