Relational Algebra Trees is a formal computational model in database theory that represents relational algebra expressions as hierarchical tree structures, where nodes denote relational operations and edges specify the flow of operands, enabling systematic optimization and evaluation of queries.
106
Publications
5.3K
Citations
215
Authors
99
Institutions
Publications per year
2017–2026
4
Variants
Relational Algebra Expression Trees
Parents
Publications
106
The theory of relational databases
Michel Adiba · Science of Computer Programming · 1984 · 969 citations
Structure identification in relational data
Rina Dechter, Judea Pearl · Artificial Intelligence · 1992 · 129 citations · Full text
1–5 of 106
Authors
215
- DV
5
h-index
- JP
4
h-index
- MG
4
h-index
- PB
3
h-index
- JV
3
h-index
1–5 of 215
Institutions
99
University of Maryland, College Park
College Park, United States
4 h-index
6 publications
315 citations
University of Edinburgh
Edinburgh, United Kingdom
2 h-index
2 publications
97 citations
Indiana University Bloomington
Bloomington, United States
2 h-index
2 publications
39 citations
Transnational University Limburg
Diepenbeek, Belgium
2 h-index
2 publications
63 citations
Harvard University Press
Cambridge, United States
2 h-index
4 publications
154 citations
Boston University
Boston, United States
2 h-index
2 publications
78 citations
Massachusetts Institute of Technology
Cambridge, United States
2 h-index
7 publications
718 citations
IBM Research - Thomas J. Watson Research Center
Yorktown Heights, United States
2 h-index
4 publications
932 citations
1–8 of 99
Venues
- Information Systems
5 publications · 131 citations
5
h-index
- Very Large Data Bases
Conference · 4 publications · 404 citations
4
h-index
- The VLDB Journal
3 publications · 150 citations
3
h-index
- Theoretical Computer Science
3 publications · 74 citations
3
h-index
- Journal of Computer and System Sciences
3 publications · 482 citations
3
h-index
1–5