Scalable temporal clique enumeration

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

2 Downloads (Pure)

Samenvatting

We study the problem of enumeration of all k-sized subsets of temporal events that mutually overlap at some point in a query time window. This problem arises in many application domains, e.g., in social networks, life sciences, smart cities, telecommunications, and others. We propose a start time index (STI) approach that overcomes the efficiency bottlenecks of current methods which are based on 2-way join algorithms to enumerate temporal k-cliques. Additionally, we investigate how precomputed checkpoints can be used to further improve the efficiency of STI. Our experimental results demonstrate that STI outperforms the state of the art by a wide margin and that our checkpointing strategies are effective.

Originele taal-2Engels
TitelProceedings of the 16th International Symposium on Spatial and Temporal Databases, SSTD 2019
Plaats van productieNew York
UitgeverijAssociation for Computing Machinery, Inc
Pagina's120-129
Aantal pagina's10
ISBN van elektronische versie978-1-4503-6280-1
DOI's
StatusGepubliceerd - 19 aug 2019
Evenement16th International Symposium on Spatial and Temporal Databases, SSTD 2019 - Vienna, Oostenrijk
Duur: 19 aug 201921 aug 2019

Congres

Congres16th International Symposium on Spatial and Temporal Databases, SSTD 2019
LandOostenrijk
StadVienna
Periode19/08/1921/08/19

Vingerafdruk Duik in de onderzoeksthema's van 'Scalable temporal clique enumeration'. Samen vormen ze een unieke vingerafdruk.

Citeer dit