Searching Big Data via cyclic groups
Article Sidebar
Main Article Content
Abstract
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.
Downloads
Article Details
Global Journal of Computer Sciences: Theory and Research is an Open Access Journal. All articles can be downloaded free of charge. Articles published in the Journal are Open-Access articles distributed under CC-BY license [Attribution 4.0 International (CC BY 4.0)]
Birlesik Dunya Yenilik Arastirma ve Yayincilik Merkezi (BD-Center) is a gold open access publisher. At the point of publication, all articles from our portfolio of journals are immediately and permanently accessible online free of charge. BD-Center articles are published under the CC-BY license [Attribution 4.0 International (CC BY 4.0)], which permits unrestricted use, distribution, and reproduction in any medium, provided the original authors and the source are credited.