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

  1. Efficient, Expressive, and Verified Temporal Query Evaluation

    … execution with a specification (e.g., a temporal query). The system’s execution is logged into a trace—a sequence of time-points, each consisting of a time-stamp and observed events. A monitor is an algorithm that produces verdicts on the satisfaction of a temporal query on a trace. This thesis …

    ethz Repository record for Efficient, Expressive, and Verified Temporal Query Evaluation (opens in a new tab)

  2. Scalable Query Evaluation over Complex Probabilistic Databases

    … in these datasets is necessary to get meaningful query answers and Probabilistic Databases have come up as arguably the most popular solution to this problem. Their application to practical problems though has been held back because (i) the common models they use are not rich enough to capture the …

    washington Repository record for Scalable Query Evaluation over Complex Probabilistic Databases (opens in a new tab)

  3. Parallel XPath query evaluation on multi-core processors

    XML and the XPath querying language are global standards that are used in industrial settings. The high latency of queries over large XML databases remains a problem for many applications. While this latency could be reduced by parallel execution, issues such as work partitioning, memory …

    hawaii Repository record for Parallel XPath query evaluation on multi-core processors (opens in a new tab)

  4. Query Evaluation in the Presence of Fine-grained Access Control

    … storage of massive access controls, efficient query planning for secure query evaluation, and accurate cardinality estimation for access controlled data. Because fine-grained access controls specify access rights from each user to each piece of data in the system, they are effectively a massive …

    waterloo Repository record for Query Evaluation in the Presence of Fine-grained Access Control (opens in a new tab)

  5. Multi-dimensional range query evaluation for distributed hash table based peer-to-peer systems

    … P2P systems to support multi-dimensional range query towards the long term goal of providing complex query facilities in P2P systems. We adopt a multi-dimensional coordinate space model, which is sorted by Hilbert space filling curve. Sorting makes the range query processing in multiple …

    nus Repository record for Multi-dimensional range query evaluation for distributed hash table based peer-to-peer systems (opens in a new tab) Download file for Multi-dimensional range query evaluation for distributed hash table based peer-to-peer systems (opens in a new tab)

  6. Distributed XML Query Processing

    While centralized query processing over collections of XML data stored at a single site is a well understood problem, centralized query evaluation techniques are inherently limited in their scalability when presented with large collections (or a single, large document) and heavy query workloads. In …

    waterloo Repository record for Distributed XML Query Processing (opens in a new tab)

  7. Towards trusted and efficient temporal relational databases

    … and verifiable signatures. The database supports query evaluation over the entire timeline of the transaction log. To support efficient query evaluation, we utilize materialized snapshots at selected timestamps. We propose an optimal snapshot algorithm to compute the best timestamps so that the …

    uoit Repository record for Towards trusted and efficient temporal relational databases (opens in a new tab)

  8. Queries, Data, and Statistics: Pick Two

    The query processor of a relational database system executes declarative queries on relational data using query evaluation plans. The cost of the query evaluation plan depends on various statistics defined by the query and data. These statistics include intermediate and base table sizes, and data …

    toronto-retro Repository record for Queries, Data, and Statistics: Pick Two (opens in a new tab)

  9. Secure query answering and privacy-preserving data publishing

    … techniques may incur overhead for query answering, while privacy-enhancing techniques may ruin data utility. In this thesis, we study how to overcome such overhead. Specifically, we address the following two problems in this thesis: (a) efficient and secure query evaluation over …

    ubc Repository record for Secure query answering and privacy-preserving data publishing (opens in a new tab) Download PDF for Secure query answering and privacy-preserving data publishing (opens in a new tab)

  10. Scalable Statistical Modeling and Query Processing over Large Scale Uncertain Databases

    … Although there is prior work in managing and querying such probabilistic data using probabilistic databases, those approaches largely assume independence and cannot handle probabilistic data with rich correlation structures. Hence, I built a probabilistic database system that can manage …

    maryland Repository record for Scalable Statistical Modeling and Query Processing over Large Scale Uncertain Databases (opens in a new tab)

  11. Micro-Specialization: Dynamic Code Specialization in DBMSes

    … on runtime invariant present in DBMSes during query evaluation. Query evaluation involves extensive references to the relational schema, predicate values, and join types, which are all invariant during query evaluation, and thus are subject to dynamic value-based code specialization. We observe …

    arizona-thes Repository record for Micro-Specialization: Dynamic Code Specialization in DBMSes (opens in a new tab)

  12. LSPARQL: Transaction Time Queries in RDF

    … using standard RDF is convoluted, and temporal query evaluation is inefficient. While there has been work on developing temporal triple stores that address these issues, there is generally a large cost associated with migrating to a new triplestore, especially if that triplestore is not being …

    auckland-ms Repository record for LSPARQL: Transaction Time Queries in RDF (opens in a new tab)

  13. Maybms: A System For Managing Large Amounts Of Uncertain Data

    … model include compact storage and efficient query evaluation. The results of our experimental evaluation clearly show that query evaluation in MayBMS scales up to large data sizes and uncertainty ratios, and that MayBMS consistently outperforms other current systems for managing uncertain …

    cornell Repository record for Maybms: A System For Managing Large Amounts Of Uncertain Data (opens in a new tab)

  14. A Data-Descriptive Feedback Framework for Data Stream Management Systems

    … Systems (DSMSs) provide support for continuous query evaluation over data streams. Data streams provide processing challenges due to their unbounded nature and varying characteristics, such as rate and density fluctuations. DSMSs need to adapt stream processing to these changes within certain …

    portland-state Repository record for A Data-Descriptive Feedback Framework for Data Stream Management Systems (opens in a new tab)

Page 1 of 6