资源分类
》 资源 》论文》Querying Data Graphs with Arithmetical Regular Expressions

Querying Data Graphs with Arithmetical Regular Expressions

2019-11-22 | |  92 |   53 |   0
Abstract We propose a query language L ARE for graphs whose edges are labelled by a finite alphabet and nodes store unbounded data values. L ARE is based on a variant of regular expressions with memory. Queries of L ARE can compare quantities of memorised graph nodes and their neighbourhoods. These features allow us to express a number of natural properties, while keeping the data complexity (with a query fixed) in non-deterministic logarithmic space. We establish an algorithm that works efficiently not only with L ARE, but also with a wider language defined using effective relational conditions, another formalism we propose.

上一篇：Towards Fast Algorithms for the Preference Consistency Problem Based on Hierarchical Models

下一篇：On Consensus Extraction

用户评价
全部评价

热门资源

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Rating-Boosted La...

    The performance of a recommendation system reli...