Advertisement
Published in:
2012 | OriginalPaper | Chapter
Top-k Algorithm Based on Extraction
Authors : Lingjuan Li, Xue Zeng, Guoyu Lu
Published in: Proceedings of the 2011 2nd International Congress on Computer Applications and Computational Science
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
Algorithms for top-k query are widely used in massive data query, which return k most important objects based on aggregate functions. The classical Threshold Algorithm (TA) is one of the most famous algorithms for top-k query. It requires sequential and random accesses to the lists. The time cost of TA will be very high when data is massive. This paper proposes a new algorithm TABE (Top-k Algorithm Based on Extraction) to minimize the query time. TABE first extracts the objects which have higher ranking on each attribute, and then execute the Threshold Algorithm on these objects. Test results show that TABE has high accuracy to meet the general query requirements, and the experimental results of comparing TABE with NRA (No Random Accesses) show that our proposed algorithm TABE can largely reduce the query time.