19 citations · 41 across the 10 of their papers we have counts for
11 papers
Augur: Predicting View Serializability Violations in Relational Data Store Applications
Chujun Geng, Noah Charlton, Spyros Blanas +2
Data stores are widely used because they provide persistence, scalability, and fault tolerance with a simple interface. However, most data store applications configure the data sto…
IsoPredict: Dynamic Predictive Analysis for Detecting Unserializable Behaviors in Weakly Isolated Data Store Applications
Chujun Geng, Spyros Blanas, Michael D. Bond +1
This paper presents the first dynamic predictive analysis for data store applications under weak isolation levels, called Isopredict. Given an observed serializable execution of a…
SQRQuerier: A Visual Querying Framework for Cross-national Survey Data Recycling
Yamei Tu, Olga Li, Junpeng Wang +6
Public opinion surveys constitute a powerful tool to study peoples' attitudes and behaviors in comparative perspectives. However, even worldwide surveys provide only partial geogra…
Algorithms for a Topology-aware Massively Parallel Computation Model
Xiao Hu, Paraschos Koutris, Spyros Blanas
Most of the prior work in massively parallel data processing assumes homogeneity, i.e., every computing unit has the same computational capability, and can communicate with every o…
Chasing Similarity: Distribution-aware Aggregation Scheduling (Extended Version)
Feilong Liu, Ario Salmasi, Spyros Blanas +1
Parallel aggregation is a ubiquitous operation in data analytics that is expressed as GROUP BY in SQL, reduce in Hadoop, or segment in TensorFlow. Parallel aggregation starts with…
To Ship or Not to (Function) Ship (Extended version)
Feilong Liu, Niranjan Kamat, Spyros Blanas +1
Sampling is often used to reduce query latency for interactive big data analytics. The established parallel data processing paradigm relies on function shipping, where a coordinato…
Approximate Distributed Joins in Apache Spark
Do Le Quoc, Istemi Ekin Akkus, Pramod Bhatotia +4
The join operation is a fundamental building block of parallel data processing. Unfortunately, it is very resource-intensive to compute an equi-join across massive datasets. The ap…
ArrayBridge: Interweaving declarative array processing with high-performance computing
Haoyuan Xing, Sofoklis Floratos, Spyros Blanas +4
Scientists are increasingly turning to datacenter-scale computers to produce and analyze massive arrays. Despite decades of database research that extols the virtues of declarative…
Forecasting the cost of processing multi-join queries via hashing for main-memory databases (Extended version)
Feilong Liu, Spyros Blanas
Database management systems (DBMSs) carefully optimize complex multi-join queries to avoid expensive disk I/O. As servers today feature tens or hundreds of gigabytes of RAM, a sign…
Towards Exascale Scientific Metadata Management
Spyros Blanas, Surendra Byna
Advances in technology and computing hardware are enabling scientists from all areas of science to produce massive amounts of data using large-scale simulations or observational fa…
High-Performance Concurrency Control Mechanisms for Main-Memory Databases
Per-Åke Larson, Spyros Blanas, Cristian Diaconu +3
A database system optimized for in-memory storage can support much higher transaction rates than current systems. However, standard concurrency control methods used today do not sc…