← 返回刚才阅读的位置

知识卡片

普通读书笔记卡 · 621.g

图数据库显式保存关系

理解等级:高级

图数据库用节点保存实体和属性,用带方向与类型的边显式保存关系。沿边遍历适合关系密集读取,避免每次查询临时推导连接;方向混淆会使查询失真。图难分片,写扩展受产品设计限制。关系类型变更也需访问两端、建新边并删旧边,因此不是零成本重命名。

这张卡片看不懂?

已有反馈 · 0 条

    还没有人提交反馈。

    在整书笔记中的位置

    原书出处 · 1 处

    • 拆分操作数据 · 查看原书依据

      Unlike relational databases, where relations are implied based on references, graph databases use nodes to store entities and their properties. These nodes are connected with edges, also known as relationships, which are explicit objects. Nodes are organized by relationships and allow for analysis of the connected data by traversing along specific edges.

    参考来源

    - 位置:《Software Architecture: The Hard Parts》第06章《拆分操作数据》(来源项目:book-sources;源文件:extracted/Software Architecture The Hard Parts Modern Trade-Off Analyses for Distributed Architectures (Neal Ford, Mark Richards, Pramod Sadalage etc.)/_epub-src/OEBPS/ch06.xhtml) - 结论依据:所引连续原文给出本卡机制或取舍;条件与示例结合本节已读上下文解释。 - 原始内容:Unlike relational databases, where relations are implied based on references, graph databases use nodes to store entities and their properties. These nodes are connected with edges, also known as relationships, which are explicit objects. Nodes are organized by relationships and allow for analysis of the connected data by traversing along specific edges.