Database Paper Browser

Back to authors

Cheng Long

Author ID
15183
ORCID
0000-0001-6806-8405
Links
(found by gpt-5.2 on feb 8th, 2026)
Most Frequent Institution
Nanyang Technological University
Pagerank
0.22870517
Overall Rank
226 | 98.92%
Paper Count
31

Affiliation Timeline

Incoming Non-self Citations Over Time

Total yearly non-self incoming citations across all papers by this author.

Publications by Paper Pagerank

Showing 31 of 31 publications.

Rank Title Year Venue Pagerank
2,287 RaBitQ: Quantizing High-Dimensional Vectors with a Theoretical Error Bound for Approximate Nearest Neighbor Search 2024 SIGMOD 9.1004806e-05
2,527 Efficient Algorithms for Maximal k-Biplex Enumeration 2022 SIGMOD 8.5982912e-05
2,772 High-Dimensional Approximate Nearest Neighbor Search: with Reliable and Efficient Distance Comparison Operations 2023 SIGMOD 8.1491893e-05
2,846 Trajectory Simplification: On Minimizing the Direction-based Error 2015 VLDB 8.0293734e-05
3,090 Direction-Preserving Trajectory Simplification 2013 VLDB 7.5904432e-05
3,336 Collective Spatial Keyword Queries: A Distance Owner-Driven Approach 2013 SIGMOD 7.2009826e-05
4,266 Efficient k-Clique Listing: An Edge-Oriented Branching Strategy 2024 SIGMOD 6.3006582e-05
4,551 iRangeGraph: Improvising Range-dedicated Graphs for Range-filtering Nearest Neighbor Search 2024 SIGMOD 6.0864316e-05
4,600 Practical and Asymptotically Optimal Quantization of High-Dimensional Vectors in Euclidean Space for Approximate Nearest Neighbor Search 2025 SIGMOD 6.0528015e-05
5,125 Maximum k-Biplex Search on Bipartite Graphs: A Symmetric-BK Branching Approach 2023 SIGMOD 5.6741053e-05
5,186 SymphonyQG: Towards Symphonious Integration of Quantization and Graph for Approximate Nearest Neighbor Search 2025 SIGMOD 5.6352814e-05
5,255 Architecture-Intact Oracle for Fastest Path and Time Queries on Dynamic Spatial Networks 2020 SIGMOD 5.5991117e-05
5,259 Efficient k-Regret Query Algorithm with Restriction-free Bound for any Dimensionality 2018 SIGMOD 5.5972902e-05
5,463 The RLR-Tree: A Reinforcement Learning Based R-Tree for Spatial Data 2023 SIGMOD 5.4920768e-05
5,939 Efficient and Effective Similar Subtrajectory Search with Deep Reinforcement Learning 2020 VLDB 5.2603518e-05
5,979 On Optimal Worst-Case Matching 2013 SIGMOD 5.242029e-05
6,812 Efficient Algorithms for Optimal Location Queries in Road Networks 2014 SIGMOD 4.9138023e-05
7,109 Fast Maximal Quasi-clique Enumeration: A Pruning and Branching Co-Design Approach 2023 SIGMOD 4.8238188e-05
8,089 Towards Designing and Learning Piecewise Space-Filling Curves 2023 VLDB 4.5855593e-05
8,495 DEG: Efficient Hybrid Vector Search Using the Dynamic Edge Navigation Graph 2025 SIGMOD 4.4938255e-05
9,119 Hypersphere Dominance: An Optimal Approach 2014 SIGMOD 4.3881453e-05
9,359 Points-of-Interest Relationship Inference with Spatial-enriched Graph Neural Networks 2022 VLDB 4.3477383e-05
9,396 Efficient Maximum s-Bundle Search via Local Vertex Connectivity 2025 SIGMOD 4.3399748e-05
9,404 Maximum k-Plex Search: An Alternated Reduction-and-Bound Method 2025 VLDB 4.3399748e-05
9,561 T-FSM: A Task-Based System for Massively Parallel Frequent Subgraph Pattern Mining from a Big Graph 2023 SIGMOD 4.3212967e-05
9,936 Fast Maximum Common Subgraph Search: A Redundancy-Reduced Backtracking Approach 2025 SIGMOD 4.2441896e-05
10,076 Efficient Size-Bounded Community Search, Revisited: Frameworks for Practical Improvements 2026 SIGMOD 4.1905499e-05
10,158 Efficient and Robust Out-Of-Distribution Vector Similarity Search with Cross-Distribution Monotonic Graph 2026 SIGMOD 4.1905499e-05
10,983 BT-Tree: A Reinforcement Learning Based Index for Big Trajectory Data 2024 SIGMOD 4.1905499e-05
11,797 Distance Oracle on Terrain Surface 2017 SIGMOD 4.1905499e-05
12,004 Terrain-Toolkit: A Multi-Functional Tool for Terrain Data 2014 VLDB 4.1905499e-05
Previous Page 1 / 1 Next

Frequent Co-authors

Co-authored at least 5 papers.

Co-author Shared Papers Rank Pagerank
Raymond Chi-Wing Wong 11 154 0.30065508
Kaiqiang Yu 8 1,045 0.066753375
Gao Cong 6 60 0.50585347
Jianyang Gao 6 1,500 0.048358915