Demo Data from EDBT 2026 / reviewers in the wild / expert
Sheng Qing Hu
dblp:161/1196
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2015
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 1
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Theoretical computer science
1 paper |
Algorithms and data structures · 100% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Storage systems · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Storage systems
out-of-core computation |
0.2 | 1 | 2015 | Induced Sorting Suffixes in External Memory · ACM Trans. Inf. Syst. 2015 |
Algorithms and data structures › sequence algorithms
string algorithms |
0.2 | 1 | 2015 | Induced Sorting Suffixes in External Memory · ACM Trans. Inf. Syst. 2015 |
Algorithms and data structures › sequence algorithms › string algorithms › string indexing
suffix array construction |
0.2 | 1 | 2015 | Induced Sorting Suffixes in External Memory · ACM Trans. Inf. Syst. 2015 |
Methods — techniques the papers use, named apart from their topics
induced sorting · 0.4disk-based algorithm · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2015 | Induced Sorting Suffixes in External MemoryabstractWe present in this article an external memory algorithm, called disk SA-IS (DSA-IS), to exactly emulate the induced sorting algorithm SA-IS previously proposed for sorting suffixes in RAM. DSA-IS is a new disk-friendly method for sequentially retrieving the preceding character of a sorted suffix to induce the order of the preceding suffix. For a size n string of a constant or integer alphabet, given the RAM capacity Ω (( nW ) 0.5 ), where W is the size of each I/O buffer that is large enough to amortize the overhead of each access to disk, both the CPU time and peak disk use of DSA-IS are O ( n ). Our experimental study shows that on average, DSA-IS achieves the best time and space results of all of the existing external memory algorithms based on the induced sorting principle. Ge Nong, Wai Hong Chan, Sheng Qing Hu, Yi Wu 0011 |
ACM Trans. Inf. Syst. | 3 |