Enumeration for MSO-Queries on Compressed Trees-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Enumeration for MSO-Queries on Compressed Trees

Published:2024-05-10 Issue:2 Volume:2 Page:1-17
ISSN:2836-6573
Container-title:Proceedings of the ACM on Management of Data
language:en
Short-container-title:Proc. ACM Manag. Data

Author:

Lohrey Markus¹^ORCID,Schmid Markus L.²^ORCID

Affiliation:

1. Universität Siegen, Siegen, Germany

2. Humboldt-Universität zu Berlin, Berlin, Germany

Abstract

We present a linear preprocessing and output-linear delay enumeration algorithm for MSO-queries over trees that are compressed in the well-established grammar-based framework. Time bounds are measured with respect to the size of the compressed representation of the tree. Our result extends previous work on the enumeration of MSO-queries over uncompressed trees and on the enumeration of document spanners over compressed text documents.

Funder

Deutsche Forschungsgemeinschaft

Publisher

Association for Computing Machinery (ACM)

Link

https://dl.acm.org/doi/pdf/10.1145/3651141

Reference36 articles.

1. Enumeration on Trees with Tractable Combined Complexity and Efficient Updates

2. MSO Queries on Tree Decomposable Structures Are Computable with Linear Delay

3. Guillaume Bagan. 2009. Algorithmes et complexité des problè mes d'é numé ration pour l'é valuation de requê tes logiques. (Algorithms and complexity of enumeration problems for the evaluation of logical queries). Ph. D. Dissertation. University of Caen Normandy France. https://tel.archives-ouvertes.fr/tel-00424232

4. The Smallest Grammar Problem Revisited

5. Tree compression with top trees

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP