The idea of statistical analysis of facets in lucene-essentially the same as word count count

Source: Internet
Author: User

Http://stackoverflow.com/questions/185697/the-most-efficient-way-to-find-top-k-frequent-words-in-a-big-word-sequence

http://www.geeksforgeeks.org/find-the-k-most-frequent-words-from-a-file/

Http://cs.stackexchange.com/questions/26427/word-frequency-with-ordering-in-on-complexity

The idea is roughly as follows:

(1) Hash table statistics Word occurrences, and then look for top K appears, wherein the top K can use N*log (k) heap ideas, or quick-line ideas, or bucket sequencing ideas (previously in FBT to achieve real-time integration sequencing);

(2) using Trie to count the number of words, and then to facilitate trie, the use of heap sorting ideas to find top K;

(3) The use of buckets, especially when you know the maximum number of occurrences, similar to the previous implementation of the FBT real-time integration sorting, and then from large to small to remove the top K;

(4) Use map reduce.

The idea of statistical analysis of facets in lucene-essentially the same as word count count

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.