Infant mortality and generational garbage collection
ACM SIGPLAN Notices
The generic graph component library
Proceedings of the 14th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Set-Oriented Disk Access to Large Complex Objects
Proceedings of the Fifth International Conference on Data Engineering
Automated statistical approach for memory leak detection: case studies
OTM'11 Proceedings of the 2011th Confederated international conference on On the move to meaningful internet systems - Volume Part II
| Hi-index | 0.00 |
Memory leaks are major problems in distributed applications, depleting their performance, even if they run on platforms with automatic memory management like Java Virtual Machine. In the context of a Java memory leak detection tool, we faced a need for a graph storage and traversal library that could operate in memory restrained conditions with certain performance requirements. Before implementing a custom library we have evaluated existing open source graph libraries like JGraphT, Jung, jdsl, hgdb, Annas, HyperGraphDB, Dex and Neo4j, that can be used by embedding rather than a separate graph database process. Criteria for the comparison include size of the graph on disk, cpu and memory requirement for performing the shortest path search, license agreement terms. From this evaluation it is observed that graph databases become ideal choice only when hardware can be scaled for large problems, making it necessary for tailored solutions for managing large graphs in embedded environment.