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 1187 for “"query"”.

  1. Query lookahead for query-based document categorization

    Thesis (Ph.D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1999.

    mit Repository record for Query lookahead for query-based document categorization (opens in a new tab)

  2. Batch Query Memory Prediction Using Deep Query Template Representations

    … demand of a workload. LearnedWMP leverages the query plan and groups queries with similar characteristics into pre-built templates. A histogram representation of these templates is generated for the workload, and a regressor predicts the resource demand, specifically memory cost, based on this …

    york Repository record for Batch Query Memory Prediction Using Deep Query Template Representations (opens in a new tab)

  3. Skyline Query Processing

    This thesis deals with a special subset of multi-dimensional set of points, called the Skyline. These points are the maxima or minima of the complete set and are of special interest for the field of decision support. Coming from basic algorithms for computing the Skyline we will develop ideas and …

    heid-diss Repository record for Skyline Query Processing (opens in a new tab)

  4. Query-index co-optimization executing query templates for complex text search

    … on more complex search tasks, the traditional query processing method purely based on an inverted index can not execute those search queries efficiently. New execution algorithms and index structures need to be proposed. In this paper, we study the problem of automatically deriving an efficient …

    uiuc Repository record for Query-index co-optimization executing query templates for complex text search (opens in a new tab)

  5. Query-driven adaptive sampling

    … exploration has been performed in service of a query, with a unique algorithm developed for each mission. Yet this approach does not allow scientists to respond to novel questions as they are raised. In this thesis, we develop a single approach for a broad range of adaptive sampling missions …

    woods-hole Repository record for Query-driven adaptive sampling (opens in a new tab)

  6. Co-operative query management

    lancaster

  7. Query-Driven Adaptive Sampling

    … exploration has been performed in service of a query, with a unique algorithm developed for each mission. Yet this approach does not allow scientists to respond to novel questions as they are raised. In this thesis, we develop a single approach for a broad range of adaptive sampling missions …

    mit Repository record for Query-Driven Adaptive Sampling (opens in a new tab)

  8. Quantum query complexity revisited

    … we look at the polynomial method for quantum query complexity and relate it to the BQPA = PA question for a random oracle A. We will also look at some open problems and improve some bounds relating classical and quantum complexity.

    mit Repository record for Quantum query complexity revisited (opens in a new tab)

  9. Clustering of Database Query Results

    … information overload when viewing these database query results. This thesis shows that users information overload can be reduced by clustering database query results. A hierarchical agglomerative clustering algorithm is used to cluster the query results. The reduction of users information overload …

    byu Repository record for Clustering of Database Query Results (opens in a new tab)

  10. Principles of usable query interfaces

    … these concepts in keyword queries. Thus the query term {\it Java} could refer to an island, a programming language, or a drink. When query terms can refer to multiple concepts, it is hard to devise effective heuristics to determine which answers should rank highest. In this thesis, we use the …

    uiuc Repository record for Principles of usable query interfaces (opens in a new tab)

  11. Query optimization in distributed databases

    Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1983.

    mit Repository record for Query optimization in distributed databases (opens in a new tab)

  12. Quantum speedups in query complexity

    … study randomized and quantum algorithms in the query complexity model. We investigate when and by how much quantum algorithms provide a speedup over the best possible classical algorithm in the query complexity setting. We introduce a total Boolean function that exhibits a power 2.5 quantum …

    mit Repository record for Quantum speedups in query complexity (opens in a new tab)

  13. Query selection in Deep Web Crawling

    … to be issued. This dissertation addresses the query selection problem in three parts: 1) Query selection in an omniscient setting where the global data of the deep web are available. In this case, query selection is mapped to the set-covering problem. A weighted greedy algorithm is presented to …

    windsor Repository record for Query selection in Deep Web Crawling (opens in a new tab)

  14. A Federated Data Repository Query System

    In both scientific research and data analysis, one of the most important challenges is managing and utilizing large amounts of data. Unfortunately, the information needed may be distributed across multiple databases with inconsistent or conflicting schemas. Such data inconsistencies are, at the …

    wfu Repository record for A Federated Data Repository Query System (opens in a new tab)

  15. Parameterized query complexity in quantum computation

    lethbridge

  16. Index ordering by query-independent measures

    … search a limited amount of the collection at query-time, in order to speed this retrieval process up. Although, in doing this we aim to limit the loss in retrieval efficacy (in terms of accuracy of results). The way we aim to do this is to firstly identify the most “important” documents within …

    dcu Repository record for Index ordering by query-independent measures (opens in a new tab)

  17. Query Segmentation For E-Commerce Sites

    Query segmentation module is an integral part of Natural Language Processing which analyzes users' query and divides them into separate phrases. Published works on the query segmentation focus on the web search using Google n-gram frequencies corpus or text retrieval from relational databases. …

    iupui Repository record for Query Segmentation For E-Commerce Sites (opens in a new tab)

  18. Structured query language (SQL) related tools

    … in an efficient and secure fashion. Structured Query Language (SQL) is designed to query data contained in a relational database. SQL is important as it is the only way for a user to interact with a relational database. But little focus has been put on SQL because people consider SQL as a simple …

    iastate Repository record for Structured query language (SQL) related tools (opens in a new tab)

Page 1 of 60