Output bounds for conjunctions of path queries

IF 0.6 4区计算机科学 Q4 COMPUTER SCIENCE, INFORMATION SYSTEMS

Information Processing Letters Pub Date : 2026-04-01 Epub Date: 2026-02-27 DOI:10.1016/j.ipl.2026.106628

Tamara Cucumides , Juan Reutter , Domagoj Vrgoč

{"title":"Output bounds for conjunctions of path queries","authors":"Tamara Cucumides , Juan Reutter , Domagoj Vrgoč","doi":"10.1016/j.ipl.2026.106628","DOIUrl":null,"url":null,"abstract":"<div><div>Conjunctive regular queries (CRQs) extend conjunctive regular path queries (CRPQs) by allowing path patterns defined through regular queries, a language that strictly generalizes regular path queries and underpins the recently published GQL standard. Despite their importance, little is known about how to derive tight output bounds for CRQs, which are crucial in the design of worst-case optimal algorithms. In this paper we extend the classical Atserias-Grohe-Marx (AGM) bound and the recent techniques for CRPQs to CRQs. We show that while the AGM approach provides general bounds, obtaining tight results requires refined information on the sets of nodes that can participate in the answers of regular queries. We introduce the use of derivation trees and marked nodes to capture this information, and show how they can be integrated into linear programs that yield tight bounds. We also provide lower bounds showing the optimality of our techniques. Our results strictly extend previous bounds for CRPQs, and offer new insights into the evaluation of richer query languages over graph databases.</div></div>","PeriodicalId":56290,"journal":{"name":"Information Processing Letters","volume":"193 ","pages":"Article 106628"},"PeriodicalIF":0.6000,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Information Processing Letters","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0020019026000098","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2026/2/27 0:00:00","PubModel":"Epub","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}

引用次数: 0

Abstract

Conjunctive regular queries (CRQs) extend conjunctive regular path queries (CRPQs) by allowing path patterns defined through regular queries, a language that strictly generalizes regular path queries and underpins the recently published GQL standard. Despite their importance, little is known about how to derive tight output bounds for CRQs, which are crucial in the design of worst-case optimal algorithms. In this paper we extend the classical Atserias-Grohe-Marx (AGM) bound and the recent techniques for CRPQs to CRQs. We show that while the AGM approach provides general bounds, obtaining tight results requires refined information on the sets of nodes that can participate in the answers of regular queries. We introduce the use of derivation trees and marked nodes to capture this information, and show how they can be integrated into linear programs that yield tight bounds. We also provide lower bounds showing the optimality of our techniques. Our results strictly extend previous bounds for CRPQs, and offer new insights into the evaluation of richer query languages over graph databases.

查看原文本刊更多论文

路径查询的连接的输出边界

连接常规查询（crq）通过允许通过常规查询定义的路径模式来扩展连接常规路径查询（crpq），常规查询是一种严格泛化常规路径查询并支持最近发布的GQL标准的语言。尽管它们很重要，但人们对如何为crq导出严格的输出边界知之甚少，而这在最坏情况最优算法的设计中至关重要。本文将经典的Atserias-Grohe-Marx （AGM）界和crpq的最新技术推广到crq。我们表明，虽然AGM方法提供了一般的边界，但获得严格的结果需要关于节点集的精细信息，这些节点集可以参与常规查询的答案。我们介绍了使用派生树和标记节点来捕获这些信息，并展示了如何将它们集成到产生紧密边界的线性规划中。我们还提供了显示我们的技术的最优性的下限。我们的结果严格扩展了crpq的先前界限，并为图数据库上更丰富的查询语言的评估提供了新的见解。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Information Processing Letters 工程技术-计算机：信息系统

CiteScore

1.80

自引率

0.00%

发文量

审稿时长

7.3 months

期刊介绍： Information Processing Letters invites submission of original research articles that focus on fundamental aspects of information processing and computing. This naturally includes work in the broadly understood field of theoretical computer science; although papers in all areas of scientific inquiry will be given consideration, provided that they describe research contributions credibly motivated by applications to computing and involve rigorous methodology. High quality experimental papers that address topics of sufficiently broad interest may also be considered. Since its inception in 1971, Information Processing Letters has served as a forum for timely dissemination of short, concise and focused research contributions. Continuing with this tradition, and to expedite the reviewing process, manuscripts are generally limited in length to nine pages when they appear in print.