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

  1. Top-K Queries Over Digital Traces

    Recent advances in social and mobile technology have enabled an abundance of digital traces (in the form of mobile check-ins, WiFi hotspots handshaking, etc.) revealing the physical presence history of diverse sets of entities. One challenging, yet important, task is to identify k entities that are …

    york Repository record for Top-K Queries Over Digital Traces (opens in a new tab)

  2. Efficient processing of Top-k queries on spatial and temporal data

    … computing various spatial and temporal queries. Among the applications, end-users are more interested in the most important query answers in the potentially enormous answer space. Therefore, different types of information systems use various techniques to rank query answers and return …

    unsw Repository record for Efficient processing of Top-k queries on spatial and temporal data (opens in a new tab)

  3. Efficient geometric algorithms for preference top-k queries, stochastic line arrangements, and proximity problems

    … the well-known problem of answering preference top-k queries, which arise in a wide range of applications in databases and computational geometry. Given a set of n points, each with d real-valued attributes, the goal is to organize the points into a suitable data structure so that user …

    umn Repository record for Efficient geometric algorithms for preference top-k queries, stochastic line arrangements, and proximity problems (opens in a new tab)

  4. Answering topband queries in time series data

    Top k queries are queries that request for k answers having the highest or lowest values for some attribute, expression, or function. These queries arise naturally in many database applications where users are interested in finding records that are closest to the values specified in a query. …

    nus Repository record for Answering topband queries in time series data (opens in a new tab) Download file for Answering topband queries in time series data (opens in a new tab)

  5. Reverse Thinking in Spatial Queries

    … number of researches are conducted on spatial queries regarding the influence of query objects. Among these queries, reverse k nearest neighbors (RkNN) query is the one studied the most extensively. Reverse k furthest neighbors (RkFN) queries is the natural complement of RkNN queries. RkNN …

    unsw Repository record for Reverse Thinking in Spatial Queries (opens in a new tab)

  6. CROWDSOURCING UNCERTAINTIES AND OPTIMIZATION

    … according to the uncertain information. We study top-k queries based on the uncertain scores of the items. We devise effective and efficient algorithms that compute the top items in a ranking. Spatial crowdsourcing applications are helpful in alleviating uncertainty. We study the assignment of …

    nus Repository record for CROWDSOURCING UNCERTAINTIES AND OPTIMIZATION (opens in a new tab) Download file for CROWDSOURCING UNCERTAINTIES AND OPTIMIZATION (opens in a new tab)

  7. Algorithms for continuous queries: A geometric approach

    … supporting potentially millions of continuous queries is a huge challenge. This dissertation addresses the problem of scalably processing a large number of continuous queries over a wide-area network. </p><p>Conceptually, the task of supporting distributed continuous queries can be divided into …

    duke Repository record for Algorithms for continuous queries: A geometric approach (opens in a new tab)

  8. Lightweight Top-K Analysis in DBMSs Using Data Stream Analysis Techniques

    … and the discovery of solutions to resolve them. Top-k analysis is common task in problem determination in database management systems. It involves the identification of the set of most frequently occurring objects according to some criteria, such as the top-k most frequently used tables or most …

    queens Repository record for Lightweight Top-K Analysis in DBMSs Using Data Stream Analysis Techniques (opens in a new tab)

  9. Similarity computation in modern applications

    … by utilizing the recent concept of reverse top-k queries. In contrast to a top-k query that returns the k products with the best score for a specific customer, the result of a reverse top-k query is the set of customers(or their rankings) for whom a given product belongs to their top-k set. …

    greece Repository record for Similarity computation in modern applications (opens in a new tab)

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

    … 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)

  11. Representative Subsets for Preference Queries

    … focus on the two overlapping areas of preference queries and dataset summarization. A (linear) preference query specifies the relative importance of the attributes in a dataset and asks for the tuples that best match those preferences. Dataset summarization is the task of representing an entire …

    uvic Repository record for Representative Subsets for Preference Queries (opens in a new tab)