Blocked Data Structures
Blocked Data Structures is a category of data organization methods in external memory computing that partitions data into fixed-size blocks to optimize input/output operations by minimizing the number of disk accesses during traversal or query processes.
30
Publications
2.8K
Citations
70
Authors
36
Institutions
Publications per year
2017–2026
4
30
Software transactional memory for dynamic-sized data structures
Maurice Herlihy, Victor Luchangco, Mark Moir et al. · 2003 · 999 citations
Approximating block accesses in database organizations
S. Bing Yao · Communications of the ACM · 1977 · 385 citations · Full text
Data-centric multi-level blocking
Induprakas Kodukula, Nawaaz Ahmed, Keshav Pingali · 1997 · 239 citations
Automatic Blocking of Nested Loops
Jack Dongarra, Robert Schreiber · NASA Technical Reports Server (NASA) · 1990 · 146 citations · Full text
1–5 of 30
70
National and Kapodistrian University of Athens, Greece
4 publications · 234 citations
4
h-index
3
h-index
2
h-index
2
h-index
2
h-index
1–5 of 70
36

Cornell University
Ithaca, United States
4 h-index
11 publications
1K citations
Technion – Israel Institute of Technology
Haifa, Israel
3 h-index
6 publications
586 citations

National and Kapodistrian University of Athens
Athens, Greece
2 h-index
2 publications
180 citations
Université Paris Cité
Paris, France
2 h-index
2 publications
180 citations
Queen's University Belfast
Belfast, United Kingdom
2 h-index
5 publications
63 citations

University of Rochester
Rochester, United States
2 h-index
2 publications
1K citations

Délégation Paris 5
Paris, France
2 h-index
2 publications
180 citations
Utrecht University
Utrecht, The Netherlands
2 h-index
2 publications
26 citations
1–8 of 36
3 publications · 90 citations
3
h-index
PVLDB · 1 publications · 169 citations
1
h-index
1 publications · 385 citations
1
h-index
1 publications · 54 citations
1
h-index
Conference · 1 publications · 12 citations
1
h-index
1–5