Query-aware Partitioning
Query-Aware Partitioning is a data partitioning strategy that belongs to the class of query-informed data organization methods, distinguished by its explicit alignment of data distribution boundaries with anticipated query access patterns to minimize cross-partition operations and optimize query performance.
16
Publications
1.1K
Citations
49
Authors
27
Institutions
Publications per year
2017–2026
2
Parents
16
Scalable SPARQL querying of large RDF graphs
Jiewen Huang, Daniel J. Abadi, Kun Ren · Proceedings of the VLDB Endowment · 2011 · 455 citations
Efficient type-ahead search on relational data
Guoliang Li, Shengyue Ji, Chen Li et al. · 2009 · 86 citations
Continuous sampling for online aggregation over multiple queries
Sai Wu, Beng Chin Ooi, Kian‐Lee Tan · 2010 · 78 citations
1–5 of 16
49
2
h-index
1
h-index
1
h-index
1
h-index
1
h-index
1–5 of 49
27

University of Warsaw
Warsaw, Poland
2 h-index
2 publications
60 citations
Max Planck Institute for Informatics
Saarbrücken, Germany
1 h-index
2 publications
82 citations

Sun Yat-sen University
Guangzhou, China
1 h-index
3 publications
603 citations
Singapore Management University
Singapore, Singapore
1 h-index
1 publications
35 citations

Beihang University
Beijing, China
1 h-index
5 publications
50 citations
Carnegie Mellon University
Pittsburgh, United States
1 h-index
3 publications
63 citations

Renmin University of China
Beijing, China
1 h-index
5 publications
50 citations

Hong Kong University of Science and Technology
Hong Kong, Hong Kong
1 h-index
1 publications
201 citations
1–8 of 27
2 publications · 23 citations
2
h-index
PVLDB · 2 publications · 656 citations
2
h-index
1 publications · 42 citations
1
h-index
Conference · 1 publications · 18 citations
1
h-index
Conference · 1 publications · 18 citations
1
h-index
1–5