B-tree indexes for high update rates
ACM SIGMOD Record
Predictable performance for unpredictable workloads
Proceedings of the VLDB Endowment
From cooperative scans to predictive buffer management
Proceedings of the VLDB Endowment
| Hi-index | 0.00 |
This demonstration presents Crescando, an implementation of a distributed relational table that guarantees predictable response time on unpredictable workloads. In Crescando, data is stored in main memory and accessed via full-table scans. By using scans instead of index lookups, Crescando overcomes the read-write contention in index structures and eliminates the scalability issues that exist in traditional index-based systems. Crescando is specifically designed to process a large number of queries in parallel, allowing high query rates. The goal of this demonstration is to show the ability of Crescando to a) quickly answer arbitrary user-generated queries, and b) execute a large number of queries and updates in parallel, while providing strict response time and data freshness guarantees.