University of Twente Student Theses
Extending Java Collections for List and Set Data Structures
Pasquarelli, Leonardo (2022) Extending Java Collections for List and Set Data Structures.
|
PDF
714kB |
| Abstract: | Java is a widely used programming language, running on different devices and used by many businesses. The Java Collections Framework is the official backbone of data structure and algorithm related matters. Nowadays, there are other Collections frameworks, providing data structures. However, such frameworks can provide a much better performance than the Java Collections. This raises the question of how the Java Collections can be modified or extended to achieve greater performance. We investigated how this could be achieved for data structures that base their implementations on the List and the Set data structure. Our benchmarks showed that Unrolled Linked Lists and Skip Lists provide a faster List data structure, and that Bloom Filters provide a much lower memory consumption than sets. |
| Item Type: | Essay (Bachelor) |
| Faculty: | EEMCS: Electrical Engineering, Mathematics and Computer Science |
| Subject: | 54 computer science |
| Programme: | Computer Science BSc (56964) |
| Link to this item: | https://purl.utwente.nl/essays/91726 |
| Export this item as: | BibTeX EndNote HTML Citation Reference Manager |
Show download statistics for this publication
Show download statistics for this publicationRepository Staff Only: item control page