Efficient and Compact Spreadsheet Formula Graphs

02/10/2023
by   Dixin Tang, et al.
0

Spreadsheets are one of the most popular data analysis tools, wherein users can express computation as formulae alongside data. The ensuing dependencies are tracked as formula graphs. Efficiently querying and maintaining these formula graphs is critical for interactivity across multiple settings. Unfortunately, formula graphs are often large and complex such that querying and maintaining them is time-consuming, reducing interactivity. We propose TACO, a framework for efficiently compressing formula graphs, thereby reducing the time for querying and maintenance. The efficiency of TACO stems from a key spreadsheet property: tabular locality, which means that cells close to each other are likely to have similar formula structures. We leverage four such tabular locality-based patterns and develop algorithms for compressing formula graphs using these patterns, directly querying the compressed graph without decompression, and incrementally maintaining the graph during updates. We integrate TACO into an open-source spreadsheet system and show that TACO can significantly reduce formula graph sizes. For querying formula graphs, the speedups of TACO over a baseline implemented in our framework and a commercial spreadsheet system are up to 34,972x and 632x, respectively.

READ FULL TEXT
research
08/13/2020

On Testability of First-Order Properties in Bounded-Degree Graphs

We study property testing of properties that are definable in first-orde...
research
06/15/2019

A parametrized Poincare-Hopf Theorem and Clique Cardinalities of graphs

Given a locally injective real function g on the vertex set V of a finit...
research
04/21/2020

GGDs: Graph Generating Dependencies

We propose Graph Generating Dependencies (GGDs), a new class of dependen...
research
11/01/2022

Reasoning on Property Graphs with Graph Generating Dependencies

Graph Generating Dependencies (GGDs) informally express constraints betw...
research
10/29/2018

An Optimal Construction for the Barthelmann-Schwentick Normal Form on Classes of Structures of Bounded Degree

Building on the locality conditions for first-order logic by Hanf and Ga...
research
09/18/2023

Property Graphs in Arachne

Analyzing large-scale graphs poses challenges due to their increasing si...
research
08/21/2017

Economic Design of Memory-Type Control Charts: The Fallacy of the Formula Proposed by Lorenzen and Vance (1986)

The memory-type control charts, such as EWMA and CUSUM, are powerful too...

Please sign up or login with your details

Forgot password? Click here to reset