Search Results for author: Xiaoliang Xu

Found 7 papers, 5 papers with code

Starling: An I/O-Efficient Disk-Resident Graph Index Framework for High-Dimensional Vector Similarity Search on Data Segment

1 code implementation4 Jan 2024 Mengzhao Wang, Weizhi Xu, Xiaomeng Yi, Songlin Wu, Zhangyang Peng, Xiangyu Ke, Yunjun Gao, Xiaoliang Xu, Rentong Guo, Charles Xie

In this paper, we present Starling, an I/O-efficient disk-resident graph index framework that optimizes data layout and search strategy within the segment.

MUST: An Effective and Scalable Framework for Multimodal Search of Target Modality

1 code implementation11 Dec 2023 Mengzhao Wang, Xiangyu Ke, Xiaoliang Xu, Lu Chen, Yunjun Gao, Pinpin Huang, Runkai Zhu

We investigate the problem of multimodal search of target modality, where the task involves enhancing a query in a specific target modality by integrating information from auxiliary modalities.

Information Retrieval

Prompting Disentangled Embeddings for Knowledge Graph Completion with Pre-trained Language Model

1 code implementation4 Dec 2023 Yuxia Geng, Jiaoyan Chen, Yuhang Zeng, Zhuo Chen, Wen Zhang, Jeff Z. Pan, Yuxiang Wang, Xiaoliang Xu

Accordingly, we propose a new KGC method named PDKGC with two prompts -- a hard task prompt which is to adapt the KGC task to the PLM pre-training task of token prediction, and a disentangled structure prompt which learns disentangled graph representation so as to enable the PLM to combine more relevant structure knowledge with the text information.

Knowledge Graph Completion Language Modelling

Routing-Guided Learned Product Quantization for Graph-Based Approximate Nearest Neighbor Search

1 code implementation30 Nov 2023 Qiang Yue, Xiaoliang Xu, Yuxiang Wang, Yikun Tao, Xuliyuan Luo

It suffers from the large-scale $\mathcal{X}$ because a PG with full vectors is too large to fit into the memory, e. g., a billion-scale $\mathcal{X}$ in 128 dimensions would consume nearly 600 GB memory.

Quantization

DiskANN++: Efficient Page-based Search over Isomorphic Mapped Graph Index using Query-sensitivity Entry Vertex

no code implementations30 Sep 2023 Jiongkang Ni, Xiaoliang Xu, Yuxiang Wang, Can Li, Jiajie Yao, Shihai Xiao, Xuecang Zhang

The main drawback of graph-based ANNS is that a graph index would be too large to fit into the memory especially for a large-scale $\mathcal{X}$.

Quantization

A Comprehensive Survey and Experimental Comparison of Graph-Based Approximate Nearest Neighbor Search

1 code implementation29 Jan 2021 Mengzhao Wang, Xiaoliang Xu, Qiang Yue, Yuxiang Wang

Approximate nearest neighbor search (ANNS) constitutes an important operation in a multitude of applications, including recommendation systems, information retrieval, and pattern recognition.

Information Retrieval Recommendation Systems +1

Cannot find the paper you are looking for? You can Submit a new open access paper.