Choose model based on read/write patterns and depth. WHY: Hierarchy queries (ancestors, descendants, paths) vary in cost across models. OPTIONS: (1) Adjacency list (parent_id)—simple, recursive CTEs; expensive for deep trees. (2) Path enumeration (/1/2/5/)—fast reads, costly updates. (3) Closure table (ancestor, descendant, depth)—excellent read-heavy; extra storage. (4) Nested sets—complex updates....
The complete answer continues with detailed implementation patterns, architectural trade-offs, and production-grade considerations. It covers performance optimization strategies, common pitfalls to avoid, and real-world examples from companies like Goldman Sachs. The answer also includes follow-up discussion points that interviewers commonly explore.
Continue Reading the Full Answer
Unlock the complete expert answer with code examples, trade-offs, and pro tips - plus 1,863+ more.
Or upgrade to Platform Pro - $39
Engineers who used these answers got offers at
AmazonDatabricksSnowflakeGoogleMeta
According to DataEngPrep.tech, this is one of the most frequently asked General/Other interview questions, reported at 1 company. DataEngPrep.tech maintains a curated database of 1,863+ real data engineering interview questions across 7 categories, verified by industry professionals.