2016 IEEE 32nd International Conference on Data Engineering (ICDE) 2016
DOI: 10.1109/icde.2016.7498269
|View full text |Cite
|
Sign up to set email alerts
|

Durable graph pattern queries on historical graphs

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
21
0

Year Published

2017
2017
2023
2023

Publication Types

Select...
4
3
1

Relationship

0
8

Authors

Journals

citations
Cited by 45 publications
(27 citation statements)
references
References 22 publications
0
21
0
Order By: Relevance
“…However, existing graph databases on the market did not offer built-in versioning capabilities [R2]. Using a general-purpose graph database (e.g., Neo4j 2 or Titan 3 ) and managing the versioning process entirely on the application side has already been proven by various authors to be possible [8,66,67,71]. However, such approaches greatly increase the complexity of the resulting graph structure as well as the complexity of the queries that operate on it.…”
Section: Solution Overviewmentioning
confidence: 99%
See 1 more Smart Citation
“…However, existing graph databases on the market did not offer built-in versioning capabilities [R2]. Using a general-purpose graph database (e.g., Neo4j 2 or Titan 3 ) and managing the versioning process entirely on the application side has already been proven by various authors to be possible [8,66,67,71]. However, such approaches greatly increase the complexity of the resulting graph structure as well as the complexity of the queries that operate on it.…”
Section: Solution Overviewmentioning
confidence: 99%
“…Other related approaches, e.g., by Semertzidis and Pitoura [66,67] or by Han et al [29], assume the existence of a series of graph snapshots as input to their solutions. These approaches do not aim for online transaction processing (OLTP) capabilities and focus on the analysis of a series of static graphs.…”
Section: Related Graph Versioning Solutionsmentioning
confidence: 99%
“…[10], [27] perform subgraph matching, but with the additional support for wildcards and/or approximate matches, and Lin et al [28] address the problem of generalized subgraph query processing. Finally, Semertzidis et al [29] considered pattern queries over time-evolving graphs.…”
Section: Background a Related Workmentioning
confidence: 99%
“…The system can real-time detect suspicious pattern graphs and early warn high-risk data transfer modes on constantly updated network graphs. Semertzidis and Pitoura proposed an approach to find the most durable matches of an input graph pattern on graphs that evolve over time [12]. In [13], an incremental graph matching algorithm was proposed for updates of pattern graphs.…”
Section: Related Workmentioning
confidence: 99%
“…At present, the study of incremental graph pattern matching is still in its infancy; existing work [6][7][8][9][10][11][12] mainly focuses on the updates of data graphs. Fan et al proposed the incremental graph simulation algorithm IncMatch [6,7].…”
Section: Related Workmentioning
confidence: 99%