Sciweavers

2019 search results - page 270 / 404
» Programming with Shared Data Abstractions
Sort
View
141
Voted
SIGMOD
2010
ACM
377views Database» more  SIGMOD 2010»
15 years 7 months ago
Online aggregation and continuous query support in MapReduce
MapReduce is a popular framework for data-intensive distributed computing of batch jobs. To simplify fault tolerance, the output of each MapReduce task and job is materialized to ...
Tyson Condie, Neil Conway, Peter Alvaro, Joseph M....
ICFP
2010
ACM
15 years 4 months ago
Regular, shape-polymorphic, parallel arrays in Haskell
We present a novel approach to regular, multi-dimensional arrays in Haskell. The main highlights of our approach are that it (1) is purely functional, (2) supports reuse through s...
Gabriele Keller, Manuel M. T. Chakravarty, Roman L...
CGF
2008
125views more  CGF 2008»
15 years 3 months ago
Interactive Visualization for Memory Reference Traces
We present the Memory Trace Visualizer (MTV), a tool that provides interactive visualization and analysis of the sequence of memory operations performed by a program as it runs. A...
A. N. M. Imroz Choudhury, Kristin C. Potter, Steve...
BTW
2005
Springer
107views Database» more  BTW 2005»
15 years 8 months ago
DBMS Architecture - Still an Open Problem
More than two decades ago, DB researchers faced up to the question of how to design a data-independent database management system (DBMS), that is, a DBMS which offers an appropriat...
Theo Härder
ENTCS
2008
120views more  ENTCS 2008»
15 years 3 months ago
Reasoning about B+ Trees with Operational Semantics and Separation Logic
The B+ tree is an ordered tree structure with a fringe list. It is the most widely used data structure for data organisation and searching in database systems specifically, and, p...
Alan P. Sexton, Hayo Thielecke