Access Path Selection
Access Path Selection is the query optimization process that determines the most efficient method for retrieving data from storage by evaluating and choosing among alternative access routes, such as index scans or full table scans, based on cost estimates and query constraints.
46
Publications
4.4K
Citations
125
Authors
51
Institutions
Publications per year
2017–2026
7
Parents
46
Access path selection in a relational database management system
Patricia G. Selinger, M. M. Astrahan, Donald D. Chamberlin et al. · 1979 · 2.2K citations
Storage and access in relational data bases
Michael W. Blasgen, Kapali P. Eswaran · IBM Systems Journal · 1977 · 229 citations
View indexing in relational databases
N. Roussopoulos · ACM Transactions on Database Systems · 1982 · 169 citations · Full text
Access path selection in a relational database management system
Patricia G. Selinger, M. M. Astrahan, Donald D. Chamberlin et al. · 1979 · 152 citations
1–5 of 46
125
6
h-index
5
h-index
5
h-index
5
h-index
4
h-index
1–5 of 125
51
IBM (United States)
Armonk, United States
6 h-index
54 publications
14.5K citations
University of Maryland, College Park
College Park, United States
3 h-index
3 publications
206 citations

Lawrence Berkeley National Laboratory
Berkeley, United States
2 h-index
4 publications
74 citations
Hewlett-Packard (United States)
Palo Alto, United States
2 h-index
2 publications
37 citations
University of California, Berkeley
Berkeley, United States
2 h-index
6 publications
978 citations
Purdue University West Lafayette
West Lafayette, United States
2 h-index
5 publications
90 citations
Google (United States)
Mountain View, United States
1 h-index
1 publications
24 citations
Université Paris-Sud
Orsay, France
1 h-index
1 publications
33 citations
1–8 of 51
TODS · 3 publications · 305 citations
3
h-index
3 publications · 350 citations
3
h-index
2 publications · 35 citations
2
h-index
1 publications · 30 citations
1
h-index
1 publications · 44 citations
1
h-index
1–5