There are several algorithms like binary search, linear search, Interpolation search, Ternary search and, etc used for search. Search algorithms locate the position of an item in a sorted. But the time taken for the search is huge. The search algorithm initially set the first and last index for the search; this directly leads to the time complexity. This paper proposes a new prefix search indexing algorithm is called Subset Count Index Based Search Algorithm (SCIBS). This algorithm achieved the effective search with minimum time by restricting search only inside the subset instead of searching in entire dataset. This algorithm prefixes any search algorithm, reduces the time complexity by defining the proper subset for the search. The SCIBS algorithm reduces the comparison ratio. The algorithm is very effective on huge collection of data. The search time will reduce based on the length L. The experimental result shows 99.97 percentage improvements on linear search and 93.34% improvement on binary search if the Length equals two.