Optimisation of partitioned temporal joins | Zendy

Thomas Zurek | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Optimisation of partitioned temporal joins

Author(s) -

Thomas Zurek

Publication year - 1997

Publication title -

lecture notes in computer science

Language(s) - English

Resource type - Book series

SCImago Journal Rank - 0.249

H-Index - 400

eISSN - 1611-3349

pISSN - 0302-9743

ISBN - 3-540-63263-8

DOI - 10.1007/3-540-63263-8_7

Subject(s) - computer science , joins , tuple , overhead (engineering) , timestamp , partition (number theory) , replication (statistics) , interval (graph theory) , parallel computing , table (database) , process (computing) , distributed computing , theoretical computer science , data mining , real time computing , programming language , mathematics , statistics , discrete mathematics , combinatorics

Partitioning data for temporal join processing is not trivial because tuples have to be replicated between data fragments. This causes three types of overheads: (a) an overhead caused by the replication process itself, (b) a processing overhead caused by the additional joining that has to be done and (c) an overhead for removing duplicates in the result. Previous work has mainly concentrated on avoiding (a) but still suffers from the consequences of (b) and (c).

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research