0
I Use This!
Activity Not Available
Analyzed 9 months ago. based on code collected 9 months ago.

Project Summary

Prefix tree implementation for indexing of documents. Prefix Queries will be searched for in the prefix tree and a depth first search will return back all the documents having prefix query as prefix of some token. Bitset union and intersection returns the documents, hence the score for query. Maintaining a database to store hit list for each document and thus rank the docuemnts.

Tags

search complete auto suggestions

In a Nutshell, autocompletesuggestions...

 No recognizable code

Open Hub computes statistics on FOSS projects by examining source code and commit history in source code management systems. This project has code locations but that location contains no recognizable source code for Open Hub to analyze.

This Project has No vulnerabilities Reported Against it

Did You Know...

  • ...
    Black Duck offers a free tool to discover if there are open source vulnerabilities in your code
  • ...
    you can subscribe to e-mail newsletters to receive update from the Open Hub blog
  • ...
    in 2016, 47% of companies did not have formal process in place to track OS code
  • ...
    data presented on the Open Hub is available through our API

 No recognizable code

Open Hub computes statistics on FOSS projects by examining source code and commit history in source code management systems. This project has code locations but that location contains no recognizable source code for Open Hub to analyze.

Community Rating

Be the first to rate this project
Click to add your rating
   Spinner
Review this Project!