Efficient Data Access Paths for Mixed Vector-Relational Search
<|reference_start|>Efficient Data Access Paths for Mixed Vector-Relational Search: The rapid growth of machine learning capabilities and the adoption of data processing methods using vector embeddings sparked a great interest in creating systems for vector data management. While the predominant approach of vector data management is to use specialized index structures for fast search over the entirety of the vector embeddings, once combined with other (meta)data, the search queries can also become selective on relational attributes - typical for analytical queries. As using vector indexes differs from traditional relational data access, we revisit and analyze alternative access paths for efficient mixed vector-relational search.   We first evaluate the accurate but exhaustive scan-based search and propose hardware optimizations and alternative tensor-based formulation and batching to offset the cost. We outline the complex access-path design space, primarily driven by relational selectivity, and the decisions to consider when selecting an exhaustive scan-based search against an approximate index-based approach. Since the vector index primarily avoids expensive computation across the entire dataset, contrary to the common relational knowledge, it is better to scan at lower selectivity and probe at higher, with a cross-point between the two approaches dictated by data dimensionality and the number of concurrent search queries.<|reference_end|>
@article{sanca2024efficient,
    title={Efficient Data Access Paths for Mixed Vector-Relational Search},
    author={Viktor Sanca and Anastasia Ailamaki},
    journal={arXiv preprint arXiv:2403.15807},
    year={2024},
    archivePrefix={arXiv},
    eprint={2403.15807},
    primaryClass={cs.DB cs.AI cs.AR cs.LG}
}