Relational Database
A database management system that organizes data in tabular form and establishes relationships between tables through primary and foreign keys. It provides transaction support, data consistency guarantees, and mature query optimization mechanisms, making it the predominant choice for enterprise core business systems.
Core Facts
Timeline (last 90 days)
关系型数据库虽然支持JOIN，但在深度可变的多跳路径查询上需要递归CTE，性能和表达力都不如图数据库。
Traditional relational databases require multiple JOIN operations to express multi-hop associations, and performance degrades sharply as association depth increases; graph databases store relationships as first-class citizens, so multi-hop query latency is approximately linear in path length.
For multi-hop queries, recursive SQL requires a self-join against the same large table at every hop, intermediate results balloon exponentially with depth, and it comes with the overhead of temporary tables, sorting, and hash indexes.
Traditional relational databases use optimistic locking (version number comparison) or pessimistic locking (row-level locking) to prevent the lost update problem.
A more reasonable approach for an Agent memory system is often a hybrid architecture: structured metadata stored in a relational database, semantic content retrieved with the aid of a vector index, and then rule-based filtering to decide the flow of information back.
Structured filtering performs equality or range queries on existing columns in a relational database (such as contract number, customer ID, date, and status fields), and is essentially a WHERE clause.
B-tree indexes are widely used in relational databases because they support equality comparisons, range conditions, and ordered retrieval, making them suitable for identifiers, timestamps, frequently filtered columns, and many foreign key lookups.
Traditional relational databases are good at exact matching (such as WHERE conditions), but lack the ability to efficiently answer "which stored vectors are closest to the query vector", because this is a geometric problem.
Relational databases remain the mainstream choice for enterprise core business systems, due to transaction support, data consistency guarantees, and mature query optimization mechanisms.
Structured storage (such as relational databases or Redis) is suitable for storing metadata such as failure counts, timestamps, and user types.
All Facts (11)
Relational databases are suited for scenarios with fixed structures such as user accounts and order records, while non-relational databases are suited for scenarios with variable data structures such as content management and real-time logging.
65%Unverified关系型数据库虽然支持JOIN，但在深度可变的多跳路径查询上需要递归CTE，性能和表达力都不如图数据库。
50%UnverifiedTraditional relational databases require multiple JOIN operations to express multi-hop associations, and performance degrades sharply as association depth increases; graph databases store relationships as first-class citizens, so multi-hop query latency is approximately linear in path length.
50%UnverifiedFor multi-hop queries, recursive SQL requires a self-join against the same large table at every hop, intermediate results balloon exponentially with depth, and it comes with the overhead of temporary tables, sorting, and hash indexes.
50%UnverifiedTraditional relational databases use optimistic locking (version number comparison) or pessimistic locking (row-level locking) to prevent the lost update problem.
50%UnverifiedA more reasonable approach for an Agent memory system is often a hybrid architecture: structured metadata stored in a relational database, semantic content retrieved with the aid of a vector index, and then rule-based filtering to decide the flow of information back.
50%UnverifiedStructured filtering performs equality or range queries on existing columns in a relational database (such as contract number, customer ID, date, and status fields), and is essentially a WHERE clause.
50%UnverifiedB-tree indexes are widely used in relational databases because they support equality comparisons, range conditions, and ordered retrieval, making them suitable for identifiers, timestamps, frequently filtered columns, and many foreign key lookups.
50%UnverifiedTraditional relational databases are good at exact matching (such as WHERE conditions), but lack the ability to efficiently answer "which stored vectors are closest to the query vector", because this is a geometric problem.
50%UnverifiedRelational databases remain the mainstream choice for enterprise core business systems, due to transaction support, data consistency guarantees, and mature query optimization mechanisms.
50%UnverifiedStructured storage (such as relational databases or Redis) is suitable for storing metadata such as failure counts, timestamps, and user types.
50%