Concept

Hash join

Publications associées (12)

Two degree of freedom oscillator system

Simon Nessim Henein, Mohammad Hussein Kahrobaiyan, Billy Nussbaumer

Oscillator system (1) comprising:- a substantially planar frame (3);- a first sub-oscillator (5), a second sub-oscillator (7), a third sub-oscillator (9), and a fourth sub-oscillator (11), each sub-oscillator (5, 7, 9, 11) comprising a substantially rigid ...

2020

Time- and Space-Efficient Spatial Data Analytics

Mirjana Pavlovic

Advances in data acquisition technologies and supercomputing for large-scale simulations have led to an exponential growth in the volume of spatial data. This growth is accompanied by an increase in data complexity, such as spatial density, but also by mor ...

EPFL2019

Hardware-conscious Hash-Joins on GPUs

Anastasia Ailamaki, Manolis Karpathiotakis, Raja Appuswamy, Periklis Chrysogelos, Panagiotis Sioulas

Traditionally, analytical database engines have used task parallelism provided by modern multisocket multicore CPUs for scaling query execution. Over the past few years, GPUs have started gaining traction as accelerators for processing analytical queries d ...

IEEE2019

A Framework Based on Predictive Maintenance, Zero-Defect Manufacturing and Scheduling Under Uncertainty Tools, to Optimize Production Capacities of High-End Quality Products

Dimitrios Kyritsis

Nowadays exploiting the full potential of the humongous amount of data that manufactures can produce with their production means is a real challenge. Moreover, increasing production capabilities without large investments is a recurring objective for them. ...

SPRINGER-VERLAG BERLIN2018

Two degree of freedom mechanical oscillator

Simon Nessim Henein, Ilan Vardi, Mohammad Hussein Kahrobaiyan

Mechanical oscillator (10) comprising an inertial body (101) joined to a support (100) by means of an elastic system (102, 103, 104, 105, 106, 107) arranged to provide the inertial body (101) with substantially no degrees of freedom in translation and with ...

2018

Squall: Scalable Real-time Analytics

Christoph Koch, Ioannis Klonatos, Aleksandar Vitorovic, Mohammad Dashti Rahmat Abadi, 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 ...

VLDB Endowment Inc.2016

Squall: Scalable Real-time Analytics using Efficient, Skew-resilient Join Operators

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 ...

EPFL2023

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

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