Conjunctive Queries over DAGs | SpringerLink
Skip to main content
Springer Nature Link
Log in

Conjunctive Queries over DAGs

  • Conference paper
Next Generation Information Technologies and Systems (NGITS 2006)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 4032))

  • 491 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley, Reading (1995)

    MATH  Google Scholar 

  2. Adi, A., Etzion, O.: The situation manager rule language. In: RuleML, pp. 1–12 (2002)

    Google Scholar 

  3. Aho, A.V., Hopcroft, J.E., Ullman, J.D.: Design and Analysis of Computer Algorithms. Addison-Wesley, Reading (1974)

    MATH  Google Scholar 

  4. Antoniou, G., Van Harmelen, F.: Semantic Web Primer, pp. 3–4. MIT Press, Cambridge (2004)

    Google Scholar 

  5. Garey, M., Johnson, D.: Computers and intractability, vol. 259. W.H. Freeman, New York (1979)

    MATH  Google Scholar 

  6. Gootlob, G., Schulz, K.: Conjunctive queries over trees. PODS, 189–200 (2004)

    Google Scholar 

  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. 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. W3C: RDF primer, http://www.w3.org/TR/rdf-primer/

  10. W3C: OWL- Web Ontology Language Overview, http://www.w3.org/TR/owl-features/

  11. XPath 1999. XML Path Language (XPath) version 1.0 (1999), http://www.w3.org/TR/xpath

Download references

Author information

Authors and Affiliations

  1. Technion, Israel Institute of Technology,  

    Royi Ronen & Oded Shmueli

Authors
  1. Royi Ronen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Oded Shmueli
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. IBM Haifa Research Lab, 31905, Mount Carmel, Haifa, Israel

    Opher Etzion

  2. University of Haifa, Haifa, Israel

    Tsvi Kuflik

  3. Information and Software Engineering Department, George Mason University, VA 22030, Fairfax, USA

    Amihai Motro

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ronen, R., Shmueli, O. (2006). Conjunctive Queries over DAGs. In: Etzion, O., Kuflik, T., Motro, A. (eds) Next Generation Information Technologies and Systems. NGITS 2006. Lecture Notes in Computer Science, vol 4032. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11780991_12

Download citation

  • DOI: https://doi.org/10.1007/11780991_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-35472-7

  • Online ISBN: 978-3-540-35473-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation