This is an implementation of the Top-k-join algorithm also known as HRJN.
-
Updated
Oct 3, 2024 - Python
This is an implementation of the Top-k-join algorithm also known as HRJN.
This project delves into the domain of dominance-based queries, crucial in complex decision support systems, and focuses on scalable processing methodologies.
Every game in the palm of your hand!
Implementation of Threshold Top-k algorithm in python
Project using Python, Hive and MapReduce to compare various techniques to find the top K words in a very large file i.e. different techniques to process Big Data.
Repository for all assignments of the course COL761: Data Mining (Fall 2020), taught at IIT Delhi
Fagin's algorithm: Fagin's algorithm: 1. Do sorted access on all lists in parallel. 2. For every item - do random access to the other lists to fetch all of its values. 3. Stop when at least K items were seen in the sorted access. 4. Sort the list.
A Hierarchical Framework for Top-k Location-aware Error-tolerant Keyword Search (ICDE2019)
NRA algorithm for top-k query of NBA players by chosen stats and Skyline detection.
LaTeX source of my bachelor thesis “Fast and Non-Approximative Language Model Prefixqueries for Word Prediction using Top-k Joining Techniques”.
Add a description, image, and links to the top-k-query topic page so that developers can more easily learn about it.
To associate your repository with the top-k-query topic, visit your repo's landing page and select "manage topics."