• Home
  • Search
  • Optimizing differentially-maintained recursive queries on dynamic graphs
  • Open Access IconOpen Access
  • Cite Icon4
  • https://doi.org/10.14778/3551793.3551862Copy DOI Icon

Optimizing differentially-maintained recursive queries on dynamic graphs

Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

Differential computation (DC) is a highly general incremental computation/view maintenance technique that can maintain the output of an arbitrary and possibly recursive dataflow computation upon changes to its base inputs. As such, it is a promising technique for graph database management systems (GDBMS) that support continuous recursive queries over dynamic graphs. Although differential computation can be highly efficient for maintaining these queries, it can require prohibitively large amount of memory. This paper studies how to reduce the memory overhead of DC with the goal of increasing the scalability of systems that adopt it. We propose a suite of optimizations that are based on dropping the differences of operators, both completely or partially, and recomputing these differences when necessary. We propose deterministic and probabilistic data structures to keep track of the dropped differences. Extensive experiments demonstrate that the optimizations can improve the scalability of a DC-based continuous query processor.

Similar Papers
  • Book Chapter
  • Citations1

Which Category Is Better: Benchmarking the RDBMSs and GDBMSs

  • Jan 01, 2019
  • Pengjie Ding +4
  • Supplementary Content

Clustering Graphs -- Applying a Label Propagation Algorithm to Detect Communities in Graph Databases

  • Oct 02, 2022
  • arXiv (Cornell University)
  • Andi Ferhati
  • Conference Article
  • Citations6

A+ Indexes: Tunable and Space-Efficient Adjacency Lists in Graph Database Management Systems

  • Apr 01, 2021
  • Amine Mhedhbi +3
  • Research Article

SGIR-Tree: Integrating R-Tree Spatial Indexing as Subgraphs in Graph Database Management Systems

  • Sep 27, 2024
  • ISPRS International Journal of Geo-Information
  • Juyoung Kim +4
  • Conference Article
  • Citations1

Understanding Query Optimization Bugs in Graph Database Systems

  • Mar 10, 2026
  • Yuyu Chen +1
  • Conference Article
  • Citations47

Fully Dynamic Approximate Maximum Matching and Minimum Vertex Cover in O(log3 n) Worst Case Update Time

  • Jan 01, 2017
  • Sayan Bhattacharya +2
  • Research Article
  • Citations6

Design of energy-loaded systems using the Neo4j graph database

  • Feb 01, 2021
  • IOP Conference Series: Earth and Environmental Science
  • T V Zhidchenko +3
  • Book Chapter

RDF Query Processing: Relational Vs. Graph Approach

  • Jan 01, 2022
  • Ami Pandat +1
  • Book Chapter

Graph Modeling for Topological Data Analysis

  • Jan 01, 2019
  • Silas P Lima Filho +2
  • PDF
  • Research Article
  • Citations2

Networking for Historical Justice: The Application of Graph Database Management Systems to Network Analysis Projects and the Case Study of the Reparation Movement for Japanese Colonial and Wartime Atrocities

  • Apr 25, 2022
  • Journal of Open Humanities Data
  • Keyao Pan
  • Conference Article
  • Citations70

The hyperring: a low-congestion deterministic data structure for distributed environments

  • Jan 11, 2004
  • Baruch Awerbuch +1
  • Book Chapter
  • Citations8

Execution of Recursive Queries in Apache Spark

  • Jan 01, 2017
  • Pavlos Katsogridakis +2
  • Conference Article
  • Citations78

Continuous pattern detection over billion-edge graph using distributed framework

  • Mar 01, 2014
  • Jun Gao +3
  • Book Chapter
  • Citations22

A Checkpoint/Recovery Model for Heterogeneous Dataflow Computations Using Work-Stealing

  • Jan 01, 2005
  • Samir Jafar +3
  • Research Article
  • Citations1

Enhancement of Rabin-Karp Algorithmusing XOR Filter

  • Jan 01, 2024
  • International Journal of Computing Sciences Research
  • Beatrice Escoto +7
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.