Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 3 of 3 for “"Query containment"”.

  1. Query equivalence and containment on relational and tree databases

    The query containment problem is to check if the answer set of one query is always a subset of another query for any given database. Algorithms for query containment are crucial in several contexts in databases. <br><br>As far as the query containment problem is concerned, various algorithms and …

    freiburg-diss Repository record for Query equivalence and containment on relational and tree databases (opens in a new tab)

  2. Supporting Dynamic Queries and Annotations Over Data Graphs

    … has focused on the problem of representing and querying relationships between graphs. In addition, previous research has mainly focused on annotations for static data. To support recursive and dynamic provenance annotations, we propose representing metadata as dynamic annotations over dynamic …

    uiuc Repository record for Supporting Dynamic Queries and Annotations Over Data Graphs (opens in a new tab)

  3. Processing techniques for partial tree-pattern queries on XML data

    … data on the Web. XML structures data as trees. Querying capabilities are provided through patterns matched against the XML trees. Research on the processing of XML queries has focused mainly on tree-pattern queries. Tree-pattern queries are not appropriate for querying XML data sources whose …

    njit Repository record for Processing techniques for partial tree-pattern queries on XML data (opens in a new tab)