@inproceedings{a8e12e47693a48948c9f51491dd66bb3,
title = "Scalable temporal clique enumeration",
abstract = "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.",
keywords = "Checkpoints, Query processing, Temporal clique, Temporal join",
author = "Kaijie Zhu and George Fletcher and Nikolay Yakovets and Odysseas Papapetrou and Yuqing Wu",
year = "2019",
month = aug,
day = "19",
doi = "10.1145/3340964.3340987",
language = "English",
series = "ACM International Conference Proceeding Series",
publisher = "Association for Computing Machinery, Inc",
pages = "120--129",
booktitle = "Proceedings of the 16th International Symposium on Spatial and Temporal Databases, SSTD 2019",
address = "United States",
note = "16th International Symposium on Spatial and Temporal Databases, SSTD 2019 ; Conference date: 19-08-2019 Through 21-08-2019",
}
