10 papers · 1 filter
Common-Neighbor-Count-Based Representative Possible World Finding on Uncertain Graphs
Chengjie Gu, Xiaoliang Xu, Yuxiang Wang +5
A representative possible world (RPW) is a deterministic graph derived from an uncertain graph where a designated structural feature closely approximates its expected…
Beyond Relational: Semantic-Aware Multi-Modal Analytics with LLM-Native Query Optimization
Junhao Zhu, Lu Chen, Xiangyu Ke +4
Multi-modal analytical processing has the potential to transform applications in e-commerce, healthcare, entertainment, and beyond. However, real-world adoption remains elusive due…
Balancing the Blend: An Experimental Analysis of Trade-offs in Hybrid Search
Mengzhao Wang, Boyu Tan, Yunjun Gao +5
Hybrid search, the integration of lexical and semantic retrieval, has become a cornerstone of modern information retrieval systems, driven by demanding applications like Retrieval-…
Scalable Graph Indexing using GPUs for Approximate Nearest Neighbor Search
Zhonggen Li, Xiangyu Ke, Yifan Zhu +3
Approximate nearest neighbor search (ANNS) in high-dimensional vector spaces has a wide range of real-world applications. Numerous methods have been proposed to handle ANNS efficie…
Stitching Inner Product and Euclidean Metrics for Topology-aware Maximum Inner Product Search
Tingyang Chen, Cong Fu, Xiangyu Ke +3
Maximum Inner Product Search (MIPS) is a fundamental challenge in machine learning and information retrieval, particularly in high-dimensional data applications. Existing approache…
Maximum Inner Product is Query-Scaled Nearest Neighbor
Tingyang Chen, Cong Fu, Kun Wang +5
Maximum Inner Product Search (MIPS) for high-dimensional vectors is pivotal across databases, information retrieval, and artificial intelligence. Existing methods either reduce MIP…