EDBT 2026 Demo / reviewers in the wild / expert
Siddhesh Bhobe
dblp:79/5262
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2000
—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.
| Databases, data mining, and information retrieval
1 paper |
Query processing and optimization · 91% Database system architecture and tuning · 9% |
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
multi-query optimization |
0.0 | 1 | 2000 | Efficient and Extensible Algorithms for Multi Query Optimization · SIGMOD Conference 2000 |
Query processing and optimization
query optimization |
0.0 | 1 | 2000 | Efficient and Extensible Algorithms for Multi Query Optimization · SIGMOD Conference 2000 |
Query processing and optimization
search space reduction |
0.0 | 1 | 2000 | Efficient and Extensible Algorithms for Multi Query Optimization · SIGMOD Conference 2000 |
Database system architecture and tuning
decision support systems |
0.0 | 1 | 2000 | Efficient and Extensible Algorithms for Multi Query Optimization · SIGMOD Conference 2000 |
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2000 | Efficient and Extensible Algorithms for Multi Query OptimizationabstractComplex queries are becoming commonplace, with the growing use of decision support systems. These complex queries often have a lot of common sub-expressions, either within a single query, or across multiple such queries run as a batch. Multiquery optimization aims at exploiting common sub-expressions to reduce evaluation cost. Multi-query optimization has hither-to been viewed as impractical, since earlier algorithms were exhaustive, and explore a doubly exponential search space. Prasan Roy, S. Seshadri, S. Sudarshan 0001, Siddhesh Bhobe |
SIGMOD Conference | 4 |