short-paper

Graphflow: An Active Graph Database

Authors:

Semih SalihogluAuthors Info & Claims

SIGMOD '17: Proceedings of the 2017 ACM International Conference on Management of Data

Pages 1695 - 1698

https://doi.org/10.1145/3035918.3056445

Published: 09 May 2017 Publication History

Get Access

Abstract

Many applications detect the emergence or deletion of certain subgraphs in their input graphs continuously. In order to evaluate such continuous subgraph queries, these applications resort to inefficient or highly specialized solutions because existing graph databases are passive systems that only support one-time subgraph queries. We demonstrate Graphflow, a prototype active graph data-base that evaluates general one-time and continuous subgraph queries. Graphflow supports the property graph data model and the Cypher++ query language, which extends Neo4j's declarative Cypher language with subgraph-condition-action triggers. At the core of Graphflow's query processor are two worst-case optimal join algorithms called Generic Join and our new Delta Generic Join algorithm for one-time and continuous subgraph queries, respectively.

References

[1]

K. Ammar, F. McSherry, and S. Salihoglu. Delta Generic Join. Technical report, University of Waterloo, 2016. https://cs.uwaterloo.ca/~salihog/papers/deltagj.pdf.

Google Scholar

[2]

J. A. Blakeley, P.-A. Larson, and F. W. Tompa. Efficiently Updating Materialized Views. SIGMOD Rec., 15(2), 1986.

Digital Library

Google Scholar

[3]

A. Gupta, I. S. Mumick, and V. S. Subrahmanian. Maintaining Views Incrementally. SIGMOD Rec., 22(2), 1993.

Digital Library

Google Scholar

[4]

P. Gupta, V. Satuluri, A. Grewal, S. Gurumurthy, V. Zhabiuk, Q. Li, and J. Lin. Real-time Twitter Recommendation: Online Motif Detection in Large Dynamic Graphs. VLDB, 7(13), 2014.

Digital Library

Google Scholar

[5]

Neo4j. https://neo4j.com/.

Google Scholar

[6]

H. Q. Ngo, C. Ré, and A. Rudra. Skew strikes back: New developments in the theory of join algorithms. SIGMOD Rec., 42(4), 2014.

Digital Library

Google Scholar

[7]

OrientDB. http://orientdb.com/orientdb/.

Google Scholar

[8]

T. L. Veldhuizen. Leapfrog Triejoin: A worst-case optimal join algorithm. CoRR, 2012.

Google Scholar

Cited By

View all

Lin HWang ZQi SZhu XHong CChen WLuo Y(2024)Building a High-Performance Graph Storage on Top of Tree-Structured Key-Value StoresBig Data Mining and Analytics10.26599/BDMA.2023.90200157:1(156-170)Online publication date: Mar-2024
https://doi.org/10.26599/BDMA.2023.9020015
Yang JFang SGu ZMa ZLin XTian Z(2024)TC-Match: Fast Time-Constrained Continuous Subgraph MatchingProceedings of the VLDB Endowment10.14778/3681954.368196317:11(2791-2804)Online publication date: 30-Aug-2024
https://doi.org/10.14778/3681954.3681963
Zhao YWang WChen SZhang BWang JWang Z(2024)Speeding Up Subgraph Matching Queries with Schema Guided IndexProceedings of the 2024 3rd International Conference on Networks, Communications and Information Technology10.1145/3672121.3672129(34-38)Online publication date: 7-Jun-2024
https://dl.acm.org/doi/10.1145/3672121.3672129
Show More Cited By

Index Terms

Graphflow: An Active Graph Database
1. Information systems
  1. Data management systems
    1. Database design and models
      1. Graph-based database models
    2. Database management system engines
      1. Database query processing
        Join algorithms
        Query optimization
        Query planning

Recommendations

Querying Graph Databases at Scale
SIGMOD/PODS '24: Companion of the 2024 International Conference on Management of Data

The tutorial provides an in-depth overview of recent advances in algorithms and data structures for processing graph database queries. The focus will be on scalable algorithms that have been demonstrated to work over real world knowledge graphs. We will ...
Worst-Case-Optimal Similarity Joins on Graph Databases
SIGMOD

We extend the concept of worst-case optimal equijoins in graph databases to the case where some nodes are required to be within the k-nearest neighbors (kNN) of others under some similarity function. We model the problem by superimposing the database ...
Optimizing One-time and Continuous Subgraph Queries using Worst-case Optimal Joins
Best of PODS 2019 and Regular Papers

We study the problem of optimizing one-time and continuous subgraph queries using the new worst-case optimal join plans. Worst-case optimal plans evaluate queries by matching one query vertex at a time using multiway intersections. The core problem in ...

Comments

Information & Contributors

Information

Published In

SIGMOD '17: Proceedings of the 2017 ACM International Conference on Management of Data

May 2017

1810 pages

ISBN:9781450341974

DOI:10.1145/3035918

General Chairs:
Rada Chirkova
North Carolina State University, USA
,
Jun Yang
Duke University, USA
,
Program Chair:
Dan Suciu
University of Washington, USA

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 09 May 2017

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Short-paper

Conference

SIGMOD/PODS'17

Sponsor:

SIGMOD

SIGMOD/PODS'17: International Conference on Management of Data

May 14 - 19, 2017

Illinois, Chicago, USA

Acceptance Rates

Overall Acceptance Rate 785 of 4,003 submissions, 20%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

91
Total Citations
View Citations
2,452
Total Downloads

Downloads (Last 12 months)230
Downloads (Last 6 weeks)17

Reflects downloads up to 21 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Lin HWang ZQi SZhu XHong CChen WLuo Y(2024)Building a High-Performance Graph Storage on Top of Tree-Structured Key-Value StoresBig Data Mining and Analytics10.26599/BDMA.2023.90200157:1(156-170)Online publication date: Mar-2024
https://doi.org/10.26599/BDMA.2023.9020015
Yang JFang SGu ZMa ZLin XTian Z(2024)TC-Match: Fast Time-Constrained Continuous Subgraph MatchingProceedings of the VLDB Endowment10.14778/3681954.368196317:11(2791-2804)Online publication date: 30-Aug-2024
https://doi.org/10.14778/3681954.3681963
Zhao YWang WChen SZhang BWang JWang Z(2024)Speeding Up Subgraph Matching Queries with Schema Guided IndexProceedings of the 2024 3rd International Conference on Networks, Communications and Information Technology10.1145/3672121.3672129(34-38)Online publication date: 7-Jun-2024
https://dl.acm.org/doi/10.1145/3672121.3672129
Sharma AMehta DWu B(2024)Understanding High-Performance Subgraph Pattern Matching: A Systems PerspectiveProceedings of the 7th Joint Workshop on Graph Data Management Experiences & Systems (GRADES) and Network Data Analytics (NDA)10.1145/3661304.3661897(1-12)Online publication date: 14-Jun-2024
https://dl.acm.org/doi/10.1145/3661304.3661897
Lee YKim KLee WHan W(2024)In-depth Analysis of Continuous Subgraph Matching in a Common Delta Query Compilation FrameworkProceedings of the ACM on Management of Data10.1145/36549502:3(1-27)Online publication date: 30-May-2024
https://dl.acm.org/doi/10.1145/3654950
Zhang ZLu YZheng WLin X(2024)A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and InteractionProceedings of the ACM on Management of Data10.1145/36393152:1(1-29)Online publication date: 26-Mar-2024
https://dl.acm.org/doi/10.1145/3639315
Ceri SBernasconi AGagliardi AMartinenghi DBellomarini LMagnanimi DBarcelo PSanchez-Pi NMeliou ASudarshan S(2024)PG-Triggers: Triggers for Property GraphsCompanion of the 2024 International Conference on Management of Data10.1145/3626246.3653386(373-385)Online publication date: 9-Jun-2024
https://dl.acm.org/doi/10.1145/3626246.3653386
Huan CLiu YZhang HLiu HChen SSong SWu Y(2024)TeGraph+: Scalable Temporal Graph Processing Enabling Flexible Edge ModificationsIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2024.339391435:8(1469-1487)Online publication date: Aug-2024
https://doi.org/10.1109/TPDS.2024.3393914
Zheng HLi YXiong FLi XZou LShi PQin Z(2024)Vertex Encoding for Edge Nonexistence Determination With SIMD AccelerationIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2024.335091936:7(3600-3614)Online publication date: Jul-2024
https://doi.org/10.1109/TKDE.2024.3350919
Wei YJiang P(2024)GCSM: GPU-Accelerated Continuous Subgraph Matching for Large Graphs2024 IEEE International Parallel and Distributed Processing Symposium (IPDPS)10.1109/IPDPS57955.2024.00097(1046-1057)Online publication date: 27-May-2024
https://doi.org/10.1109/IPDPS57955.2024.00097
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Querying Graph Databases at Scale

Worst-Case-Optimal Similarity Joins on Graph Databases

Optimizing One-time and Continuous Subgraph Queries using Worst-case Optimal Joins