APPROXIMATE SEARCH FOR BIG DATA WITH APPLICATIONS IN INFORMATION SECURITY – A SURVEY


DOI: https://doi.org/10.15308/Synthesis-2015-774
Authors:
Slobodan Petrović


Keywords:
Big Data, approximate search, bit-parallelism, information security, constraints.


Abstract:
This paper is a survey of approximate search techniques in very large data sets (so-called Big Data). After a short introduction, some techniques for speeding up approximate search in such data sets based on exploitation of inherent bit-parallelism in computers are described. It then reviews the applications in search related to information security problems (digital forensics, malware detection, intrusion detection) are reviewed. Finally, the need for constraints in approximate search regarding the number of so-called elementary edit operations and the run lengths of particular elementary edit operations is explained and the status of on-going research on efficient implementation of approximate search algorithms with various constraints is given.

CITATION:

IEEE format

S. Petrović, “APPROXIMATE SEARCH FOR BIG DATA WITH APPLICATIONS IN INFORMATION SECURITY – A SURVEY,” in Synthesis 2015 - International Scientific Conference of IT and Business-Related Research, Belgrade, Singidunum University, Serbia, 2015, pp. 774-. doi:10.15308/Synthesis-2015-774

APA format

Petrović, S. (2015). APPROXIMATE SEARCH FOR BIG DATA WITH APPLICATIONS IN INFORMATION SECURITY – A SURVEY. Paper presented at Synthesis 2015 - International Scientific Conference of IT and Business-Related Research. doi:10.15308/Synthesis-2015-774

BibTeX format
Download

RefWorks Tagged format
Download