Abstract
We consider the problem of specifying data structures with complex sharing in a manner that is both declarative and results in provably correct code. In our approach, abstract data types are specified using relational algebra and functional dependencies; a novel fuse operation on relational indexes specifies where the underlying physical data structure representation has sharing. We permit the user to specify different concrete shared representations for relations, and show that the semantics of the relational specification are preserved. © 2010 Springer-Verlag.
Cite
CITATION STYLE
Hawkins, P., Aiken, A., Fisher, K., Rinard, M., & Sagiv, M. (2010). Data structure fusion. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6461 LNCS, pp. 204–221). https://doi.org/10.1007/978-3-642-17164-2_15
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
