Advertisement

Conjunctive Queries over DAGs

  • Royi Ronen
  • Oded Shmueli
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4032)

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.

Keywords

Resource Description Framework Conjunctive Query Multiple Label XPath Query Complex Event Processing 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley, Reading (1995)MATHGoogle Scholar
  2. 2.
    Adi, A., Etzion, O.: The situation manager rule language. In: RuleML, pp. 1–12 (2002)Google Scholar
  3. 3.
    Aho, A.V., Hopcroft, J.E., Ullman, J.D.: Design and Analysis of Computer Algorithms. Addison-Wesley, Reading (1974)MATHGoogle Scholar
  4. 4.
    Antoniou, G., Van Harmelen, F.: Semantic Web Primer, pp. 3–4. MIT Press, Cambridge (2004)Google Scholar
  5. 5.
    Garey, M., Johnson, D.: Computers and intractability, vol. 259. W.H. Freeman, New York (1979)MATHGoogle Scholar
  6. 6.
    Gootlob, G., Schulz, K.: Conjunctive queries over trees. PODS, 189–200 (2004)Google Scholar
  7. 7.
    Luckham, D.C., Frasca, B.: Complex event processing in distributed systems Computer systems laboratory technical report. CSL-TR-98-754. Stanford University (1998)Google Scholar
  8. 8.
    Vardi, Y.M.: The complexity of relational query languages. In: 14th ACM Symposium on Theory of Computing, New York, pp. 137–145 (1982)Google Scholar
  9. 9.
  10. 10.
    W3C: OWL- Web Ontology Language Overview, http://www.w3.org/TR/owl-features/
  11. 11.
    XPath 1999. XML Path Language (XPath) version 1.0 (1999), http://www.w3.org/TR/xpath

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Royi Ronen
    • 1
  • Oded Shmueli
    • 1
  1. 1.Technion, Israel Institute of Technology 

Personalised recommendations