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 7 of 7 for “"Top-k query processing"”.

  1. Top-K Query Processing in Edge-Labeled Graph Data

    … Subgraph matching has been extensively used as a query language for patterns in the context of edge-labeled graphs. For example, in social networks, users can specify a subgraph matching query to find all people that have certain neighborhood relationships. Heavily used fragments of the SPARQL …

    maryland Repository record for Top-K Query Processing in Edge-Labeled Graph Data (opens in a new tab)

  2. Privacy-preserving queries on encrypted databases

    … data. Recently, many efficient and scalable query processing methods over encrypted data have been proposed. Despite that, numerous challenges remain to be addressed due to the high complexity of many important queries on encrypted large-scale datasets. This thesis studies the problem of …

    bu Repository record for Privacy-preserving queries on encrypted databases (opens in a new tab)

  3. Elevating search results from flat lists to structured expansions

    … the huge number of items which can match a query, this list based interface can be very difficult for the user to explore and find important items relevant to their search needs. In this work, we consider a search scenario in which each item is annotated with a set of keywords. E.g., in Web …

    ubc Repository record for Elevating search results from flat lists to structured expansions (opens in a new tab) Download PDF for Elevating search results from flat lists to structured expansions (opens in a new tab)

  4. Composite recommendation : semantics and efficiency

    … package schema, we can efficiently find the top-k most relevant packages with hard constraints. The proposed algorithm is shown to be instance optimal, which means that no algorithm in a reasonable class can perform more than a constant times better, for some fixed constant. And we also …

    ubc Repository record for Composite recommendation : semantics and efficiency (opens in a new tab) Download PDF for Composite recommendation : semantics and efficiency (opens in a new tab)

  5. Decision making under uncertainty

    … First, we consider the problem of ranking and top-k query processing over probabilistic datasets. By illustrating the diverse and conflicting behaviors of the prior proposals, we contend that a single, specific ranking function may not suffice for probabilistic datasets. Instead we propose the …

    maryland Repository record for Decision making under uncertainty (opens in a new tab)

  6. Query-Time Data Integration

    … context is established. This thesis introduces Query-Time Data Integration as an alternative concept to traditional up-front integration. It aims at enabling users to issue ad-hoc queries on their own data as if all potential other data sources were already integrated, without declaring specific …

    qucosa-diss

  7. Αποθηκευμένες όψεις για κατατακτήριες ερωτήσεις με άνω όριο αποτελεσμάτων: επεξεργασία ερωτήσεων, ενημέρωση και ομοιότητα

    … is to explore and investigate the answering of top-k queries through the exploitation of materialized top-k views. In addition, we study the problem of capturing the distance function that best complies with human perception for finding the similarity between two data collections of …

    greece Repository record for Αποθηκευμένες όψεις για κατατακτήριες ερωτήσεις με άνω όριο αποτελεσμάτων: επεξεργασία ερωτήσεων, ενημέρωση και ομοιότητα (opens in a new tab)