CaltechCS122 笔记:Assignment 2: SQL Translation and Joins

Assignment 2: SQL Translation and Joins

NanoDB 是加州理工大学 Caltech CS122 课程使用的教学数据库系统

task

  1. Implement a simple query planner that translates a wide range of parsed SQL expressions into query plans that can be executed
  2. Complete the implementation of a nested-loop join plan-node that supports inner and left-outer joins
  3. Create some automated tests to ensure that your inner- and outer-join support works correctly
    Submit your work along with a design document describing your efforts

DataStuct

General Planner Approach

clause in Select Stmt in a specific order:

  1. WITH
  2. FROM
  3. WHERE
  4. GROUP BY
  5. HAVING
  6. SELECT
  7. ORDER BY
  8. LIMIT / OFFSET

在构造 Planner 的类中,makePlan() 方法的结构如下所示:

PlanNode plan = null;

if (FROM-clause is present)
    plan = generate_FROM_clause_plan();

if (WHERE-clause is present)
    plan = add_WHERE_clause_to(plan);

if (GROUP-BY-clause and/or HAVING-clause is present)
    plan = handle_grouping_and_aggregation(plan);

if (ORDER-BY-clause is present)
    plan = add_ORDER_BY_clause_to(plan);

// There's always a SELECT clause of some sort!
plan = add_SELECT_clause_to(plan);

Grouping and Aggregation

Nested-Loop Join

for tr in r:
    for ts in s:
        if pred(tr, ts):
            add join(tr, ts) to result

Join Type

  1. cross join/ tb1, tb2
  1. inner join
  1. left join
  1. right join
  1. full join

Automated Testing

LimitOffsetNode

posted on   LambdaQ  阅读(38)  评论(0编辑  收藏  举报

相关博文:
阅读排行:
· 阿里最新开源QwQ-32B,效果媲美deepseek-r1满血版,部署成本又又又降低了!
· 开源Multi-agent AI智能体框架aevatar.ai,欢迎大家贡献代码
· Manus重磅发布:全球首款通用AI代理技术深度解析与实战指南
· 被坑几百块钱后,我竟然真的恢复了删除的微信聊天记录!
· 没有Manus邀请码?试试免邀请码的MGX或者开源的OpenManus吧
< 2025年3月 >
23 24 25 26 27 28 1
2 3 4 5 6 7 8
9 10 11 12 13 14 15
16 17 18 19 20 21 22
23 24 25 26 27 28 29
30 31 1 2 3 4 5

统计

点击右上角即可分享
微信分享提示