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

Authors

70

  1. GP
    George Papadakis

    National and Kapodistrian University of Athens, Greece

    4 publications · 234 citations

    4

    h-index

  2. TP
    Themis Palpanas

    Université Paris Cité, France

    3 publications · 222 citations

    3

    h-index

  3. AG
    Avigdor Gal

    Technion – Israel Institute of Technology, Israel

    2 publications · 235 citations

    2

    h-index

  4. KO
    Kevin O’Hare

    Queen's University Belfast, United Kingdom

    2 publications · 26 citations

    2

    h-index

  5. MM
    Mark Moir

    Oracle (United States), United States

    2 publications · 1K citations

    2

    h-index

1–5 of 70

Venues

  1. Information Systems

    3 publications · 90 citations

    3

    h-index

  2. Proceedings of the VLDB Endowment

    PVLDB · 1 publications · 169 citations

    1

    h-index

  3. Communications of the ACM

    1 publications · 385 citations

    1

    h-index

  4. Journal of Computational Chemistry

    1 publications · 54 citations

    1

    h-index

  5. European Microwave Conference

    Conference · 1 publications · 12 citations

    1

    h-index

1–5