Essays about: "Top-k query"

Found 2 essays containing the words Top-k query.

1. 1. Continuous Parallel Approximate Frequent Elements Queries on Data Streams

   University essay from Göteborgs universitet/Institutionen för data- och informationsteknik

   Author : Victor Jarlow; [2021-10-06]
   Keywords : computer science; big data; Space-Saving; Misra-Gries summary; frequent items; frequent elements; concurrent programming; Delegation Sketch; domain splitting; Count-Min Sketch; Majority algorithm; pproximate frequent-elements algorithm; approximate top-k elements algorithm;

   Abstract : The frequent elements problem involves processing a stream of elements and finding all elements that occur more than a given fraction of the time. A relaxed version of this problem is the -approximate elements problem which allows some false positives. READ MORE

3. 2. TOP-K AND SKYLINE QUERY PROCESSING OVER RELATIONAL DATABASE

   University essay from JTH. Forskningsmiljö Informationsteknik

   Author : Rafat Samara; [2012]
   Keywords : Top-k query; Skyline query; Fagin’s algorithm; Threshold Algorithm; No random access algorithm; Minimal Probing algorithm; Block-Nested-Loop algorithm; Nearest Neighbor algorithm; Branch and Bound Skyline Algorithm; Divide and Conquer algorithm;

   Abstract : Top-k and Skyline queries are a long study topic in database and information retrieval communities and they are two popular operations for preference retrieval. Top-k query returns a subset of the most relevant answers instead of all answers. Efficient top-k processing retrieves the k objects that have the highest overall score. READ MORE