Path Query Processing
Path Query Processing is a specialized form of query processing in database systems that focuses on retrieving and analyzing sequences of related data elements or nodes connected through defined relationships, distinguishing it by its emphasis on traversing and evaluating paths in graph-structured or hierarchical data models.
141
Publications
6.3K
Citations
354
Authors
164
Institutions
Publications per year
2017–2026
31
Parents
141
Exploiting local similarity for indexing paths in graph-structured data
Raghav Kaushik, Pradeep Shenoy, Philip Bohannon et al. · 2003 · 256 citations
Navigational plans for data integration
Marc Friedman, Alon Y. Levy, Todd Millstein · 1999 · 219 citations
Finding time period-based most frequent path in big trajectory data
Wuman Luo, Haoyu Tan, Lei Chen et al. · 2013 · 203 citations
1–5 of 141
354
6
h-index
6
h-index
5
h-index
5
h-index
4
h-index
1–5 of 354
164
Institut national de recherche en sciences et technologies du numérique
Le Chesnay-Rocquencourt, France
7 h-index
12 publications
411 citations

The University of Queensland
Brisbane, Australia
7 h-index
23 publications
748 citations
Eindhoven University of Technology
Eindhoven, The Netherlands
6 h-index
12 publications
576 citations

Birkbeck, University of London
London, United Kingdom
4 h-index
8 publications
312 citations
University of Bayreuth
Bayreuth, Germany
4 h-index
8 publications
215 citations

Worcester Polytechnic Institute
Worcester, United States
4 h-index
4 publications
250 citations
National University of Singapore
Singapore, Singapore
4 h-index
6 publications
173 citations
University of Wisconsin–Madison
Madison, United States
4 h-index
8 publications
344 citations
1–8 of 164
TKDE · 7 publications · 446 citations
7
h-index
PVLDB · 7 publications · 269 citations
7
h-index
3 publications · 115 citations
3
h-index
2 publications · 103 citations
2
h-index
TODS · 2 publications · 500 citations
2
h-index
1–5