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 20 of 3522 for “"Queries"”.

  1. Streaming Video Queries

    … a set of approximate filters to speed up queries that involve objects of a specific type (e.g., cars, trucks, etc.) on video frames with associated spatial relationships among them (e.g., car left of truck). The resulting filters can assess quickly if the query predicates are true to …

    toronto-retro Repository record for Streaming Video Queries (opens in a new tab)

  2. Synchronised range queries

    … a notion of logical time synchronised range queries to address the issue of data access. Accessing data efficiently in a latency-sensitive and large scale network overlay is a vital requirement for the scalability of the system. So, this thesis presents a notion of synchronised range queries …

    birmingham Download PDF for Synchronised range queries (opens in a new tab)

  3. The Bit Probe Model for Membership Queries: Non-Adaptive Bit Queries

    … so that you do not use much space and membership queries can be done quickly? One popular method is to use bit vectors. We use a model data structure that is a variant of bit vectors, the bit probe data structure, to demonstrate lower and upper bounds for bit vectors and similar structures. This …

    maryland Repository record for The Bit Probe Model for Membership Queries: Non-Adaptive Bit Queries (opens in a new tab)

  4. Answering Join Queries Instantly

    … research presents an innovative way to process queries without having to perform expensive join and set operations. We propose to store the equi-join relationships of tuples on mass storage devices, such as disks, to facilitate query processing. The equi-join relationships are captured, grouped, …

    siu-theses Repository record for Answering Join Queries Instantly (opens in a new tab)

  5. ORTHOGONAL RANGE SKYLINE QUERIES

    … There are several different variants of skyline queries. For example, we can consider each point in P to be colored. Given a query range Q, can we efficiently count the number of points of each color in the skyline? In this thesis, we will present a new O( log n log log n + D log log n) method …

    mtu Repository record for ORTHOGONAL RANGE SKYLINE QUERIES (opens in a new tab)

  6. Efficient Influence Related Queries

    … call for efficient processing influence related queries. In this thesis, we study three important influence related problems regarding three types of data, i.e., product and user preference data, spatio-textual objects, and set-valued data. Firstly, for product and user preference data, we …

    unsw Repository record for Efficient Influence Related Queries (opens in a new tab)

  7. Incremental processing of twig queries

    Queries on XML databases are typically expressed as twig patterns. The query processing problem then reduces to finding all occurrences of these twig patterns in an XML database. Traditionally, these queries have been executed using techniques such as structural joins and holistic twig joins. We, …

    nus Repository record for Incremental processing of twig queries (opens in a new tab) Download file for Incremental processing of twig queries (opens in a new tab)

  8. Terrain drainage features and queries

    … problems, but answer additional interesting queries as well. Proofs of computational complexity are given for the more important algorithms and problems.

    ubc Repository record for Terrain drainage features and queries (opens in a new tab) Download PDF for Terrain drainage features and queries (opens in a new tab)

  9. Formulating Complex Queries Using Templates

    … to retrieve documents in response to the users’ queries. The analysis in this paper indicates that while users found the template-based query formulation less easy to use, the queries written using templates performed better than the queries written using the control interface with one query …

    waterloo Repository record for Formulating Complex Queries Using Templates (opens in a new tab)

  10. Path Queries in Weighted Trees

    … a weight, in order to support various path queries, for which a certain function over the weights of the nodes along a given query path in the tree is computed [3, 14, 22, 26]. In this thesis, we consider the problem of supporting several various path queries over a tree on n weighted nodes, …

    waterloo Repository record for Path Queries in Weighted Trees (opens in a new tab)

  11. Complex queries and complex data

    … of strategies for evaluating similarity queries has evolved to an important field of research in the database community, spatio-temporal database community, and others, such as information retrieval and computer vision. This thesis concentrates on a special instance of similarity queries, …

    lmu-germany Repository record for Complex queries and complex data (opens in a new tab)

  12. Evaluating Temporal Queries over Videos

    … three research problems on evaluating temporal queries with such annotations. Specifically, we first investigate the temporal queries that consider only co-occurrence relationships between objects on video feeds, where we take the first step and define such queries in a way that they incorporate …

    york Repository record for Evaluating Temporal Queries over Videos (opens in a new tab)

  13. Representative Subsets for Preference Queries

    … focus on the two overlapping areas of preference queries and dataset summarization. A (linear) preference query specifies the relative importance of the attributes in a dataset and asks for the tuples that best match those preferences. Dataset summarization is the task of representing an entire …

    uvic Repository record for Representative Subsets for Preference Queries (opens in a new tab)

  14. Optimizing select-project-join queries

    … retrieval algorithm for relational database queries is a highly sought after ideal. A great amount of research has been applied in the quest for a better, faster, and cheaper universal retrieval scheme. Unfortunately there is no panacea, no single "optimal" method. With the many different …

    unlv Repository record for Optimizing select-project-join queries (opens in a new tab) Download PDF for Optimizing select-project-join queries (opens in a new tab)

  15. Higher-order queries and applications

    … In relational databases, higher-order queries appear in numerous aspects including query rewriting and query specification. In XML databases, higher-order functions are natural due to the close connection of XML query languages with functional programming.</p><p>The thesis investigates …

    oxford Repository record for Higher-order queries and applications (opens in a new tab)

  16. Visual retrieval for compound queries

    … as it may require the system to handle queries of different object types. Furthermore, the retrieval should be real-time with high performance.</p> <p>The first task we consider is to retrieve images containing both a target person and a target scene type from a large dataset of images. …

    oxford Repository record for Visual retrieval for compound queries (opens in a new tab)

  17. Semantic optimization of OQL queries

    oxford Restricted access

  18. Window Queries Over Data Streams

    Evaluating queries over data streams has become an appealing way to support various stream-processing applications. Window queries are commonly used in many stream applications. In a window query, certain query operators, especially blocking operators and stateful operators, appear in their …

    portland-state Repository record for Window Queries Over Data Streams (opens in a new tab)

Page 1 of 177