2 citations · 8 across the 9 of their papers we have counts for
9 papers
Efficient and Robust Lock-Free Multi-Word Compare-and-Swap via Contention-Aware Helping
Motoki Unno, Kento Sugiura, Yoshiharu Ishikawa
Efficient concurrent access to shared memory remains a central focus for researchers seeking to enhance data structure performance. Lock-based synchronization often limits scalabil…
Approximate Nearest Neighbor Search for Modern AI: A Projection-Augmented Graph Approach
Kejing Lu, Zhenpeng Pan, Jianbin Qin +2
Approximate Nearest Neighbor Search (ANNS) is fundamental to modern AI applications. Most existing solutions optimize query efficiency but fail to align with the practical requirem…
Probabilistic Kernel Function for Fast Angle Testing
Kejing Lu, Chuan Xiao, Yoshiharu Ishikawa
In this paper, we study the angle testing problem in the context of similarity search in high-dimensional Euclidean spaces and propose two projection-based probabilistic kernel fun…
Practical Persistent Multi-Word Compare-and-Swap Algorithms for Many-Core CPUs
Kento Sugiura, Manabu Nishimura, Yoshiharu Ishikawa
In the last decade, academic and industrial researchers have focused on persistent memory because of the development of the first practical product, Intel Optane. One of the main c…
Probabilistic Routing for Graph-Based Approximate Nearest Neighbor Search
Kejing Lu, Chuan Xiao, Yoshiharu Ishikawa
Approximate nearest neighbor search (ANNS) in high-dimensional spaces is a pivotal challenge in the field of machine learning. In recent years, graph-based methods have emerged as…
Z-ordered Range Refinement for Multi-dimensional Range Queries
Kento Sugiura, Yoshiharu Ishikawa
The z-order curve is a space-filling curve and is now attracting the interest of developers because of its simple and useful features. In the case of key-value stores, because the…
Sequenced Route Query with Semantic Hierarchy
Yuya Sasaki, Yoshiharu Ishikawa, Yasuhiro Fujiwara +1
The trip planning query searches for preferred routes starting from a given point through multiple Point-of-Interests (PoI) that match user requirements. Although previous studies…
Fast Subtrajectory Similarity Search in Road Networks under Weighted Edit Distance Constraints
Satoshi Koide, Chuan Xiao, Yoshiharu Ishikawa
In this paper, we address a similarity search problem for spatial trajectories in road networks. In particular, we focus on the subtrajectory similarity search problem, which invol…
CiNCT: Compression and retrieval for massive vehicular trajectories via relative movement labeling
Satoshi Koide, Yukihiro Tadokoro, Chuan Xiao +1
In this paper, we present a compressed data structure for moving object trajectories in a road network, which are represented as sequences of road edges. Unlike existing compressio…