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 7 of 7 for “"Query containment"”.
-
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 …
-
An Ordered Bag Semantics for SQL
Semantic query optimization is an important issue in many contexts of databases including information integration, view maintenance and data warehousing and can substantially improve performance, especially in today's database systems which contain gigabytes of data. A crucial issue in semantic …
-
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 …
-
Collaborative Data Sharing with Mappings and Provenance
… We investigate fundamental questions of query containment and equivalence in the context of provenance information. We use the results of these investigations to develop novel approaches to efficiently propagating changes to data and mappings in a CDSS. Our approaches highlight unexpected …
-
Query optimization under bag and bag-set semantics for multiple heterogeneous data sources
In this thesis, we investigate techniques for query optimization using a set of views, considering bothrelational and XML databases. In particular, we focus on three fundamental problems of queryoptimization; which are the query containment, the query rewriting and the view selection.For relational …
-
Structural Summaries as a Core Technology for Efficient XML Retrieval
… central data structure so that structural query constraints (e.g., path or tree patterns) can be efficiently matched without accessing the documents. Labelling schemes specify ways to assign unique identifiers, or labels, to the document nodes so that specific relations (e.g., parent/child) …
-
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 …