English
Related papers

Related papers: Scaling and Load-Balancing Equi-Joins

200 papers

Worst-case optimal join algorithms are the class of join algorithms whose runtime match the worst-case output size of a given join query. While the first provably worst-case optimal join algorithm was discovered relatively recently, the…

Databases · Computer Science 2018-06-27 Hung Q. Ngo

In many data analysis pipelines, a basic and time-consuming process is to produce join results and feed them into downstream tasks. Numerous enumeration algorithms have been developed for this purpose. To be a statistically meaningful…

Databases · Computer Science 2025-07-02 Pengyu Chen , Zizheng Guo , Jianwei Yang , Dongjing Miao

An applied problem facing all areas of data science is harmonizing data sources. Joining data from multiple origins with unmapped and only partially overlapping features is a prerequisite to developing and testing robust, generalizable…

One of the major challenges in enterprise data analysis is the task of finding joinable tables that are conceptually related and provide meaningful insights. Traditionally, joinable tables have been discovered through a search for similar…

How can we discover join relationships among columns of tabular data in a data repository? Can this be done effectively when metadata is missing? Traditional column matching works mainly rely on similarity measures based on exact value…

Accurate and efficient entity resolution (ER) is a significant challenge in many data mining and analysis projects requiring integrating and processing massive data collections. It is becoming increasingly important in real-world…

Databases · Computer Science 2021-11-09 Samudra Herath , Matthew Roughan , Gary Glonek

We present efficient algorithms for Quantile Join Queries, abbreviated as %JQ. A %JQ asks for the answer at a specified relative position (e.g., 50% for the median) under some ordering over the answers to a Join Query (JQ). Our goal is to…

Databases · Computer Science 2023-05-29 Nikolaos Tziavelis , Nofar Carmeli , Wolfgang Gatterbauer , Benny Kimelfeld , Mirek Riedewald

Indexing large-scale databases in main memory is still challenging today. Learned index structures -- in which the core components of classical indexes are replaced with machine learning models -- have recently been suggested to…

Databases · Computer Science 2021-01-27 Ali Hadian , Thomas Heinis

The spatial join is a popular operation in spatial database systems and its evaluation is a well-studied problem. As main memories become bigger and faster and commodity hardware supports parallel processing, there is a need to revamp…

Databases · Computer Science 2020-05-25 Dimitrios Tsitsigkos , Panagiotis Bouros , Nikos Mamoulis , Manolis Terrovitis

We consider a serious, previously-unexplored challenge facing almost all approaches to scaling up entity resolution (ER) to multiple data sources: the prohibitive cost of labeling training data for supervised learning of similarity scores…

Databases · Computer Science 2012-08-10 Sahand Negahban , Benjamin I. P. Rubinstein , Jim Gemmell

Federated Edge Learning (FEL), an emerging distributed Machine Learning (ML) paradigm, enables model training in a distributed environment while ensuring user privacy by using physical separation for each user data. However, with the…

Machine Learning · Computer Science 2024-10-11 Jingbo Zhang , Qiong Wu , Pingyi Fan , Qiang Fan

Short-term load forecasting for AI data centers presents new challenges because it is computing-driven, with heterogeneous job arrivals, sizes, and durations exhibiting bursty, non-stationary dynamics. Compared with traditional load types,…

Systems and Control · Electrical Eng. & Systems 2026-05-01 Ziying Wang , Ying Zhang , Lei Wang , Yuzhang Lin

Domain reweighting is an emerging research area aimed at adjusting the relative weights of different data sources to improve the effectiveness and efficiency of LLM pre-training. We show that data mixtures that perform well at smaller…

Machine Learning · Computer Science 2025-10-03 Feiyang Kang , Yifan Sun , Bingbing Wen , Si Chen , Dawn Song , Rafid Mahmood , Ruoxi Jia

All-pairs compute problems apply a user-defined function to each combination of two items of a given data set. Although these problems present an abundance of parallelism, data reuse must be exploited to achieve good performance. Several…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-09-11 Stijn Heldens , Pieter Hijma , Ben van Werkhoven , Jason Maassen , Henri Bal , Rob van Nieuwpoort

We consider checkpointing strategies that minimize the number of recomputations needed when performing discrete adjoint computations using multistage time-stepping schemes, which requires computing several substeps within one complete time…

Mathematical Software · Computer Science 2022-04-29 Hong Zhang , Emil Constantinescu

Reconfigurable optical topologies promise to improve the performance in datacenters by dynamically optimizing the physical network in a demand-aware manner. State-of-the-art optical technologies allow to establish and update direct…

Data Structures and Algorithms · Computer Science 2023-01-18 Kathrin Hanauer , Monika Henzinger , Stefan Schmid , Jonathan Trummer

Modern cloud databases present scaling as a binary decision: scale-out by adding nodes or scale-up by increasing per-node resources. This one-dimensional view is limiting because database performance, cost, and coordination overhead emerge…

Distributed, Parallel, and Cluster Computing · Computer Science 2026-05-05 Shahir Abdullah , Syed Rohit Zaman

Improving data systems' performance for join operations has long been an issue of great importance. More recently, a lot of focus has been devoted to multi-way join performance and especially on reducing the negative impact of producing…

Databases · Computer Science 2023-09-01 Qingzhi Ma

As users migrate information to cloud storage, many distributed cloud-based services use multiple loosely consistent replicas of user information to avoid the high overhead of more tightly coupled synchronization. Periodically, the…

Data Structures and Algorithms · Computer Science 2015-04-23 Michael Mitzenmacher , Rasmus Pagh

We study the problem of discovering joinable datasets at scale. This is, how to automatically discover pairs of attributes in a massive collection of independent, heterogeneous datasets that can be joined. Exact (e.g., based on distinct…

Databases · Computer Science 2020-12-07 Javier Flores , Sergi Nadal , Oscar Romero