Demo Data from EDBT 2026 / reviewers in the wild / expert
Jiansheng Huang
dblp:18/4686
· DBLP profile ↗
5ranked-venue papers
3as first author
0since 2021 · last 2016
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 5 · 3 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
4 papers |
Distributed and cloud data management · 48% Data integration and cleaning · 23% Data mining · 12% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Cloud and datacenter computing · 100% |
Topics — the 7 heaviest of 9, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Distributed and cloud data management › cloud database
multi-tenant database |
0.2 | 1 | 2016 | The Snowflake Elastic Data Warehouse · SIGMOD Conference 2016 |
Cloud and datacenter computing › cloud data management
cloud data warehouse |
0.2 | 1 | 2016 | The Snowflake Elastic Data Warehouse · SIGMOD Conference 2016 |
Data integration and cleaning
data provenance |
0.1 | 1 | 2008 | On the provenance of non-answers to queries over extracted data · Proc. VLDB Endow. 2008 |
Data mining › text mining
information extraction |
0.1 | 1 | 2008 | On the provenance of non-answers to queries over extracted data · Proc. VLDB Endow. 2008 |
Transaction processing and concurrency control
consistency |
0.1 | 1 | 2006 | TRAC: Toward Recency and Consistency Reporting in a Database with Distributed Data Sources · VLDB 2006 |
Distributed and cloud data management
distributed data sources |
0.1 | 1 | 2006 | TRAC: Toward Recency and Consistency Reporting in a Database with Distributed Data Sources · VLDB 2006 |
Query processing and optimization
query result explanation |
0.0 | 1 | 2008 | On the provenance of non-answers to queries over extracted data · Proc. VLDB Endow. 2008 |
Methods — techniques the papers use, named apart from their topics
provenance computation · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2016 | The Snowflake Elastic Data WarehouseabstractWe live in the golden age of distributed computing. Public cloud platforms now offer virtually unlimited compute and storage resources on demand. At the same time, the Software-as-a-Service (SaaS) model brings enterprise-class systems to users who previously could not afford such systems due to their cost and complexity. Alas, traditional data warehousing systems are struggling to fit into this new environment. For one thing, they have been designed for fixed resources and are thus unable to leverage the cloud's elasticity. For another thing, their dependence on complex ETL pipelines and physical tuning is at odds with the flexibility and freshness requirements of the cloud's new types of semi-structured data and rapidly evolving workloads. We decided a fundamental redesign was in order. Our mission was to build an enterprise-ready data warehousing solution for the cloud. The result is the Snowflake Elastic Data Warehouse, or "Snowflake" for short. Snowflake is a multi-tenant, transactional, secure, highly scalable and elastic system with full SQL support and built-in extensions for semi-structured and schema-less data. The system is offered as a pay-as-you-go service in the Amazon cloud. Users upload their data to the cloud and can immediately manage and query it using familiar tools and interfaces. Implementation began in late 2012 and Snowflake has been generally available since June 2015. Today, Snowflake is used in production by a growing number of small and large organizations alike. The system runs several million queries per day over multiple petabytes of data. Benoît Dageville, Thierry Cruanes, Marcin Zukowski, Vadim Antonov, Artin Avanes, Jon Bock, Jonathan Claybaugh, Daniel Engovatov, Martin Hentschel 0001, Jiansheng Huang, Allison W. Lee, Ashish Motivala, Abdul Q. Munir, Steven Pelley, Peter Povinec, Greg Rahn, Spyridon Triantafyllis, Philipp Unterbrunner |
SIGMOD Conference | 10 |
| 2009 | The Case for a Structured Approach to Managing Unstructured Data
AnHai Doan, Jeffrey F. Naughton, Akanksha Baid, Xiaoyong Chai, Fei Chen 0002, Eric Chu, Pedro DeRose, Byron J. Gao, Chaitanya Gokhale, Jiansheng Huang, Warren Shen, Ba-Quy Vuong |
CIDR | 11 |
| 2008 | On the provenance of non-answers to queries over extracted dataabstractIn information extraction, uncertainty is ubiquitous. For this reason, it is useful to provide users querying extracted data with explanations for the answers they receive. Providing the provenance for tuples in a query result partially addresses this problem, in that provenance can explain why a tuple is in the result of a query. However, in some cases explaining why a tuple is not in the result may be just as helpful. In this work we focus on providing provenance-style explanations for non-answers and develop a mechanism for providing this new type of provenance. Our experience with an information extraction prototype suggests that our approach can provide effective provenance information that can help a user resolve their doubts over non-answers to a query. Jiansheng Huang, AnHai Doan, Jeffrey F. Naughton |
Proc. VLDB Endow. | 1 |
| 2007 | K-relevance: a spectrum of relevance for data sources impacting a queryabstractApplications ranging from grid management to sensor nets to web-based information integration and extraction can be viewed as receiving data from some number of autonomous remote data sources and then answering queries over this collected data. In such environments it is helpful to inform users which data sources are "relevant" to their query results. It is not immediately obvious what "relevant" should mean in this context, as different users will have different requirements. In this paper, rather than proposing a single definition of relevance, we propose a spectrum of definitions, which we term "k-relevance", for k ≥ 0. We give algorithms for identifying k-relevant data sources for relational queries and explore their efficiency both analytically and experimentally. Finally, we explore the impact of integrity constraints (including dependencies) and materialized views on the problem of computing and maintaining relevant data sources. Jiansheng Huang, Jeffrey F. Naughton |
SIGMOD Conference | 1 |
| 2006 | TRAC: Toward Recency and Consistency Reporting in a Database with Distributed Data Sources
Jiansheng Huang, Jeffrey F. Naughton, Miron Livny |
VLDB | 1 |