Concept

Hash join

Publications associées (24)

Squall: Scalable Real-time Analytics

Christoph Koch, Ioannis Klonatos, Mohammad Dashti Rahmat Abadi, Aleksandar Vitorovic, Mohamed Elsayed Mohamed Ahmed El Seidy, Daniel Espino Timón, Minh Khue Vu, Khayyam Mubariz Oglu Guliyev

Squall is a scalable online query engine that runs complex analytics in a cluster using skew-resilient, adaptive operators. Squall builds on state-of-the-art partitioning schemes and local algorithms, including some of our own. This paper presents the over ...

2016

Squall: Scalable Real-time Analytics

Christoph Koch, Ioannis Klonatos, Mohammad Dashti Rahmat Abadi, Aleksandar Vitorovic, Mohamed Elsayed Mohamed Ahmed El Seidy, Daniel Espino Timón, Minh Khue Vu, Khayyam Mubariz Oglu Guliyev

VLDB Endowment Inc.2016

Squall

Aleksandar Vitorovic

Squall is a scalable online query engine that runs complex analytics in a cluster using skew-resilient, adaptive operators. Online processing implies that results are incrementally built as the input arrives, and it is ubiquitous for many applications such ...

EPFL2016

TRANSFORMERS: Robust Spatial Joins on Non-Uniform Data Distributions

Anastasia Ailamaki, Thomas Heinis, Farhan Tauheed, Mirjana Pavlovic

Spatial joins are becoming increasingly ubiquitous in many applications, particularly in the scientific domain. While several approaches have been proposed for joining spatial datasets, each of them has a strength for a particular type of density ratio amo ...

IEEE2016

Sort vs. Hash Join Revisited for Near-Memory Execution

Babak Falsafi, Boris Robert Grot, Yusuf Onur Koçberber, Nooshin Sadat Mirzadeh

Data movement between memory and CPU is a well-known energy bottleneck for analytics. Near-Memory Processing (NMP) is a promising approach for eliminating this bottleneck by shifting the bulk of the computation toward memory arrays in emerging stacked DRAM ...

2015

Sort vs. Hash Join Revisited for Near-Memory Execution

Babak Falsafi, Boris Robert Grot, Yusuf Onur Koçberber, Nooshin Sadat Mirzadeh

2015

Scaling Similarity Joins over Tree-Structured Data

Given a large collection of tree-structured objects (e.g., XML documents), the similarity join finds the pairs of objects that are similar to each other, based on a similarity threshold and a tree edit distance measure. The state-of-the-art similarity join ...

Assoc Computing Machinery2015

TOUCH: In-Memory Spatial Join by Hierarchical Data-Oriented Partitioning

Anastasia Ailamaki, Thomas Heinis, Farhan Tauheed, Sadegh Heyrani Nobari

Efficient spatial joins are pivotal for many applications and particularly important for geographical information systems or for the simulation sciences where scientists work with spatial models. Past research has primarily focused on disk-based spatial jo ...

2013

Lower bounds on the obstacle number of graphs

János Pach, Doemoetoer Palvoelgyi, Padmini Mukkamala

Given a graph G, an obstacle representation of G is a set of points in the plane representing the vertices of G, together with a set of connected obstacles such that two vertices of G are joined by an edge if and only if the corresponding points can be con ...

2012

Implementing Joins using Extensible Pattern Matching

Philipp Haller

Join patterns are an attractive declarative way to synchronize both threads and asynchronous distributed computations. We explore joins in the context of extensible pattern matching that recently appeared in languages such as F# and Scala. Our implementati ...

Springer2008

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search