On the Complexity of Evaluating Regular Path Queries Over Linear Existential Rules

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-319-45276-0_1
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer International Publishing

Related search

Enhanced Regular Path Queries on Semistructured Databases

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2006English

Grid-Aware Evaluation of Regular Path Queries on Spatial Networks

Proceedings - International Conference on Advanced Information Networking and Applications, AINA
Engineering
2007English

Bounded Regular Path Queries in View-Based Data Integration

Information Processing Letters
Signal ProcessingComputer Science ApplicationsInformation SystemsTheoretical Computer Science
2009English

Complexity of Answering Counting Aggregate Queries Over DL-Lite

SSRN Electronic Journal
2015English

Evaluating Top-K Queries Over Web-Accessible Databases

English

On the Exploration of the Query Rewriting Space With Existential Rules

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2013English

The Impact of Active Domain Predicates on Guarded Existential Rules

Fundamenta Informaticae
Information SystemsAlgebraNumber TheoryMathematicsComputational TheoryTheoretical Computer Science
2018English

Rewriting Regular XPath Queries on XML Views

2007English

Path Algorithms on Regular Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy