Q: 8
How does the structure of vector databases differ from traditional relational databases?
Options
Discussion
Option C, Official Oracle docs and some hands-on lab examples make it clear, vector DBs focus on similarities in high-dimensional space, not just rows or columns like relational databases.
Not B, C. Quick question: are we looking for what fundamentally separates vector from relational databases or just querying style? If the question was about data format only, I'd consider A.
Why not D if the physical schema still uses rows but logic is about similarity?
Its D for me since both regular and vector DBs can use rows as a storage concept. I figured the main difference was how data is stored physically, not just searched. Pretty sure I saw an Oracle whitepaper mention row-based components in some vector database setups, so that's why I went with D. C is convincing if they're talking query behavior instead though.
C imo , not D. Trap is thinking storage means structure but it's really about working with vectors and similarity.
C or D. Kinda tempted by D since both store rows, but pretty sure vector DBs are mainly about the vector space and finding data by similarity, which is C. Saw a similar one on another practice set that tripped me up though.
Be respectful. No spam.