Please use this identifier to cite or link to this item: http://hdl.handle.net/20.500.11889/8030
DC FieldValueLanguage
dc.contributor.authorSalhi, Haythamen_US
dc.contributor.authorOdeh, Ferasen_US
dc.contributor.authorNasser, Rabeeen_US
dc.contributor.authorTaweel, Adelen_US
dc.date.accessioned2023-10-16T06:05:36Z-
dc.date.available2023-10-16T06:05:36Z-
dc.date.issued2017-
dc.identifier.urihttp://hdl.handle.net/20.500.11889/8030-
dc.description.abstractIn this paper, we studied the performance of two popular open source distributed cache systems (Hazelcast and Infinispan) indifferently. The conducted performance analysis shows that Infinispan outperforms Hazelcast in the simple data retrieval scenarios as well as most of SQL-like queries scenarios, whereas Hazelcast outperforms Infinispan in SQLlike queries for small data sizes.en_US
dc.language.isoen_USen_US
dc.subjectBenchmarkingen_US
dc.subjectElectronic data processingen_US
dc.subjectInformation retrievalen_US
dc.subjectDatabase managementen_US
dc.subjectInfinispanen_US
dc.titleOpen source in-memory data grid systems: benchmarking hazelcast and infinispan.en_US
dc.typeArticleen_US
newfileds.departmentEngineering and Technologyen_US
newfileds.item-access-typeopen_accessen_US
newfileds.thesis-prognoneen_US
newfileds.general-subjectnoneen_US
item.languageiso639-1other-
item.fulltextWith Fulltext-
item.grantfulltextopen-
Appears in Collections:Fulltext Publications
Files in This Item:
File Description SizeFormat
Open Source In-Memory Data Grid Systems- Benchmarking Hazelcast and Infinispan.pdf618.88 kBAdobe PDFView/Open
Show simple item record

Page view(s)

19
checked on May 13, 2024

Download(s)

8
checked on May 13, 2024

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.