Skip to main content ITU
Logo
  • Programmes
    • BSc Programmes
    • BSc in Global Business Informatics
    • BSc in Digital Design and Interactive Technologies
    • BSc in Software Development
    • BSc in Data Science
    • Applying for a BSc programme
    • MSc Programmes
    • MSc in Digital Innovation & Management
    • MSc in Digital Design and Interactive Technologies
    • MSc in Software Design
    • MSc in Data Science
    • MSc in Computer Science
    • MSc in Games
    • Applying for an MSc programme
    • Student Life
    • Practical information for international students
    • Ask a student
    • Women in tech
    • Student organisations at ITU
    • Study start
    • Labs for students
    • Special Educational Support (SPS)
    • Study and Career Guidance
    • Exchange student
    • Become an exchange student
    • Guest Students
    • Who can be a guest student?
    • ITU Summer University
    • Open House
    • Open House - BSc programmes
    • Open House - MSc programmes
  • Professional Education
    • Master in IT Management
    • Master in IT Management
    • Admission and entry requirements
    • Contact
    • Single Subjects
    • About single subjects
    • Admission and entry requirements
    • Contact
    • Short courses | ITU Professional Courses
    • See all short courses
    • Contact
    • Contact
    • Contact us here
  • Research
    • Sections
    • Data Science
    • Data, Systems, and Robotics
    • Digital Business Innovation
    • Digitalization Democracy and Governance
    • Human-Computer Interaction and Design
    • Play Culture and AI
    • Software Engineering
    • Technologies in Practice
    • Theoretical Computer Science
    • Research Centres
    • Centre for Digital Play
    • Center for Climate IT
    • Center for Computing Education Research
    • Centre for Digital Welfare
    • Centre for Information Security and Trust
    • Research Centre for Government IT
    • Danish Institute for IT Program Management
    • Research entities
    • Research centers
    • Sections
    • Research groups
    • Labs
    • ITU Research Portal
    • Find Researcher
    • Find Research
    • Research Ethics and Integrity
    • Good Scientific Practice
    • Technical Reports
    • Technical Reports
    • PhD Programme
    • About the PhD Programme
    • PhD Courses
    • PhD Defences
    • PhD Positions
    • Types of Enrolment
    • PhD Admission Requirements
    • PhD Handbook
    • PhD Support
  • Collaboration
    • Collaboration with students
    • Project collaboration
    • Project Market
    • Student worker
    • Project postings
    • Job and Project bank
    • Employer Branding
    • IT Match Making
    • Hiring an ITU student or graduate
    • Make a post in the job bank
    • Research collaboration
    • Read more about research collaboration at ITU
    • Industrial PhD
    • Hire an Industrial PhD
    • Maritime Hub
    • Innovation and entrepreneurship
    • ITU Business Development
    • ITU NextGen
  • About ITU
    • About ITU
    • Press
    • Vacancies
    • Contact
  • DK
ITU
ITU  /  Research  /  Technical Reports  /  Technical Reports Archive  /  2005  /  The Tree Inclusion Problem: In Optimal Space and Faster
  • Research
    • Research Sections
    • Research Ethics and Integrity
    • Good Scientific Practice
    • Research centers
    • Research groups
    • Labs
    • Technical Reports
      • Technical Reports Archive
        • 2024
        • 2023
        • 2021
        • 2018
        • 2017
        • 2016
        • 2015
        • 2014
        • 2013
        • 2012
        • 2011
        • 2010
        • 2009
        • 2008
        • 2007
        • 2006
        • 2005
          • Scalable Computation of Acyclic Joins
          • Bigraphical Models of Context-aware Systems
          • Pre-Symmetry Set Based Shape Matching
          • Axiomatizing Binding Bigraphs (revised)
          • Bigraphical Semantics of Higher-Order Mobile Embedded Resources with Local Names
          • BI Hyperdoctrines, Higher-Order Separation Logic, and Abstraction
          • Interactive Reconfiguration in Power Supply Restoration
          • Interactive Configuration Based on Linear Programming
          • Asymmetric k-Center with Minimum Coverage
          • Matching 2D Shapes Using Their Symmetry Sets
          • Semi-Automatic Foreground Extraction For Natural Images
          • Axiomatizing Binding Bigraphs
          • Distributed Reactive XML: an XML-centric coordination middleware
          • Bigraphs by Example
          • Parametric Completion for Models of Polymorphic Linear / Intuitionistic Lambda Calculus
          • Synthetic Domain Theory and Models of Linear Abadi & Plotkin Logic
          • Categorical Models of PILL
          • Parametric Domain-theoretic models of Linear Abadi & Plotkin Logic
          • Bigraphs and (Reactive) XML - an XML-centric model of computation
          • Probabilistic models for concurrency - Notes for a minicourse
          • The Tree Inclusion Problem: In Optimal Space and Faster
          • 2004
          • 2003
          • 2002
          • 2001
          • 2000
      • PhD Programme

    The Tree Inclusion Problem: In Optimal Space and Faster

    TR-2005-54, Authors: Philip Bille and Inge Li Gørtz


    Philip Bille
    Inge Li Gørtz

    January 2005

    Abstract



    Given two rooted, ordered, and labeled trees P and T the tree inclusion problem is to determine if P can be obtained from T by deleting nodes in T. This problem has recently been recognized as an important query primitive in XML databases.Kilpeläinen and Mannila (SIAM J. of Comp. 1995) presented the first polynomial time algorithm using quadratic time and space. Since then several improved results have been obtained for special cases when P and T have a small number of leaves or small depth. However, in the worst case these algorithms still use quadratic time and space. In this paper we present a new approach to the problem which leads to a new algorithm which use optimal linear space and has subquadratic running time. Our algorithm improves all previous time and space bounds.Most importantly, the space is improved by a linear factor. This will make it possible to query larger XML databases and speed up the query time since more of the computation can be kept in main memory.



    Technical report TR-2005-54 in IT University Technical Report Series,
    January 2005.

    Available as PDF.


    Contact us

    Phone
    +45 7218 5000
    E-mail
    itu@itu.dk

    All contact information

    Web Accessibility Statement

    Find us

    IT University of Copenhagen
    Rued Langgaards Vej 7
    DK-2300 Copenhagen S
    Denmark
    How to get here

    Follow us

    ITU Student /
    Privacy /
    EAN-nr. 5798000417878/
    CVR-nr. 29 05 77 53 /
    P-nummer 1005162959

    This page is printed from https://www.itu.dk/404