TY - GEN
T1 - Towards sequenced semantics for evolving graphs
AU - Moffitt, Vera Zaychik
AU - Stoyanovich, Julia
N1 - Funding Information:
∗This work was supported in part by NSF Grants No. 1464327 and 1539856, and BSF Grant No. 2014391.
Funding Information:
This work was supported in part by NSF Grants No. 1464327 and 1539856, and BSF Grant No. 2014391.
Publisher Copyright:
© 2017, Copyright is with the authors.
Copyright:
Copyright 2018 Elsevier B.V., All rights reserved.
PY - 2017
Y1 - 2017
N2 - The research community has adopted a sequence of snapshots as the logical representation of evolving graphs — graphs that change over time and whose history of evolution we want to preserve for analysis. This paper argues that the snapshot sequence model of evolving graphs is insu cient for representation and analysis of a wide range of networks. Instead, we propose to use the interval model with sequenced semantics. In this model nodes and edges are associated with their validity intervals, and operations adhere to the properties of snapshot reducibility, extended snapshot reducibility, and change preservation. We show the advantages of adopting this model for evolving graphs and lay the groundwork for an evolving graph query language with sequenced semantics. We also discuss several challenges of e ciently supporting sequenced semantics in a distributed setting.
AB - The research community has adopted a sequence of snapshots as the logical representation of evolving graphs — graphs that change over time and whose history of evolution we want to preserve for analysis. This paper argues that the snapshot sequence model of evolving graphs is insu cient for representation and analysis of a wide range of networks. Instead, we propose to use the interval model with sequenced semantics. In this model nodes and edges are associated with their validity intervals, and operations adhere to the properties of snapshot reducibility, extended snapshot reducibility, and change preservation. We show the advantages of adopting this model for evolving graphs and lay the groundwork for an evolving graph query language with sequenced semantics. We also discuss several challenges of e ciently supporting sequenced semantics in a distributed setting.
UR - http://www.scopus.com/inward/record.url?scp=85030548064&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85030548064&partnerID=8YFLogxK
U2 - 10.5441/002/edbt.2017.41
DO - 10.5441/002/edbt.2017.41
M3 - Conference contribution
AN - SCOPUS:85030548064
T3 - Advances in Database Technology - EDBT
SP - 446
EP - 449
BT - Advances in Database Technology - EDBT 2017
A2 - Mitschang, Bernhard
A2 - Markl, Volker
A2 - Bress, Sebastian
A2 - Andritsos, Periklis
A2 - Sattler, Kai-Uwe
A2 - Orlando, Salvatore
PB - OpenProceedings.org
T2 - 20th International Conference on Extending Database Technology, EDBT 2017
Y2 - 21 March 2017 through 24 March 2017
ER -