As data and data structures grown more complex in computing, the task of storing and accessing such data efficiently also becomes more complex. Object-oriented programming languages such as Java have popularized the practice of using class-based objects and created the challenge of persisting these complex objects to storage systems such as databases which only store simple scalar values. This paper seeks to explore and compare a selected num-ber of popular persistence solutions for the Java language in their use and per-formance. This is done through researching, implementing and performance testing the chosen candidates. Through these steps we have found that while more abstracted solutions provided easier implementation and usage, these positives come with the disadvantages of generally slower performance. We also discovered that while many persistence frameworks provide features that minimize the amount of code required for implementation, they suffer from performance issues such as the N+1 query issue if not configured or utilized correctly.
| Identifer | oai:union.ndltd.org:UPSALLA1/oai:DiVA.org:lnu-57667 |
| Date | January 2016 |
| Creators | Sun, Ang |
| Publisher | Linnéuniversitetet, Institutionen för datavetenskap (DV) |
| Source Sets | DiVA Archive at Upsalla University |
| Language | English |
| Detected Language | English |
| Type | Student thesis, info:eu-repo/semantics/bachelorThesis, text |
| Format | application/pdf |
| Rights | info:eu-repo/semantics/openAccess |
Page generated in 0.0025 seconds