Work

The Space-Time Complexity of Sum-Product Queries

Year: 2025

Type: article

Abstract: While extensive research on query evaluation has achieved consistent improvements in the time complexity of algorithms, the space complexity of query evaluation has been largely ignored. This is a particular challenge in settings with strict pre-defined space constraints. In this paper, we examine the combined space-time complexity of conjunctive queries (CQs) and, more generally, of sum-product queries (SPQs). We propose several classes of space-efficient algorithms for evaluating SPQs, and we show that the optimal time complexity is almost always achievable with asymptotically lower space complexity than traditional approaches.

Source: Proceedings of the ACM on Management of Data

DOI: 10.1145/3767719

Authors: Kyle Deeds, Timo Camillo Merkl, Reinhard Pichler, Dan Suciu

Institutions: University of Washington, TU Wien

Language: English

Topic: Advanced Database Systems and Queries

Subfield: Computer Networks and Communications

Field: Computer Science

Domain: Physical Sciences

Open Access status: hybrid

Funders: National Science Foundation, Vienna Science and Technology Fund