Technical Perspective: A Write-Optimized Distributed B+Tree Index on Disaggregated Memory
The high-performance tree index uses a lock-free search with versions to resolve read-write conflicts and exclusive locks to resolve write-write conflicts.
Tim Kraska
Advertisement
Author Archives
The Seattle Report on Database Research
Every five years, a group of the leading database researchers meet to reflect on their community's impact on the computing industry as well as examine current research challenges.
Answering Enumeration Queries with the Crowd
Hybrid human/computer database systems promise to greatly expand the usefulness of query processing by incorporating the crowd. Such systems raise many implementation questions. To address the issues, we develop statistical tools that enable users and systems developers to reason about query completeness.
Shape the Future of Computing
ACM encourages its members to take a direct hand in shaping the future of the association. There are more ways than ever to get involved.
Get Involved