PVLDB 2020

218 papers

Top Research Directions

Research directions most represented by PVLDB 2020 papers.

Incremental Maintenance of Dynamic Graph Indices 11
Mitigating Cardinality Estimation Errors in Database Query Optimizers 5
Unifying Transactional and Analytical Data Processing 5
Columnar Storage Layouts and Data Skipping Optimizations 4
The Architecture of Resource Disaggregation 4
Overcoming Irregular Memory Access in Graph Neural Networks 4
Overcoming the Combinatorial Explosion in Subgraph Enumeration 4
Securing Collaborative Learning Against Malicious Participants 4
Subsequence Anomaly Detection via Temporal Transition Graphs 3
Non-Blocking Reads and Delta Updates in Multi-Version Databases 3
Mitigating Write Amplification in Modern Storage Systems 3
Trading Numerical Precision for Computational Efficiency 3
Mitigating Data Skew in Distributed Systems 3
Balancing Power Law Workloads in Parallel Graph Processing 3
Incremental Algorithms for High-Velocity Data Streams 3

Top Authors

AuthorPapers
Lei Chen11
Xuemin Lin7
Jingren Zhou6
Bingsheng He5
H. V. Jagadish5
Xiaokui Xiao5
Yue Wang5
Abolfazl Asudeh4
Alfons Kemper4
Christian S. Jensen4
Fatma Ozcan4
Joseph E. Gonzalez4
Lu Qin4
Matei Zaharia4
Nan Tang4
Themis Palpanas4
Wook-Shin Han4
Zhifeng Bao4
Daniel Kang3
Francesco Bonchi3

Impactful Papers

Papers from PVLDB 2020 that shaped research clusters.

Foundational

Influential

Papers

Title
PM-LSH: A Fast and Accurate LSH Framework for High-Dimensional Approximate NN Search
POLARIS: The Distributed SQL Engine in Azure Synapse
Pricing Influential Nodes in Online Social Networks
Privacy Preserving Vertical Federated Learning for Tree-based Models
Pytheas: Pattern-based Table Discovery in CSV Files
PyTorch Distributed: Experiences on Accelerating Data Parallel Training
Quality of Sentiment Analysis Tools: The Reasons of Inconsistency
Query Performance Prediction for Concurrent Queries using Graph Embedding
Rank Aggregation Algorithms for Fair Consensus
RapidMatch: A Holistic Approach to Subgraph Query Processing
Real-Time Distance-Based Outlier Detection in Data Streams
Realtime Index-Free Single Source SimRank Processing on Web-Scale Graphs
Receipt
RECEIPT: REfine CoarsE-grained IndePendent Tasks for Parallel Tip decomposition of Bipartite Graphs
Relational data synthesis using generative adversarial networks
Relational Data Synthesis using Generative Adversarial Networks: A Design Space Exploration
ResilientDB: Global Scale Resilient Blockchain Fabric
Responsible Data Management
Sage: Parallel Semi-Asymmetric Graph Algorithms for NVRAMs
SAQE
SAQE: Practical Privacy-Preserving Approximate Query Processing for Data Federations
Sato: Contextual Semantic Type Detection in Tables
Scalable Mining of Maximal Quasi-Cliques: An Algorithm-System Codesign Approach
Scalable, NearZero Loss Disaster Recovery for Distributed Data Stores
Scalable Querying of Nested Data
Scalable, Resilient and Configurable Permissioned Blockchain Fabric
Scaling Attributed Network Embedding to Massive Graphs
Seagull: An Infrastructure for Load Prediction and Optimized Resource Allocation
Searching a Database of Source Codes Using Contextualized Code Search
Series2Graph
Series2Graph: Graph-based Subsequence Anomaly Detection for Time Series
Set-valued Data Publication with Local Privacy: Tight Error Bounds and Efficient Mechanisms
Shared Arrangements: practical inter-query sharing for streaming dataflows
SimTab
SimTab: Accuracy-Guaranteed SimRank Queries through Tighter Confidence Bounds and Multi-Armed Bandits
Space- and Computationally-Efficient Set Reconciliation via Parity Bitmap Sketch (PBS)
Spitz: A Verifiable Database System
SPORES
SPORES: Sum-Product Optimization via Relational Equality Saturation for Large Scale Linear Algebra
SSTD
SSTD: A Distributed System on Streaming Spatio-Textual Data
Stable Learned Bloom Filters for Data Streams
Stacked Filters: Learning to Filter by Structure
Table Extraction and Understanding for Scientific and Enterprise Applications
Tempura: A General Cost-Based Optimizer Framework for Incremental Data Processing
The Computation of Optimal Subset Repairs
The Simpler The Better: An Indexing Approach for Shared-Route Planning Queries
TiDB
TiDB: A Raft-based HTAP Database
Towards an Efficient Weighted Random Walk Domination

« prev Page 4/5 next »