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 10 of 10 for “"Partitioning Strategies"”.

  1. Partitioning Strategies to Enhance Symbolic Execution

    … using symbolic values and heuristic exploration strategies. Although various exploration strategies have been proposed in the past, the number of Satisfiability Modulo Theories (SMT) solver calls for reaching a target is still large, resulting in longer execution times for programs containing …

    vt Repository record for Partitioning Strategies to Enhance Symbolic Execution (opens in a new tab)

  2. Database partitioning strategies for social network data

    … prototyped and benchmarked two different data partitioning strategies for social network type workloads. The first strategy takes advantage of the heavy-tailed degree distributions of social networks to optimize the latency of vertex neighborhood queries. The second strategy takes advantage of …

    mit Repository record for Database partitioning strategies for social network data (opens in a new tab)

  3. An experimental comparison of partitioning strategies in distributed graph processing

    … thesis, we study the problem of choosing among partitioning strategies in distributed graph processing systems. To this end, we evaluate and characterize both the performance and resource usage of different partitioning strategies under various popular distributed graph processing systems, …

    uiuc Repository record for An experimental comparison of partitioning strategies in distributed graph processing (opens in a new tab)

  4. Parallel algorithms for CAD with applications to circuit extraction

    … shared memory multiprocessor, for different partitioning strategies.

    uiuc Repository record for Parallel algorithms for CAD with applications to circuit extraction (opens in a new tab)

  5. Towards Efficient and Flexible Object Storage Using Resource and Functional Partitioning

    … dissertation studies how resource and functional partitioning strategies can improve efficiency and flexibility of object stores. This dissertation presents a series of practical and efficient techniques, algorithms, and optimizations to realize efficient and flexible object stores. The …

    vt Repository record for Towards Efficient and Flexible Object Storage Using Resource and Functional Partitioning (opens in a new tab)

  6. Secure application partitioning for intellectual property protection

    … incur a sizeable performance overhead. Partitioning an application into secure and insecure regions can help diminish overheads but invalidates guarantees of privacy and access control. This work examines the problem of securely partitioning an application into public and private regions …

    mit Repository record for Secure application partitioning for intellectual property protection (opens in a new tab)

  7. Performance Tuning and Modeling of Communication in Parallel Applications

    … dimensional data decomposition, and for two file partitioning strategies, namely even and static partitioning.

    houston Repository record for Performance Tuning and Modeling of Communication in Parallel Applications (opens in a new tab)

  8. A study of graph partitioning techniques for fast indexing and query processing of a large RDF graph

    … thesis, we study the impact of existing graph partitioning techniques on indexing and query processing of a large RDF graph (e.g., YAGO [40]) with millions of edges and vertices. Our goal is to partition a large RDF graph into smaller graphs and then index the smaller graphs efficiently for …

    umkc Repository record for A study of graph partitioning techniques for fast indexing and query processing of a large RDF graph (opens in a new tab)

  9. Elastic database systems

    … to traditional single-tier hash and range partitioning strategies, E-Store manages hot spots through a two-tier data placement strategy: cold data is distributed in large chunks, while smaller ranges of hot tuples are assigned explicitly to individual nodes. P-Store is an elastic OLTP DBMS …

    mit Repository record for Elastic database systems (opens in a new tab)

  10. Técnicas de particionamiento multidimensional basadas en índices multiatributo en bases de datos paralelas

    … in the execution of a query. Frequently, the partitioning of relations is made by a single attribute, sending tupies to different disks by depending on the valué of the tupie on the partitioning attribute. This way to fragment data is useful when the partitioning attribute is involved in the …

    upm Repository record for Técnicas de particionamiento multidimensional basadas en índices multiatributo en bases de datos paralelas (opens in a new tab)