Other formats:
BibTeX
LaTeX
RIS
@article{1344376, author = {Zezula, Pavel}, article_location = {DORDRECHT}, article_number = {4}, doi = {http://dx.doi.org/10.1007/s11036-014-0547-2}, keywords = {Big data; Scalability; Information retrieval; Similarity search; Findability; Data outsourcing; Data privacy; Information extraction}, language = {eng}, issn = {1383-469X}, journal = {MOBILE NETWORKS & APPLICATIONS}, title = {Similarity Searching for the Big Data Challenges and Research Objectives}, volume = {20}, year = {2015} }
TY - JOUR ID - 1344376 AU - Zezula, Pavel PY - 2015 TI - Similarity Searching for the Big Data Challenges and Research Objectives JF - MOBILE NETWORKS & APPLICATIONS VL - 20 IS - 4 SP - 487-496 EP - 487-496 PB - SPRINGER SN - 1383469X KW - Big data KW - Scalability KW - Information retrieval KW - Similarity search KW - Findability KW - Data outsourcing KW - Data privacy KW - Information extraction N2 - Analysis of contemporary Big Data collections require an effective and efficient content-based access to data which is usually unstructured. This first implies a necessity to uncover descriptive knowledge of complex and heterogeneous objects to make them findable. Second, multimodal search structures are needed to efficiently execute complex similarity queries possibly in outsourced environments while preserving privacy. After explaining the impacts of Big Data on similarity searching and summarizing the state of the art in the search technology, four specific research objectives to tackle the challenges are outlined and discussed. It is believed that effective and efficient processing of raw data for object findability and developing hybrid similarity search structures for multi-modal and privacy-preserving searching are necessary to achieve a scalable similarity search technology able to operate on Big Data. ER -
ZEZULA, Pavel. Similarity Searching for the Big Data Challenges and Research Objectives. \textit{MOBILE NETWORKS \&{} APPLICATIONS}. DORDRECHT: SPRINGER, 2015, vol.~20, No~4, p.~487-496. ISSN~1383-469X. Available from: https://dx.doi.org/10.1007/s11036-014-0547-2.
|