Data Structure Fusion

13 years 4 months ago

Download theory.stanford.edu

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.

Peter Hawkins, Alex Aiken, Kathleen Fisher, Martin

Real-time Traffic

Abstract Data Types | APLAS 2010 | Concrete Shared Representations | Programming Languages | Relational Algebra |

claim paper

» Fusion of Range and Visual Data for the Extraction of Scene Structure Information

» Shortcut Fusion of Monadic Programs

» Energy Efficient Routing for Statistical Inference of Markov Random Fields

» Implications for domain fusion proteinprotein interactions based on structural information

» Short Cut Fusion Proved and Improved

» AudioVisual Classification and Fusion of Spontaneous Affective Data in Likelihood Space

» Information Fusion for Multicamera and Multibody Structure and Motion

» Streaming RepresentationChangers

Post Info
More Details (n/a)

Added	05 Dec 2010
Updated	05 Dec 2010
Type	Conference
Year	2010
Where	APLAS
Authors	Peter Hawkins, Alex Aiken, Kathleen Fisher, Martin C. Rinard, Mooly Sagiv

Comments (0)

Sciweavers

Data Structure Fusion

Abstract Data Types | APLAS 2010 | Concrete Shared Representations | Programming Languages | Relational Algebra |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers