Vertical Partitioning
Vertical Partitioning is a data partitioning strategy that belongs to the class of horizontal and vertical decomposition methods, distinguished by its division of a database table into multiple smaller tables based on columns, grouping related attributes to optimize storage, retrieval, or processing efficiency.
101
Publications
4.9K
Citations
302
Authors
161
Institutions
Publications per year
2017–2026
24
Parents
101
Scalable semantic web data management using vertical partitioning
Daniel J. Abadi, Adam Marcus, Samuel Madden et al. · 2007 · 656 citations
Fast and Simple Relational Processing of Uncertain Data
Lyublena Antova, Thomas Jansen, Christoph Koch et al. · 2008 · 246 citations · Full text
1–5 of 101
302
4
h-index
3
h-index
3
h-index
Hong Kong University of Science and Technology, Hong Kong SAR China
3 publications · 50 citations
3
h-index
2
h-index
1–5 of 302
161
University of Florida
Gainesville, United States
4 h-index
8 publications
702 citations
University of California, Los Angeles
Los Angeles, United States
4 h-index
7 publications
291 citations

City University of Hong Kong
Hong Kong, Hong Kong
3 h-index
4 publications
392 citations
Arizona State University
Tempe, United States
3 h-index
6 publications
154 citations

Centro de Investigación y de Estudios Avanzados del Instituto Politécnico Nacional
Mexico City, Mexico
2 h-index
4 publications
70 citations
IBM Research - Thomas J. Watson Research Center
Yorktown Heights, United States
2 h-index
3 publications
201 citations

Universidade Federal de Pernambuco
Recife, Brazil
2 h-index
7 publications
424 citations
Northwestern University
Evanston, United States
2 h-index
3 publications
70 citations
1–8 of 161
PVLDB · 4 publications · 132 citations
4
h-index
TKDE · 4 publications · 140 citations
4
h-index
TSE · 3 publications · 152 citations
3
h-index
2 publications · 59 citations
2
h-index
2 publications · 221 citations
2
h-index
1–5