Intel "big data" science and technology center vision and execution plan
ACM SIGMOD RecordPublished 1 May 2013
Michael Stonebraker, Samuel Madden, Pradeep Dubey
Citations41
SJR quartileQ2
SJR score0.69
SNIP0.92
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
The big data vision of this technology center and the execution plan for the first few years are presented.
Abstract
Intel has moved to a collaboration model with universities consisting of "Science and Technology Centers" (ISTCs). These are located at a "hub" university with participation from other universities, contain embedded Intel personnel, and are focused on some research theme. Intel held a national competition for a 5th Science and Technology center in 2012 and selected a proposal from M.I.T. with a theme of "Big Data". This paper presents the big data vision of this technology center and the execution plan for the first few years.
Keywords
Computer ScienceDecision Sciences
Similarity Search in High Dimensions via Hashing
3,108 Citations1999Aristides Gionis, Piotr Indyk +1 more
Experimental results indicate that the novel scheme for approximate similarity search based on hashing scales well even for a relatively large number of dimensions, and provides experimental evidence that the method gives improvement in running time over other methods for searching in highdimensional spaces based on hierarchical tree decomposition.
The Design of the Borealis Stream Processing Engine
1,232 Citations2005Daniel J. Abadi, Yanif Ahmad +10 more
This paper outlines the basic design and functionality of Borealis, and presents a highly flexible and scalable QoS-based optimization model that operates across server and sensor networks and a new fault-tolerance model with flexible consistency-availability trade-offs.
Lecture notes in computer scienceStreamIt: A Language for Streaming Applications
1,107 Citations2002William Thies, Michal Karczmarek +1 more
The StreamIt language provides novel high-level representations to improve programmer productivity and program robustness within the streaming domain and the StreamIt compiler aims to improve the performance of streaming applications via stream-specific analyses and optimizations.
Calvin
524 Citations2012Alexander Thomson, Thaddeus Diamond +4 more
Calvin is a practical transaction scheduling and data replication layer that uses a deterministic ordering guarantee to significantly reduce the normally prohibitive contention costs associated with distributed transactions.
Query Processing, Resource Management, and Approximation ina Data Stream Management System
340 Citations2002Rajeev Motwani, Jennifer Widom +8 more
This paper describes the ongoing work developing the Stanford Stream Data Manager (STREAM), a system for executing continuous queries over multiple continuous data streams that supports a declarative query language.
Computer Graphics Forum<i>imMens</i>: Real‐time Visual Querying of Big Data
318 Citations2013Zhicheng Liu, Biye Jiang +1 more
Methods for interactive visualization of big data, following the principle that perceptual and interactive scalability should be limited by the chosen resolution of the visualized data, not the number of records are presented.
OLTP through the looking glass, and what we found there
299 Citations2008Stavros Harizopoulos, Daniel J. Abadi +2 more
Overall, overheads and optimizations that explain a total difference of about a factor of 20x in raw performance are identified and it is shown that there is no single "high pole in the tent" in modern (memory resident) database systems, but that substantial time is spent in logging, latching, locking, B-tree, and buffer management operations.
ZStream
211 Citations2009Mei Yuan, Samuel Madden
A cost model can accurately capture the actual runtime behavior of a plan, and that choosing the optimal plan can result in a factor of four or more speedup versus an NFA based approach, and a dynamic programming algorithm is described used in this cost model to efficiently search for an optimal query plan for a given pattern.
Data Curation at Scale: The Data Tamer System
170 Citations2013Michael Stonebraker, Daniel Brückner +6 more
Data Tamer is described, an end-to-end curation system built at M.I.T. Brandeis, and Qatar Computing Research Institute, and it has been shown to lower curation cost by about 90%, relative to the currently deployed production software.
Lecture notes in computer scienceThe Architecture of SciDB
167 Citations2011Michael Stonebraker, Paul Brown +2 more
This paper presents the main design decisions of SciDB, including decisions concerning a high-level, SQL-like query language, the issues facing the query optimizer and executor and efficient storage management for arrays.
Rethinking main memory OLTP recovery
139 Citations2014Nirmesh Malviya, Ariel Weisberg +2 more
This paper proposes a lighter weight, coarse-grained command logging technique which only records the transactions that were executed on the database, and found that command logging can offer 1.5 x higher throughput than a main-memory optimized implementation of ARIEs-style physiological logging.
ArrayStore
122 Citations2011Emad Soroush, Magdalena Bałazińska +1 more
It is shown that ArrayStore outperforms previously proposed storage management strategies in the context of its diverse target workload, and develops a new and efficient storage-management mechanism that enables parallel processing of operations that must access data from adjacent partitions.
Dynamic distributed dimensional data model (D4M) database and computation system
109 Citations2012Jeremy Kepner, William Arcand +14 more
D4M (Dynamic Distributed Dimensional Data Model) has been developed to provide a mathematically rich interface to tuple stores (and structured query language “SQL” databases) and it is possible to create composable analytics with significantly less effort than using traditional approaches.
Minds at UW (University of Wisconsin)The Performance of Concurrency Control Algorithms for Database Management Systems
90 Citations1984Michael J. Carey, Michael Stonebraker
This paper describes a study of the performance of centralized concurrency control algorithms and shows that in general, locking algorithms provide the best performance.
Efficient Versioning for Scientific Array Databases
39 Citations2012Adam Seering, Philippe Cudré-Mauroux +2 more
This paper describes a versioned database storage manager for SciDB, designed to efficiently store and retrieve array-oriented data, exposing a "no-overwrite" storage model in which each update creates a new "version" of an array.
SubZero: A fine-grained lineage system for scientific databases
37 Citations2013Eugene Wu, Samuel Madden +1 more
A set of common semantics that can be leveraged to efficiently store fine-grained lineage representations that efficiently capture common locality properties in the lineage data are defined, and a set of APIs are introduced so operator developers can easily export lineage information from user defined operators.
Time travel in a scientific array database
30 Citations2013Emad Soroush, Magdalena Bałazińska
TimeArr is presented, a new storage manager for an array database that supports the creation of a sequence of versions of each stored array and their exploration through two types of time travel operations: selection of a specific version of a (sub)-array and a more general extraction of a(sub-array history) in the form of a series of ( sub-array versions.
Design and evaluation of a compiler for embedded stream programs
29 Citations2008Ryan Newton, Lewis Girod +3 more
WaveScript is a domain-specific language that brings high-level, type-safe, garbage-collected programming to these domains, and is used to build and deploy a sensornetwork for the acoustic localization of wild animals, in particular, the Yellow-Bellied marmot.
Proceedings of the VLDB EndowmentA demonstration of DBWipes
23 Citations2012Eugene Wu, Samuel Madden +1 more
DBWipes is presented, a novel data cleaning system that allows users to execute aggregate queries, and interactively detect, understand, and clean errors in the query results.
Parallel and distributed computing and systemsDirectoryless Shared Memory Coherence using Execution Migration
11 Citations2011Mieszko Lis, Keun Sup Shim +3 more
This work argues that with EM scaling performance has much lower cost and design complexity than in directorybased coherence and traditional NUCA architectures: by merely scaling network bandwidth from 256 to 512 bit flits, the performance of the architecture improves by an additional 13%, while the baselines show negligible improvement.