Database - gusenov/kb GitHub Wiki

Overview, birdseye view

From scratch, reinventing a wheel

Books

Wikipedia

IMDB (in-memory database)

Relational

Courses

  • California State University, Long Beach
    • Department of Computer Engineering and Computer Science
      • Database Design with UML and SQL
        • SQL technique
          • Views & indexes
            • An index is a data structure that the database uses to find records within a table more quickly. Indexes are built on one or more columns of a table; each index maintains a list of values within that field that are sorted in ascending or descending order. Rather than sorting records on the field or fields during query execution, the system can simply access the rows in order of the index.
            • Queries versus insertion/update: It might seem as if you should create an index on every column or group of columns that will ever by used in an ORDER BY clause (for example: lastName, firstName). However, each index will have to be updated every time that a row is inserted or a value in that column is updated. Although index structures such as B or B+ trees allow this to happen very quickly, there still might be circumstances where too many indexes would detract from overall system performance.
  • Northeastern University - A University Like No Other
  • Computer Science 831: Knowledge Discovery in Databases

Oracle

Books

MySQL

PostgreSQL

SQLite

RocksDB A persistent key-value store

  • GitHub / facebook/rocksdb A library that provides an embeddable, persistent key-value store for fast storage.

Redis

ODBMS

Object Algebras