Graph Databases, Column Stores, Key Value Stores and Document Databases Flashcards

1
Q

Graph databases

A

This shows data as a mathematical graph

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Advantages and Disadvantages of Graph Databases

A
  • Used in data science as well and can really focus on relationships
  • Often used as parts of larger systems to show the relationships
  • However, can be issues with scaling as the graph gets bigger
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Column Stores

A

They have tables like relational databases but data is stored in columns, not rows. not all rows will have the same number of columns

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Advantages of Column Stores

A
  • The performance of searching for a specific column is much faster
  • It is able to retrieve all info from a column very quickly
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

The Disadvantages of Column Stores

A
  • The performance of searching for a specific row is much slower
  • The performance of adding a new row is not as good as a new value would have to be added to each of the columns
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Hashing

A
  • to directly search the location of desired data on the disk without using index structure
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Advantages and disadvantages of hashing

A
  • Can think of a hash table as being like an array

* BUT – a poor hash function can lead to key collisions

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

Key value stores

A
  • Also known as a Dictionary, rather than a hash table
  • The idea is that a simple key maps to a more complex value
  • Is like an array of keys
  • The values are the records in the table
  • The records can have different fields to each other unlike a relational DB
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Keys in key value stores

A
  • Keys need to be unique to prevent the problem of key collisions
  • Keys should not be too long for performance reasons
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

Values in key value stores

A

• The values can be anything – different databases permit different
data types

• However, can also be more complex such as sets, lists, code, images
or even key-value pairs again encapsulated in an object

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Advantages of key value stores

A

Performance - querying is very quick

Data Variation- values can be different from each other

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

Disadvantages of key value stores

A

Lack of referential integrity - data in different values can contradict each other

Basic querying only - three operations: PUT, GET, DELETE

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

Document Databases

A
  • Use document oriented model to store data
  • They are self contained
  • Similar to key value stores as they have keys
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

Advantages of Document databases

A
  • Good if the data is varied – the documents can all contain different fields
  • Key-value storage approach offers quick performance – fast to load and store documents
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

Disadvantages of document databases

A

Basic operations only- more advanced as key value store but not as advanced as SQL
No normalisation

How well did you know this?
1
Not at all
2
3
4
5
Perfectly