Columnstore and B+ tree - are hybrid physical designs important? Dziedzic et al., SIGMOD'18 Earlier this week we looked at the design of column stores and their advantages for analytic workloads. What should you do though if you have a mixed workload including transaction processing, decision support, and operational analytics? Microsoft SQL Server supports hybrid … Continue reading Columnstore and B+ tree – are hybrid physical designs important?
Tag: Datastores
Databases of all shapes and sizes.
The design and implementation of modern column-oriented database systems
The design and implementation of modern column-oriented database systems Abadi et al., Foundations and trends in databases, 2012 I came here by following the references in the Smoke paper we looked at earlier this week. "The design and implementation of modern column-oriented database systems" is a longer piece at 87 pages, but it’s good value-for-time. … Continue reading The design and implementation of modern column-oriented database systems
Smoke: fine-grained lineage at interactive speed
Smoke: fine-grained lineage at interactive speed Psallidas et al., VLDB'18 Data lineage connects the input and output data items of a computation. Given a set of output records, a backward lineage query selects a subset of the output records and asks "which input records contributed to these results?" A forward lineage query selects a subset … Continue reading Smoke: fine-grained lineage at interactive speed
Oblix: an efficient oblivious search index
Oblix: an efficient oblivious search index Mishra et al., IEEE Security & Privacy 2018 Unfortunately, many known schemes that enable search queries on encrypted data achieve efficiency at the expense of security, as they reveal access patterns to the encrypted data. In this paper we present Oblix, a search index for encrypted data that is … Continue reading Oblix: an efficient oblivious search index
EnclaveDB: a secure database using SGX
EnclaveDB: A secure database using SGX Priebe et al., IEEE Security & Privacy 2018 This is a really interesting paper (if you’re into this kind of thing I guess!) bringing together the security properties of Intel’s SGX enclaves with the Hekaton SQL Server database engine. The result is a secure database environment with impressive runtime … Continue reading EnclaveDB: a secure database using SGX
Reducing DRAM footprint with NVM in Facebook
Reducing DRAM footprint with NVM in Facebook Eisenman et al., EuroSys'18 (If you don’t have ACM Digital Library access, the paper can be accessed either by following the link above directly from The Morning Paper blog site). ...to the best of our knowledge, this is the first study on the usage of NVM devices in … Continue reading Reducing DRAM footprint with NVM in Facebook
Anna: A KVS for any scale
Anna: A KVS for any scale Wu et al., ICDE'18 This work comes out of the RISE project at Berkeley, and regular readers of The Morning Paper will be familiar with much of the background. Here’s how Joe Hellerstein puts it in his blog post introducing the work: As researchers, we asked the counter-cultural question: … Continue reading Anna: A KVS for any scale
The case for learned index structures – Part II
The case for learned index structures Kraska et al., arXiv Dec. 2017 Yesterday we looked at the big idea of using learned models in place of hand-coded algorithms for select components of systems software, focusing on indexing within analytical databases. Today we’ll be taking a closer look at range, point, and existence indexes built using … Continue reading The case for learned index structures – Part II
The case for learned index structures – part I
The case for learned index structures Kraska et al., arXiv Dec. 2017 Welcome to another year of papers on The Morning Paper. With the rate of progress in our field at the moment, I can’t wait to see what 2018 has in store for us! Two years ago, I started 2016 with a series of … Continue reading The case for learned index structures – part I
HoTTSQL: Proving query rewrites with univalent SQL semantics
HoTTSQL: Proving query rewrites with univalent SQL semantics Chu et al., PLDI’17 Query rewriting is a vital part of SQL query optimisation, in which rewrite rules are applied to a query to transform it into forms with (hopefully!) a lower execution cost. Clearly when a query is rewritten we still want it to mean the … Continue reading HoTTSQL: Proving query rewrites with univalent SQL semantics
the morning paper 