18 citations · 45 across the 13 of their papers we have counts for
Showing 2020 · cs.DBShow all
2 papers · 2 filters
cs.DB2020★ 3 cited
Locality-Sensitive Hashing Scheme based on Longest Circular Co-Substring
Yifan Lei, Qiang Huang, Mohan Kankanhalli +1
Locality-Sensitive Hashing (LSH) is one of the most popular methods for -Approximate Nearest Neighbor Search (-ANNS) in high-dimensional spaces. In this paper, we propose a n…
cs.DB2020★ 1 cited
Efficient Radial Pattern Keyword Search on Knowledge Graphs in Parallel
Yueji Yang, Anthony K. H. Tung
Recently, keyword search on Knowledge Graphs (KGs) becomes popular. Typical keyword search approaches aim at finding a concise subgraph from a KG, which can reflect a close relatio…