Searching Big Data via cyclic groups
Timur Karacay · Global Journal of Computer Sciences Theory and Research · 2017
We look up for a certain information in big data. To achieve this task we first endow the big data with a group structure and partition it to it’s cyclic subgroups. We devise a method to search the whole big data starting from the smallest subroup through the largest one. Our method eventually exhausts the whole big data. Keywords: BigData, topological groups, dual groups, linear search.