Deal of The Day! Hurry Up, Grab the Special Discount - Save 25% - Ends In 00:00:00 Coupon code: SAVE25
Welcome to Pass4Success

- Free Preparation Discussions

Oracle 1Z0-184-25 Exam - Topic 2 Question 8 Discussion

Actual exam question for Oracle's 1Z0-184-25 exam
Question #: 8
Topic #: 2
[All 1Z0-184-25 Questions]

You want to quickly retrieve the top-10 matches for a query vector from a dataset of billions of vectors, prioritizing speed over exact accuracy. What is the best approach?

Show Suggested Answer Hide Answer
Suggested Answer: B

For speed over accuracy with billions of vectors, approximate similarity search (ANN) with a low target accuracy setting (B) (e.g., 70%) uses indexes like HNSW or IVF, probing fewer vectors to return top-10 matches quickly. Exact flat search (A) scans all vectors, too slow for billions. Relational filtering with exact search (C) adds overhead without speed gains. Exact search with high accuracy (D) maximizes precision but sacrifices speed. Oracle's documentation recommends ANN for large-scale, speed-focused queries.


Contribute your Thoughts:

0/2000 characters
Nikita
3 months ago
A seems too slow for billions of vectors.
upvoted 0 times
...
Tracey
3 months ago
I agree, B is the way to go for quick results.
upvoted 0 times
...
Jules
4 months ago
Definitely B, speed is key!
upvoted 0 times
...
Serina
4 months ago
C sounds interesting, but I think it’s overkill for speed.
upvoted 0 times
...
Laurene
4 months ago
Wait, can you really get good results with low accuracy?
upvoted 0 times
...
Jeannetta
4 months ago
I keep getting confused between exact and approximate methods. I feel like option C could be a good compromise, but I’m not confident.
upvoted 0 times
...
Catina
4 months ago
I think we practiced a similar question, and if speed is prioritized, then option B makes sense. It’s about finding a balance, right?
upvoted 0 times
...
Jody
5 months ago
I’m not entirely sure, but I feel like exact searches take too long for billions of vectors. Maybe option A is not the right answer?
upvoted 0 times
...
Dahlia
5 months ago
I remember we discussed that speed is crucial here, so I think option B might be the best choice for approximate search.
upvoted 0 times
...
Josphine
5 months ago
Definitely going with option B. Speed is the priority here, and the approximate search should give me the top results I need fast.
upvoted 0 times
...
Bernadine
5 months ago
Relational filtering combined with an exact search could be a good option to balance speed and accuracy. I'll have to explore that approach more.
upvoted 0 times
...
James
5 months ago
I'm a bit confused on this one. Should I go for the exact similarity search or try the approximate approach? Decisions, decisions...
upvoted 0 times
...
Deonna
6 months ago
Okay, I think I know the answer here. Approximate similarity search with a low target accuracy setting seems like the best approach to quickly get the top-10 matches.
upvoted 0 times
...
Viva
6 months ago
Hmm, this is a tricky one. I'll need to think carefully about the trade-offs between speed and accuracy.
upvoted 0 times
...

Save Cancel