Recursive Queries is a type of query in Structured Query Language that belongs to the class of recursive algorithms, distinguished by its ability to repeatedly invoke itself within its own definition to process hierarchical or cyclic data structures through iterative result set accumulation.
262
Publications
16.7K
Citations
398
Authors
191
Institutions
Publications per year
2017–2026
14
Parents
Publications
262
Relational queries computable in polynomial time
Neil Immerman · Information and Control · 1986 · 648 citations
Krishna P. Gummadi, Stefan Saroiu, Steven D. Gribble · ACM SIGCOMM Computer Communication Review · 2002 · 629 citations
Patrick Valduriez · ACM Transactions on Database Systems · 1987 · 504 citations · Full text
1–5 of 262
Authors
398
- RR
13
h-index
- CZ
9
h-index
- JF
8
h-index
- LJ
7
h-index
- DS
7
h-index
1–5 of 398
Institutions
191
University of Wisconsin–Madison
Madison, United States
14 h-index
25 publications
1.1K citations
Stanford University
Stanford, United States
13 h-index
14 publications
1.3K citations
AT&T (United States)
Bedminster, United States
11 h-index
19 publications
1.5K citations
University of Pennsylvania
Philadelphia, United States
10 h-index
19 publications
2.5K citations
University of Washington
Seattle, United States
9 h-index
20 publications
3.9K citations
University of Maryland, College Park
College Park, United States
9 h-index
13 publications
905 citations
University of California, Berkeley
Berkeley, United States
8 h-index
12 publications
605 citations
Princeton University
Princeton, United States
7 h-index
7 publications
318 citations
1–8 of 191
Venues
- ACM SIGMOD Record
17 publications · 1.6K citations
15
h-index
- ACM Transactions on Database Systems
TODS · 13 publications · 1.7K citations
13
h-index
- Theoretical Computer Science
12 publications · 869 citations
12
h-index
- IEEE Transactions on Knowledge and Data Engineering
TKDE · 8 publications · 212 citations
8
h-index
- Very Large Data Bases
Conference · 7 publications · 346 citations
7
h-index
1–5