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 25 for “"cardinality estimation"”.

  1. Cardinality Estimation in Streaming Graph Data Management Systems

    … the query processing pipeline, especially on cardinality estimation and query optimization, both of which are key factors in ensuring optimal system performance. In this thesis, a novel cardinality estimation technique, called GraphSketch, that is tailored for streaming graph database …

    waterloo Repository record for Cardinality Estimation in Streaming Graph Data Management Systems (opens in a new tab)

  2. Per-flow cardinality estimation based on virtual LogLog sketching

    Flow cardinality estimation is the problem of estimating the number of distinct elements in a data flow, often with a stringent memory constraint. It has wide applications in network traffic measurement and in database systems. The virtual LogLog algorithm proposed recently by Xiao, Chen, Chen and …

    uiuc Repository record for Per-flow cardinality estimation based on virtual LogLog sketching (opens in a new tab)

  3. Distributed Wireless Algorithms for RFID Systems: Grouping Proofs and Cardinality Estimation

    … on RFID-based systems for the Grouping Proof and Cardinality Estimation problems. A grouping-proof protocol is evidence that a reader simultaneously scanned the RFID tags in a group. In many practical scenarios, grouping-proofs greatly expand the potential of RFID-based systems such as supply …

    lsu-thes Repository record for Distributed Wireless Algorithms for RFID Systems: Grouping Proofs and Cardinality Estimation (opens in a new tab)

  4. Towards Efficient Spatial and Textual Query Processing: Learned Indexing and Cardinality Estimation

    … structure. On the other hand, accurate cardinality estimation plays a key role when constructing learned indexes, and in relational database systems, it is also crucial for a better query planning. Set-valued data, where each entity is associated with multiple textual values (e.g., …

    unsw Repository record for Towards Efficient Spatial and Textual Query Processing: Learned Indexing and Cardinality Estimation (opens in a new tab)

  5. Join Cardinality Estimation Graphs: Analyzing Pessimistic and Optimistic Estimators Through a Common Lens

    Join cardinality estimation is a fundamental problem that is solved in the query optimizers of database management systems when generating efficient query plans. This problem arises both in systems that manage relational data as well those that manage graph-structured data where systems need to …

    waterloo Repository record for Join Cardinality Estimation Graphs: Analyzing Pessimistic and Optimistic Estimators Through a Common Lens (opens in a new tab)

  6. A study of gossip algorithms for internet-scale cardinality estimation of distributed XML data

    … norm. In this thesis, we present the problem of cardinality estimation of XPath queries over XML data stored in a distributed, Internet-scale environment. We focus our work on three objectives: implementing gossip in an Internet-scale environment, conducting a comprehensive performance evaluation …

    umkc Repository record for A study of gossip algorithms for internet-scale cardinality estimation of distributed XML data (opens in a new tab)

  7. Cardinality Learning under Practical Constraints: Principled Theory and Empirical Design

    Cardinality/selectivity estimation --- predicting the output size of database queries --- is a core component of effective query optimization and has remained one of the most important problems in database management systems (DBMSes) since the 1980s. Early approaches relied on basic statistics, …

    penn Repository record for Cardinality Learning under Practical Constraints: Principled Theory and Empirical Design (opens in a new tab)

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

    … 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 matrix of the size as the product of the number of users …

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

  9. Performance-Based Service Level Agreements for Data Analytics in the Cloud

    … these estimates can be inaccurate due to the cardinality estimation problem. In the DeepQuery project, we empirically evaluate how deep learning can improve the accuracy of cardinality estimation.

    washington Repository record for Performance-Based Service Level Agreements for Data Analytics in the Cloud (opens in a new tab)

  10. Energy-efficient algorithm design for wireless sensor networks

    … algorithm. Finally, we study the problem of cardinality estimation in radio frequency identification systems with several readers. We introduce exclusive estimators to estimate the number of tags located exclusively in the zone of a reader. Then, we propose cardinality estimation algorithms. …

    ubc Repository record for Energy-efficient algorithm design for wireless sensor networks (opens in a new tab) Download PDF for Energy-efficient algorithm design for wireless sensor networks (opens in a new tab)

  11. Using dynamic schemas for query optimization over JSON data.

    … over Data Pilots is presented, facilitating cardinality estimation without executing operations, aiding in query optimization. Furthermore, the thesis proposes a strategy to determine when query rewriting using Document Algebra properties may be advantageous. Experimental validation …

    louisville Repository record for Using dynamic schemas for query optimization over JSON data. (opens in a new tab)

  12. Dimension reduction of streaming data via random projections

    … projections, to derive efficient estimators for cardinality, l_{alpha} distance and quasi-distance, and entropy over streaming data. I demonstrate an unexpected connection between two approaches to cardinality estimation that involve indirect record keeping: the first using pseudo-random variates …

    oxford Repository record for Dimension reduction of streaming data via random projections (opens in a new tab)

  13. Local Learning Strategies for Data Management Components

    … DBMS components with ML models. These are cardinality estimation, query optimizer hinting, and integer algorithm selection. In all three applications, the benefits of the local learning strategy are demonstrated and compared to related work. We also generalize the strategy’s usability for a …

    qucosa-diss

  14. Preserving user privacy in social media data processing

    … It features a data storage concept based on the cardinality estimator HyperLogLog to store social media data, so that it is not possible to extract individual items from it, but only to estimate the cardinality of items within a certain set, plus running set operations over multiple sets to …

    qucosa-diss

  15. Heterogeneity-Aware Placement Strategies for Query Optimization

    … This general approach includes runtime estimation of operators on different computing units as well as two approaches for defining the actual operator placement according to the estimated runtimes. The two placement approaches are local optimization, which decides the placement locally …

    qucosa-diss

Page 1 of 2