Everything You Can Do with 5M Vectors(myscale.com)
myscale.com
Everything You Can Do with 5M Vectors
https://myscale.com/blog/everything-you-can-do-with-5-million-vectors/
3 comments
Curious about the MSTG algorithm. How does it boost accuracy and speed in vector searches?
MSTG combines the best parts of both hierarchical graph and tree structures in its design.
A graph algorithm excels at initial convergence, and is usually faster at unfiltered search. However, its efficiency is severely hampered in filtered search. On the other hand, tree algorithms are slower and have lower accuracy for unfiltered search, but tree traversal is unaffected by filtered elements and retains performance for filtered search, as illustrated in the figure below. Therefore, combining these two algorithms in MSTG yields high performance and high accuracy for both cases and achieves fast index build time.
You can learn more from this blog: https://myscale.com/blog/optimizing-filtered-vector-search/
A graph algorithm excels at initial convergence, and is usually faster at unfiltered search. However, its efficiency is severely hampered in filtered search. On the other hand, tree algorithms are slower and have lower accuracy for unfiltered search, but tree traversal is unaffected by filtered elements and retains performance for filtered search, as illustrated in the figure below. Therefore, combining these two algorithms in MSTG yields high performance and high accuracy for both cases and achieves fast index build time.
You can learn more from this blog: https://myscale.com/blog/optimizing-filtered-vector-search/
Interesting
what if I am not familiar with SQL but would like to leverage this tool more smoothly?
what if I am not familiar with SQL but would like to leverage this tool more smoothly?