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 15 of 15 for “"index structures"”.

  1. Learned String Index Structures for In-Memory Databases

    … methods have brought new perspective to indexing by reframing it as a cumulative distribution function (CDF) modeling problem. The burgeoning field, despite its nascence, has brought with it many opportunities and efficiencies. However, most work in this area has focused on efficiently …

    mit Repository record for Learned String Index Structures for In-Memory Databases (opens in a new tab)

  2. Efficient indexing of spatial objects in object-oriented databases

    The use of index structures can increase the performance of query processing. However, the index structures for standard databases are not suitable for the non-standard database applications such as geographical applications, CAD applications, VLSI designs and image processing. For non-standard …

    uiuc Repository record for Efficient indexing of spatial objects in object-oriented databases (opens in a new tab)

  3. Two -Photon Polymerization of Defects in Photonic Crystals

    … colloidal photonic crystals to higher refractive index structures that exhibit complete PBGs. To this end, self-assembled photonic crystals with embedded TPP features were replicated in silicon. The TPP features and colloidal crystal served as a template for the final structure---a silicon-air …

    uiuc Repository record for Two -Photon Polymerization of Defects in Photonic Crystals (opens in a new tab)

  4. Microscopic and spectral characterisation of optical Fibre Bragg gratings

    … thesis to investigate the internal refractive index structures of FBGs fabricated using various techniques. By measuring the light transmitted through FBGs at various wavelengths, the information gained from spectral measurements has been compared with the DIC images. The sensing capacities of …

    vu-aus Repository record for Microscopic and spectral characterisation of optical Fibre Bragg gratings (opens in a new tab)

  5. Analysis of Encoding Schemes for String Indexing

    Lookup of strings into in-memory database indexes is a problem with different considerations from those using integer keys. With their variable sizes, efficiently inserting strings into indexes should account for properties specific to strings. We investigate learning alternate schemes for encoding …

    mit Repository record for Analysis of Encoding Schemes for String Indexing (opens in a new tab)

  6. Optimizing relational search with embedded neural network

    … string matching using traditional full-text index structures. We propose a solution to overcome the bottleneck by incorporating horizontally partitioned full-text indexes and an embeddable neural network classifier in the query processing pipeline. The classifier is trained with …

    uoit Repository record for Optimizing relational search with embedded neural network (opens in a new tab)

  7. An indexing-based approach for rapid and efficient product information integration and retrieval

    … database built of optimized data tables and index structures from the underlying product databases. We exemplify the multiple challenges, such as disparity of data types (structured, unstructured, and geometric) within and across the databases, redundancy of information, huge data set, rapid …

    uiuc Repository record for An indexing-based approach for rapid and efficient product information integration and retrieval (opens in a new tab)

  8. Template B+ trees: an index scheme for fast data streams with distributed append-only stores

    … generate consistent snapshots of the database. Indexing is the key to enable efficient query processing by fast data retrieval and aggregation under such a system architecture. This thesis presents a new in-memory indexing scheme for distributed append-only stores. Our new scheme utilizes …

    uiuc Repository record for Template B+ trees: an index scheme for fast data streams with distributed append-only stores (opens in a new tab)

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

    … 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 execution algorithm and indexes that support the …

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

  10. Multicore Scalability Through Asynchronous Work

    … Second, a concurrent and highly scalable index-structure called Hydralist for multi-core. The key idea behind design of Hydralist is that an index-structure can be divided into two component (search layer and data layer) and updates to data layer can be done synchronously while updates to …

    vt Repository record for Multicore Scalability Through Asynchronous Work (opens in a new tab)

  11. Electrostatic Self-Assembly of Linear and Nonlinear Optical Thin Films

    … the fabrication of complicated refractive index profiles required for linear optical interference filters. The inherent ordered nature of ESA films yielded extremely stable noncentrosymmetric thin films for second-order nonlinear optical applications. The ESA technique offers numerous …

    vt Repository record for Electrostatic Self-Assembly of Linear and Nonlinear Optical Thin Films (opens in a new tab)

  12. Advanced Methods for Large and Long String/Set Similarity Searches

    … various similarity functions, as well as learned index and representation learning-based SSS algorithms, with three key research contents: Top-k overlap string similarity join: A step size-based algorithm is proposed to optimize traditional methods. Theoretical analysis verifies the positive …

    uts Repository record for Advanced Methods for Large and Long String/Set Similarity Searches (opens in a new tab)

  13. High-dimensional indexing methods utilizing clustering and dimensionality reduction

    … increase. A variety of multi-dimensional index structures have been proposed to improve the efficiency of k-NN query processing, which work well in low-dimensional space but lose their efficiency in high-dimensional space due to the curse of dimensionality. This inefficiency is dealt in …

    njit Repository record for High-dimensional indexing methods utilizing clustering and dimensionality reduction (opens in a new tab)

  14. Effective and efficient similarity search in databases

    … similarity measure. After that, a similarity index for string attributes is proposed, the State Set Index (SSI), which is based on a trie (prefix tree) that is interpreted as a nondeterministic finite automaton. For processing range queries, the notion of query plans is introduced in this …

    potsdam-diss Repository record for Effective and efficient similarity search in databases (opens in a new tab)

  15. Information retrieval and mining in high dimensional databases

    … between the atomic units. Patterns are rigid substructures that may occur in a graph after allowing for an arbitrary number of whole-structure rotations and translations as well as a small number (specified by the user) of edit operations in the patterns or in the graph. (When a pattern appears …

    njit Repository record for Information retrieval and mining in high dimensional databases (opens in a new tab)