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 20 for “"Approximate query processing"”.

  1. A Sample Index for Approximate Query Processing

    Σε αυτή την εργασία παρουσιάζεται το Ευρετήριο Δειγμάτων, μία δομή δεδομένων η οποία αποσκοπεί στην βελτίωση της απόδοσης της διαδικασίας της δειγματοληψίας σε ένα σύστημα διαχείρισης βάσης δεδομένων. Η κεντρική ιδέα βασίζεται στην παρατήρηση πως ένα σημαντικό ποσοστό του κόστους εκτέλεσης ενός …

    athens Repository record for A Sample Index for Approximate Query Processing (opens in a new tab)

  2. Approximate Query Processing with Multiple Similarity Metrics

    Approximate query processing based on multiple similarity metrics is prevalent and essential for many applications in the database area, such as information retrieval, data mining, pattern matching, and so forth. Almost all existing works adopt the filter-and-verify paradigm. A good filtering …

    unsw Repository record for Approximate Query Processing with Multiple Similarity Metrics (opens in a new tab)

  3. Approximate query processing in a data warehouse using random sampling

    … and the complexity of the analytic tasks, data processing becomes more complicated and expensive. The cost efficiency is a key factor in the design and deployment of data warehouse systems. Approximate query processing is a well-known approach to handle massive data</p> <p>among different …

    iastate Repository record for Approximate query processing in a data warehouse using random sampling (opens in a new tab)

  4. Managing Large Multidimensional Datasets Inside a Database System

    … in decision support applications, we develop an approximate query processing technique based on multidimensional wavelets. Our technique constructs compact synopses (comprising of wavelet coefficients) of the relevant database tables and subsequently answers any SQL query by working exclusively …

    uiuc Repository record for Managing Large Multidimensional Datasets Inside a Database System (opens in a new tab)

  5. Interactive Systems for Scalable Visualization and Analysis

    … facilitates optimization of the required data processing. Draco is a model of visualization design that extends Vega-Lite with shareable design guidelines, formal reasoning over the design space, and visualization recommendation. We show how we can use Draco to construct increasingly …

    washington Repository record for Interactive Systems for Scalable Visualization and Analysis (opens in a new tab)

  6. APPROXIMATE: A Query Processor That Produces Monotonically Improving Approximate Answers

    … it may be better for a database to produce an approximate answer when it is not possible to produce an exact answer. We have designed and implemented a query processor, called APPROXIMATE, that makes approximate answers available if part of the database is unavailable or if there is not enough …

    uiuc Repository record for APPROXIMATE: A Query Processor That Produces Monotonically Improving Approximate Answers (opens in a new tab)

  7. Efficient Data Systems for Scalable Analysis with Large Language Models

    … with LLMs. Both systems leverage principles from approximate query processing to balance computational cost and result quality. The first, ThalamusDB, reduces inference costs by minimizing the volume of data processed. Guided by specialized cost and error models, ThalamusDB identifies an optimal …

    cornell Repository record for Efficient Data Systems for Scalable Analysis with Large Language Models (opens in a new tab)

  8. Building and Querying Probabilistic Models for Open World Database Systems

    … contains all information necessary to answer a query; i.e., the database contains the entire population of data. However, with the increasing availability of public data samples (e.g., government data) and easy-to-use scientific programming languages (e.g., Python), data scientists are turning …

    washington Repository record for Building and Querying Probabilistic Models for Open World Database Systems (opens in a new tab)

  9. Durability Queries on Temporal Data

    … to conclusions based on certain particular query results or observations. Instead, a useful perspective is to consider "durability", or, intuitively speaking, finding results that are robust and stand "the test of time". This thesis studies durability queries on temporal data that return …

    duke Repository record for Durability Queries on Temporal Data (opens in a new tab)

  10. DeepOLA: An online aggregation approach to approximating deeply nested queries

    Submission published under a 24 month embargo labeled 'U of I Access', the embargo will last until 2024-12-01

    uiuc Repository record for DeepOLA: An online aggregation approach to approximating deeply nested queries (opens in a new tab)

  11. Approximate Nearest Neighbor Search for Multiple Distance Metrics: Algorithms, Index Structures, and Applications

    Approximate nearest neighbor search (ANNS) is a fundamental problem in information retrieval, recommendation, computer vision, machine learning, and vector databases. Although locality-sensitive hashing (LSH) and graph indexes provide effective solutions for standard metrics, high-dimensional …

    gatech Repository record for Approximate Nearest Neighbor Search for Multiple Distance Metrics: Algorithms, Index Structures, and Applications (opens in a new tab)

  12. Wavelet-based algorithms for approximate processing in the big data era

    … high-throughput streams. The need for real-time processing of huge amounts of data places increasing emphasis on the efficiency of approximate query processing (AQP). A common practice for enabling AQP is to construct a lossy, compressed representation of a dataset and execute user queries …

    greece Repository record for Wavelet-based algorithms for approximate processing in the big data era (opens in a new tab)

  13. Accelerating queries for structured and unstructured data

    Submission published under a 24 month embargo labeled 'U of I Access', the embargo will last until 2026-05-01

    uiuc Repository record for Accelerating queries for structured and unstructured data (opens in a new tab)

  14. Theoretical Bounds and Systems Development for Exact/Approximate Multiplicities in Bag PDBs

    … (PDBs) provide users with a principled way to query data that is incomplete or imprecise. This work studies computing expected multiplicities of query results over probabilistic databases under bag semantics which has PTIME data complexity. However, does this imply that bag probabilistic …

    buffalo Repository record for Theoretical Bounds and Systems Development for Exact/Approximate Multiplicities in Bag PDBs (opens in a new tab)

  15. Leveraging distributional context for safe and interactive data science at scale

    … in computational notebooks, we demonstrate approximate lineage-capture techniques that warn data scientists of unsafe cell executions for many cases encountered in practice."

    uiuc Repository record for Leveraging distributional context for safe and interactive data science at scale (opens in a new tab)

  16. Design von Stichproben in analytischen Datenbanken

    Aktuelle Studien belegen ein rasantes, mehrdimensionales Wachstum in analytischen Datenbanken: Das Datenvolumen verzehnfachte sich in den letzten vier Jahren, die Anzahl der Nutzer wuchs um durchschnittlich 25% pro Jahr und die Anzahl der Anfragen verdoppelte sich seit 2004 jährlich. Bei den …

    qucosa-diss

  17. Leveraging Watermarks to Improve Performance of Streaming Systems

    Modern stream processing engines (SPEs) process large volumes of events propagated at high velocity through multiple queries. By continuously receiving watermarks, which are marker events injected into the stream to signify that no further events are expected beyond a designated timestamp, SPEs can …

    waterloo Repository record for Leveraging Watermarks to Improve Performance of Streaming Systems (opens in a new tab)

  18. BUILDING EFFICIENT AND COST-EFFECTIVE CLOUD-BASED BIG DATA MANAGEMENT SYSTEMS

    … networks and many others. Interactive querying and large-scale analytics are being increasingly used to derive value out of this big data. A large portion of this data is being stored and processed in the Cloud due the several advantages provided by the Cloud such as scalability, …

    maryland Repository record for BUILDING EFFICIENT AND COST-EFFECTIVE CLOUD-BASED BIG DATA MANAGEMENT SYSTEMS (opens in a new tab)

  19. Τεχνικές ευρετηριοποίησης και συσταδοποίησης για την αποδοτική αποτίμηση ερωτημάτων σε συστήματα ομότιμων κόμβων

    … challenge in such systems is efficient query evaluation. To this end, the goal of this thesis is to provide novel techniques for improving the efficiency of query evaluation in peer-to-peer systems and large-scale distributed systems, in general. The solutions we propose are centered …

    greece Repository record for Τεχνικές ευρετηριοποίησης και συσταδοποίησης για την αποδοτική αποτίμηση ερωτημάτων σε συστήματα ομότιμων κόμβων (opens in a new tab)