Author pages are created from data sourced from our academic publisher partnerships and public sources.
Share This Author
C-Store: A Column-oriented DBMS
Preliminary performance data on a subset of TPC-H is presented and it is shown that the system the team is building, C-Store, is substantially faster than popular commercial products.
A comparison of approaches to large-scale data analysis
A benchmark consisting of a collection of tasks that are run on an open source version of MR as well as on two parallel DBMSs shows a dramatic performance difference between the two paradigms.
Linear Road: A Stream Data Management Benchmark
Monitoring Streams - A New Class of Data Management Applications
H-store: a high-performance, distributed main memory transaction processing system
The demonstration presented here provides insight on the development of a distributed main memory OLTP database and allows for the further study of the challenges inherent in this operating environment.
The End of an Architectural Era (It's Time for a Complete Rewrite)
- M. Stonebraker, S. Madden, D. Abadi, S. Harizopoulos, N. Hachem, Pat Helland
- Computer ScienceVLDB
- 23 September 2007
The current RDBMS code lines, while attempting to be a "one size fits all" solution, in fact, excel at nothing and should be retired in favor of a collection of "from scratch" specialized engines.
The 8 requirements of real-time stream processing
Eight requirements that a system software should meet to excel at a variety of real-time stream processing applications are outlined to provide high-level guidance to information technologists so that they will know what to look for when evaluation alternative stream processing solutions.
Load Shedding in a Data Stream Manager
Aurora: a new model and architecture for data stream management
The basic processing model and architecture of Aurora, a new system to manage data streams for monitoring applications, are described and a stream-oriented set of operators are described.
Implementation techniques for main memory database systems
- D. DeWitt, R. Katz, F. Olken, L. Shapiro, M. Stonebraker, D. Wood
- Computer ScienceSIGMOD '84
- 18 June 1984
This paper considers the changes necessary to permit a relational database system to take advantage of large amounts of main memory, and evaluates AVL vs B+-tree access methods, hash-based query processing strategies vs sort-merge, and study recovery issues when most or all of the database fits in main memory.