Search Results for author:
Found 6 papers, 3 papers with code
FLAT: Fast, Lightweight and Accurate Method for Cardinality Estimation
Despite decades of research, existing methods either over simplify the models only using independent factorization which leads to inaccurate estimates, or over complicate them by lossless conditional factorization without any independent assumption which results in slow probability computation.
Cardinality Estimation in DBMS: A Comprehensive Benchmark Evaluation
Therefore, we propose a new metric P-Error to evaluate the performance of CardEst methods, which overcomes the limitation of Q-Error and is able to reflect the overall end-to-end performance of CardEst methods.
A Survey and Experimental Analysis of Distributed Subgraph Matching
We conduct extensive experiments for both unlabelled matching and labelled matching to analyze the performance of distributed subgraph matching under various settings, which is finally summarized as a practical guide.
Databases
Taming the Expressiveness and Programmability of Graph Analytical Queries
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.
Learning Efficient Parameter Server Synchronization Policies for Distributed SGD
We apply a reinforcement learning (RL) based approach to learning optimal synchronization policies used for Parameter Server-based distributed training of machine learning models with Stochastic Gradient Descent (SGD).
FSPN: A New Class of Probabilistic Graphical Model
We introduce factorize sum split product networks (FSPNs), a new class of probabilistic graphical models (PGMs).
