Just-in-Time Data Structures - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2015

Just-in-Time Data Structures


Today, software engineering practices focus on finding the single right data representation (i.e., data structure) for a program. The right data representation, however, might not exist: relying on a single representation of the data for the lifetime of the program can be suboptimal in terms of performance. We explore the idea of developing data structures for which changing the data representation is an intrinsic property. To this end we introduce Just-in-Time Data Structures, which enable representation changes at runtime, based on declarative input from a performance expert programmer. Just-in-Time Data Structures are an attempt to shift the focus from finding the ``right’’ data structure to finding the right sequence of data representations. We present JitDS-Java, an extension to the Java language, to develop Just-in-Time Data Structures. Further, we show two example programs that benefit from changing the representation at runtime.
Fichier principal
Vignette du fichier
onward15-de-wael-et-al-just-in-time-data-structures.pdf (370.27 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01205343 , version 1 (25-09-2015)



Mattias de Wael, Stefan Marr, Joeri de Koster, Jennifer B. Sartor, Wolfgang de Meuter. Just-in-Time Data Structures. Proceedings of the 2015 ACM International Symposium on New Ideas, New Paradigms, and Reflections on Programming & Software, Oct 2015, Pittsburgh, PA, United States. ⟨10.1145/2814228.2814231⟩. ⟨hal-01205343⟩
293 View
627 Download



Gmail Facebook Twitter LinkedIn More