Tree Merging
Tree Merging is a parallel algorithmic technique that integrates subtrees of a given tree structure into a unified representation by concurrently combining their computational results or data representations according to a specified merging rule, distinguished from other tree decomposition methods by its focus on simultaneous, coordinated aggregation across multiple tree components.
45
Publications
3.4K
Citations
106
Authors
66
Institutions
Publications per year
2017–2026
7
Parents
45
The log-structured merge-tree (LSM-tree)
Patrick E. O׳Neil, E.T. Cheng, Dieter Gawlick et al. · Acta Informatica · 1996 · 1.3K citations
Merging BSP trees yields polyhedral set operations
Bruce Naylor, John Amanatides, William Thibault · 1990 · 213 citations
Balajee Vamanan, Gwendolyn Voskuilen, T. N. Vijaykumar · 2010 · 168 citations
1–5 of 45
106
2
h-index
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 106
66
Princeton University
Princeton, United States
2 h-index
6 publications
240 citations
California State University System
Long Beach, United States
2 h-index
2 publications
323 citations
Purdue University West Lafayette
West Lafayette, United States
2 h-index
6 publications
744 citations
AT&T (United States)
Bedminster, United States
2 h-index
2 publications
323 citations
University of Illinois Urbana-Champaign
Urbana, United States
2 h-index
2 publications
32 citations

York University
Toronto, Canada
2 h-index
2 publications
323 citations
IBM (United States)
Armonk, United States
1 h-index
1 publications
26 citations
University of California, Berkeley
Berkeley, United States
1 h-index
1 publications
118 citations
1–8 of 66
TPAMI · 2 publications · 102 citations
2
h-index
2 publications · 1.3K citations
2
h-index
Repository · 2 publications · 44 citations
2
h-index
2 publications · 101 citations
2
h-index
1 publications · 29 citations
1
h-index
1–5