recentpopularlog in

sql

« earlier   
The Case for Learned Index Structures – Arxiv Vanity
Indexes are models: a B-Tree-Index can be seen as a model to map a key to the position of a record within a sorted array, a Hash-Index as a model to map a key to a position of a record within an unsorted array, and a BitMap-Index as a model to indicate if a data record exists or not. In this exploratory research paper, we start from this premise and posit that all existing index structures can be replaced with other types of models, including deep-learning models, which we term learned indexes. The key idea is that a model can learn the sort order or structure of lookup keys and use this signal to effectively predict the position or existence of records. We theoretically analyze under which conditions learned indexes outperform traditional index structures and describe the main challenges in designing learned index structures. Our initial results show, that by using neural nets we are able to outperform cache-optimized B-Trees by up to 70% in speed while saving an order-of-magnitude in memory over several real-world data sets. More importantly though, we believe that the idea of replacing core components of a data management system through learned models has far reaching implications for future systems designs and that this work just provides a glimpse of what might be possible.
database  data-model  SQL  indexing  data-design  schema-design  automation 
4 days ago by tarakc02
exercism.io - Level up your programming skills
Download and solve practice problems in over 30 different languages.
Submit the solution to the site for feedback (beta).
For code newbies and experienced programmers.
programming  education  profdev  c  c++  c#  clojure  coffeescript  lisp  javascript  elixir  emacs  erlang  f#  go  haskell  java  julia  lua  assembly  ocaml  objectivec  php  sql  perl  python  r  racket  ruby  rust  scala  scheme  swift  typescript 
4 days ago by Chirael

Copy this bookmark:





to read