11 research outputs found

    Region Algebra

    No full text

    Aggregation: Expressiveness and Containment

    No full text

    Graph query processing

    No full text
    While being eminently useful in a wide variety of application domains, the high expressiveness of graph queries makes them hard to optimize and, hence, challenging to process efficiently. We discuss a number of state-of-the-art approaches which aim to overcome these challenges, focusing specifically on planning, optimization, and execution of two commonly used types of declarative graph queries: subgraph queries and regular path queries
    corecore