17 citations · 23 across the 3 of their papers we have counts for
5 papers
Cardinality Estimation in DBMS: A Comprehensive Benchmark Evaluation
Yuxing Han, Ziniu Wu, Peizhi Wu +11
Cardinality estimation (CardEst) plays a significant role in generating high-quality query plans for a query optimizer in DBMS. In the last decade, an increasing number of advanced…
FSPN: A New Class of Probabilistic Graphical Model
Ziniu Wu, Rong Zhu, Andreas Pfadler +5
We introduce factorize sum split product networks (FSPNs), a new class of probabilistic graphical models (PGMs). FSPNs are designed to overcome the drawbacks of existing PGMs in te…
FLAT: Fast, Lightweight and Accurate Method for Cardinality Estimation
Rong Zhu, Ziniu Wu, Yuxing Han +5
Query optimizers rely on accurate cardinality estimation (CardEst) to produce good execution plans. The core problem of CardEst is how to model the rich joint distribution of attri…
Taming the Expressiveness and Programmability of Graph Analytical Queries
Lu Qin, Longbin Lai, Kongzhang Hao +6
Graph database has enjoyed a boom in the last decade, and graph queries accordingly gain a lot of attentions from both the academia and industry. We focus on analytical queries in…
A Survey and Experimental Analysis of Distributed Subgraph Matching
Longbin Lai, Zhu Qing, Zhengyi Yang +10
Recently there emerge many distributed algorithms that aim at solving subgraph matching at scale. Existing algorithm-level comparisons failed to provide a systematic view to the pr…