Demo Data from VLDB 2026 / reviewers in the wild / expert
Linan Jiang
dblp:44/483
· DBLP profile ↗
4ranked-venue papers
2as first author
0since 2021 · last 2008
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 4 · 2 first-authorApplied, interdisciplinary, general and emerging computing · 1 · 1 first-author
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.
| Databases, data mining, and information retrieval
2 papers |
Query processing and optimization · 82% Indexing and storage engines · 18% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Query processing and optimization › query optimization › statistics management
optimizer statistics |
0.1 | 1 | 2008 | Efficient and scalable statistics gathering for large databases in Oracle 11g · SIGMOD Conference 2008 |
Query processing and optimization › query optimization › statistics management
statistics collection |
0.1 | 1 | 2008 | Efficient and scalable statistics gathering for large databases in Oracle 11g · SIGMOD Conference 2008 |
Indexing and storage engines
access methods |
0.0 | 1 | 2000 | The BT-tree: A Branched and Temporal Access Method · VLDB 2000 |
Indexing and storage engines
tree index |
0.0 | 1 | 2000 | The BT-tree: A Branched and Temporal Access Method · VLDB 2000 |
Methods — techniques the papers use, named apart from their topics
distinct sampling · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2008 | Efficient and scalable statistics gathering for large databases in Oracle 11gabstractLarge tables are often decomposed into smaller pieces called partitions in order to improve query performance and ease the data management. Query optimizers rely on both the statistics of the entire table and the statistics of the individual partitions to select a good execution plan for a SQL statement. In Oracle 10g, we scan the entire table twice, one pass for gathering the table level statistics and the other pass for gathering the partition level statistics. A consequence of this gathering method is that, when the data in some partitions change, not only do we need to scan the changed partitions to gather the partition level statistics, but also we have to scan the entire table again to gather the table level statistics. Oracle 11g adopts a one-pass distinct sampling based method which can accurately derive the table level statistics from the partition level statistics. When data change, Oracle only re-gathers the statistics for the changed partitions and then derives the table level statistics without touching the unchanged partitions. To the best of our knowledge, although the one-pass distinct sampling has been researched in academia for some years, Oracle is the first commercial database that implements the technique. We have performed extensive experiments on both benchmark data and real customer data. Our experiments illustrate the this new method is highly accurate and has significantly better performance than the old method used in Oracle 10g. Sunil Chakkappen, Thierry Cruanes, Benoît Dageville, Linan Jiang, Uri Shaft, Hong Su, Mohamed Zaït |
SIGMOD Conference | 4 |
| 2004 | A Framework for Access Methods for Versioned Data
Betty Salzberg, Linan Jiang, David B. Lomet, Manuel Barrena García, Jing Shan, Evangelos Kanoulas |
EDBT | 2 |
| 2003 | The BTR-Tree: Path-Defined Version-Range Splitting in a Branched and Temporal Structure
Linan Jiang, Betty Salzberg, David B. Lomet, Manuel Barrena García |
SSTD | 1 |
| 2000 | The BT-tree: A Branched and Temporal Access Method
Linan Jiang, Betty Salzberg, David B. Lomet, Manuel Barrena García |
VLDB | 1 |