S-storage operators

International audienceIn 1990, J.L. Krivine introduced the notion of storage operator to simulate, for Church integers, the ``call by value'' in a context of a ``call by name'' strategy. In this present paper, we define, for every $\lambda$-term S which realizes the successor function on Church integers, the notion of S-storage operator. We prove that every storage operator is a $S-storage operator. But the converse is not always true

Deductive Optimization of Relational Data Storage

Optimizing the physical data storage and retrieval of data are two key database management problems. In this paper, we propose a language that can express a wide range of physical database layouts, going well beyond the row- and column-based methods that are widely used in database management systems. We use deductive synthesis to turn a high-level relational representation of a database query into a highly optimized low-level implementation which operates on a specialized layout of the dataset. We build a compiler for this language and conduct experiments using a popular database benchmark, which shows that the performance of these specialized queries is competitive with a state-of-the-art in memory compiled database system

Quantum memory for entangled two-mode squeezed states

A quantum memory for light is a key element for the realization of future quantum information networks. Requirements for a good quantum memory are (i) versatility (allowing a wide range of inputs) and (ii) true quantum coherence (preserving quantum information). Here we demonstrate such a quantum memory for states possessing Einstein-Podolsky-Rosen (EPR) entanglement. These multi-photon states are two-mode squeezed by 6.0 dB with a variable orientation of squeezing and displaced by a few vacuum units. This range encompasses typical input alphabets for a continuous variable quantum information protocol. The memory consists of two cells, one for each mode, filled with cesium atoms at room temperature with a memory time of about 1msec. The preservation of quantum coherence is rigorously proven by showing that the experimental memory fidelity 0.52(2) significantly exceeds the benchmark of 0.45 for the best possible classical memory for a range of displacements.Comment: main text 5 pages, supplementary information 3 page

Formal Representation of the SS-DB Benchmark and Experimental Evaluation in EXTASCID

Evaluating the performance of scientific data processing systems is a difficult task considering the plethora of application-specific solutions available in this landscape and the lack of a generally-accepted benchmark. The dual structure of scientific data coupled with the complex nature of processing complicate the evaluation procedure further. SS-DB is the first attempt to define a general benchmark for complex scientific processing over raw and derived data. It fails to draw sufficient attention though because of the ambiguous plain language specification and the extraordinary SciDB results. In this paper, we remedy the shortcomings of the original SS-DB specification by providing a formal representation in terms of ArrayQL algebra operators and ArrayQL/SciQL constructs. These are the first formal representations of the SS-DB benchmark. Starting from the formal representation, we give a reference implementation and present benchmark results in EXTASCID, a novel system for scientific data processing. EXTASCID is complete in providing native support both for array and relational data and extensible in executing any user code inside the system by the means of a configurable metaoperator. These features result in an order of magnitude improvement over SciDB at data loading, extracting derived data, and operations over derived data.Comment: 32 pages, 3 figure