RuntimeSave: A Graph Database of Runtime Values
This program is tentative and subject to change.
To persist variable values from running programs for development purposes, we currently recognize two strategies. Techniques based on examples are only useful to store small sample objects, while record-and-replay techniques are efficient but use opaque storage formats. We lack a middle ground offering acceptable scalability and easy queryability with standard tools. In this work-in-progress paper, we present RuntimeSave – a versatile approach to saving runtime values from the Java Virtual Machine (JVM) into a persistent Neo4j graph database. Its core idea is a two-layer graph model consisting of hashed and metadata nodes, inspired by Git internals. To reduce the written data volume, it packs certain object graph shapes into simpler ones and hashes them to provide partial deduplication. We also report a preliminary evaluation, applications, and future work ideas.
This program is tentative and subject to change.
Wed 15 OctDisplayed time zone: Perth change
16:00 - 17:40 | |||
16:00 25mResearch paper | MaTSa: Race Detection in Java VMIL Alexandros Emmanouil Antonakakis ICS-FORTH & University of Crete, Polyvios Pratikakis University of Crete, Angelos Bilas University of Crete and FORTH, Greece, Foivos S. Zakkak Red Hat, Iacovos Kolokasis University of Crete | ||
16:25 25mResearch paper | Memory Tiering in Python Virtual MachineRemote VMIL Yuze Li Virginia Tech, Shunyu Yao Virginia Tech, Jaiaid Mobin Rochester Institute of Technology, Tianyu Zhan Virginia Tech, M. Mustafa Rafique Rochester Institute of Technology, Dimitrios Nikolopoulos Virginia Tech, Kirshanthan Sundararajah Virginia Tech, Ali R. Butt Virginia Tech | ||
16:50 15mShort-paper | RuntimeSave: A Graph Database of Runtime Values VMIL Matúš Sulír Technical University of Košice, Antonia Bertolino Gran Sasso Science Institute, Guglielmo De Angelis CNR-IASI Pre-print | ||
17:05 5mDay closing | Closing VMIL |