docs.aws.amazon.com/amazondynamodb/latest/developerguide/bp-adjacency-graphs.html
1 Users
0 Comments
22 Highlights
0 Notes
Tags
Top Highlights
Materialized graph pattern
Best practices for managing many-to-many relationships
Adjacency list design pattern
The partition key in this example is either an InvoiceID or a BillID
BillID partitions have all attributes specific to bill
all bills for an invoi
all invoices that contain a part of a bill
global secondary index on the table's sort key.
dges and nodes of the graph.
he first global secondary index is built on the Data attribute
index several different attribute types, namely Dates, Names, Places, and Skill
one global secondary index is effectively indexing four different attributes.
highly efficient real-time
Adjacency lists are a design pattern that is useful for modeling many-to-many relationsh
artition ke
nodes
edges
invoices contain multiple bills
One bill can belong in multiple invoices
The advantages of this pattern include minimal data duplication and simplified query patterns to find all entities (nodes) related to a target entity (having an edge to a target node).
Glasp is a social web highlighter that people can highlight and organize quotes and thoughts from the web, and access other like-minded people’s learning.