Conjunctive queries over DAGs

Authors:
Royi Ronen;Oded Shmueli
Affiliations:
Technion, Israel Institute of Technology;Technion, Israel Institute of Technology
Venue:
NGITS'06 Proceedings of the 6th international conference on Next Generation Information Technologies and Systems
Year:
2006

Citing 5
Cited 3

Foundations of Databases: The Logical Level

Foundations of Databases: The Logical Level
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
The complexity of relational query languages (Extended Abstract)

STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
A Semantic Web Primer

A Semantic Web Primer
Conjunctive queries over trees

PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems

Evaluation of datalog extended with an XPath predicate

Proceedings of the 9th annual ACM international workshop on Web information and data management
Using a relational processor and an XPath processor to evaluate joint queries

DataX '08 Proceedings of the 2008 EDBT workshop on Database technologies for handling XML information on the web
Evaluating very large datalog queries on social networks

Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

We address the complexity of evaluating conjunctive queries over labeled directed acyclic graphs (DAGs). DAG-structured data and queries over such data occur in many contexts, such as ontologies for the Semantic Web and Complex Event Processing. The relations representing the DAG are binary axis relations, mostly adopted from XPath, and unary label relations. The relations definitions are generalized for the DAG case. We prove that all polynomial time results of [6], except one, become NP-Complete over DAGs.