A Survey of Source Code Search: A 3-Dimensional Perspective
Not on the map. Why?
Abstract (arXiv)
(Source) code search is widely concerned by software engineering researchers because it can improve the productivity and quality of software development. Given a functionality requirement usually described in a natural language sentence, a code search system can retrieve code snippets that satisfy the requirement from a large-scale code corpus, e.g., GitHub. To realize effective and efficient code search, many techniques have been proposed successively. These techniques improve code search performance mainly by optimizing three core components, including query understanding component, code understanding component, and query-code matching component. In this paper, we provide a 3-dimensional perspective survey for code search. Specifically, we categorize existing code search studies into query-end optimization techniques, code-end optimization techniques, and match-end optimization techniques according to the specific components they optimize. Considering that each end can be optimized independently and contributes to the code search performance, we treat each end as a dimension. Therefore, this survey is 3-dimensional in nature, and it provides a comprehensive summary of each dimension in detail. To understand the research trends of the three dimensions in existing code search studies, we systematically review 68 relevant literatures. Different from existing code search surveys that only focus on the query end or code end or introduce various aspects shallowly (including codebase, evaluation metrics, modeling technique, etc.), our survey provides a more nuanced analysis and review of the evolution and development of the underlying techniques used in the three ends. Based on a systematic review and summary of existing work, we outline several open challenges and opportunities at the three ends that remain to be addressed in future work.
Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). First posted on arXiv 13 Nov 2023.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2024: 1; 2025: 4.
5 papers.
- 2025CodeRAG: Finding Relevant and Necessary Knowledge for Retrieval-Augmented Repository-Level Code Completioncited by 12
- 2025Knowledge Augmented Complex Problem Solving with Large Language Models: A Surveycited by 6
- 2024Eliminating Backdoors in Neural Code Models for Secure Code Understandingcited by 2
- 2025Secure Resource Allocation via Constrained Deep Reinforcement Learningcited by 1
- 2025ML For Hardware Design Interpretability: Challenges and Opportunitiescited by 0
- 2025CodeRAG: Finding Relevant and Necessary Knowledge for Retrieval-Augmented Repository-Level Code Completion19 Sep 2025
- 2025Knowledge Augmented Complex Problem Solving with Large Language Models: A Survey6 May 2025
- 2025ML For Hardware Design Interpretability: Challenges and Opportunities11 Apr 2025
- 2025Secure Resource Allocation via Constrained Deep Reinforcement Learning20 Jan 2025
- 2024Eliminating Backdoors in Neural Code Models for Secure Code Understanding8 Aug 2024