5 citations · 6 across the 11 of their papers we have counts for
12 papers
VikingMem: A Memory Base Management System for Stateful LLM-based Applications
Jiajie Fu, Junwen Chen, Mengzhao Wang +5
Large Language Models have revolutionized interactive applications; however, their finite context windows pose a critical data management challenge for maintaining stateful, long-t…
Reveal Hidden Pitfalls and Navigate Next Generation of Vector Similarity Search from Task-Centric Views
Tingyang Chen, Cong Fu, Jiahua Wu +6
Vector Similarity Search (VSS) in high-dimensional spaces is rapidly emerging as core functionality in next-generation database systems for numerous data-intensive services -- from…
All-in-one Graph-based Indexing for Hybrid Search on GPUs
Zhonggen Li, Yougen Li, Yifan Zhu +3
Hybrid search has emerged as a promising paradigm that combines lexical and semantic retrieval, enhancing accuracy for applications such as recommendations, information 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…
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-…
Empowering Graph-based Approximate Nearest Neighbor Search with Adaptive Awareness Capabilities
Jiancheng Ruan, Tingyang Chen, Renchi Yang +2
Approximate Nearest Neighbor Search (ANNS) in high-dimensional spaces finds extensive applications in databases, information retrieval, recommender systems, etc. While graph-based…
CLGNN: A Contrastive Learning-based GNN Model for Betweenness Centrality Prediction on Temporal Graphs
Tianming Zhang, Renbo Zhang, Zhengyi Yang +3
Temporal Betweenness Centrality (TBC) measures how often a node appears on optimal temporal paths, reflecting its importance in temporal networks. However, exact computation is hig…
In-context Clustering-based Entity Resolution with Large Language Models: A Design Space Exploration
Jiajie Fu, Haitong Tang, Arijit Khan +3
Entity Resolution (ER) is a fundamental data quality improvement task that identifies and links records referring to the same real-world entity. Traditional ER approaches often rel…
Efficient Graph Embedding at Scale: Optimizing CPU-GPU-SSD Integration
Zhonggen Li, Xiangyu Ke, Yifan Zhu +2
Graph embeddings map graph nodes to continuous vectors and are foundational to community detection, recommendation, and many scientific applications. At billion-scale, however, exi…
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…
How Much Can Time-related Features Enhance Time Series Forecasting?
Chaolv Zeng, Yuan Tian, Guanjie Zheng +1
Recent advancements in long-term time series forecasting (LTSF) have primarily focused on capturing cross-time and cross-variate (channel) dependencies within historical data. Howe…