Index-based Query Processing
Index-Based Query Processing is a query processing method that utilizes preconstructed data indices to selectively and efficiently retrieve relevant results by exploiting the index structure to prune or prioritize search operations during query evaluation.
138
Publications
7K
Citations
387
Authors
167
Institutions
Publications per year
2017–2026
17
Parents
138
Hao He, Haixun Wang, Jun Yang et al. · 2007 · 544 citations
Kevin Chen–Chuan Chang, Seung-won Hwang · 2002 · 265 citations
Fast and practical indexing and querying of very large graphs
Silke Trißl, Ulf Leser · 2007 · 236 citations
1–5 of 138
387
7
h-index
5
h-index
5
h-index
4
h-index
4
h-index
1–5 of 387
167
IBM (United States)
Armonk, United States
11 h-index
30 publications
2K citations
National University of Singapore
Singapore, Singapore
9 h-index
21 publications
1.1K citations
Nanyang Technological University
Singapore, Singapore
7 h-index
14 publications
568 citations
Stanford University
Stanford, United States
6 h-index
12 publications
378 citations
Microsoft (United States)
Redmond, United States
5 h-index
19 publications
1.1K citations
IBM Research - Almaden
San Jose, United States
5 h-index
14 publications
452 citations

Renmin University of China
Beijing, China
4 h-index
6 publications
129 citations
Chinese University of Hong Kong
Hong Kong, Hong Kong
4 h-index
5 publications
219 citations
1–8 of 167
TKDE · 10 publications · 433 citations
10
h-index
PVLDB · 7 publications · 376 citations
7
h-index
TODS · 5 publications · 595 citations
5
h-index
2 publications · 35 citations
2
h-index
Repository · 2 publications · 25 citations
2
h-index
1–5