[PDF][PDF] Rankreduce–processing k-nearest neighbor queries on top of mapreduce

A Stupar, S Michel, R Schenkel - Large-Scale Distributed Systems for …, 2010 - Citeseer
We consider the problem of processing K-Nearest Neighbor (KNN) queries over large data
sets where the index is jointly maintained by a set of machines in a computing cluster. The …
A Mishchenko, X Wang, T Kam - Proceedings of the 40th annual Design …, 2003 - dl.acm.org
Structuring and map** of a Boolean function is an important problem in the design of
complex integrated circuits. Library-aware constructive decomposition offers a solution to …

Similarity caching in large-scale image retrieval

F Falchi, C Lucchese, S Orlando, R Perego… - Information processing & …, 2012 - Elsevier
Feature-rich data, such as audio-video recordings, digital images, and results of scientific
experiments, nowadays constitute the largest fraction of the massive data sets produced …

Large-scale similarity data management with distributed metric index

D Novak, M Batko, P Zezula - Information processing & management, 2012 - Elsevier
Metric space is a universal and versatile model of similarity that can be applied in various
areas of non-text information retrieval. However, a general, efficient and scalable solution for …

D-cache: Universal distance cache for metric access methods

T Skopal, J Lokoc, B Bustos - IEEE Transactions on Knowledge …, 2011 - ieeexplore.ieee.org
The caching of accessed disk pages has been successfully used for decades in database
technology, resulting in effective amortization of I/O operations needed within a stream of …

Similarity search for an extreme application: Experience and implementation

V Mic, T Raček, A Křenek, P Zezula - International Conference on Similarity …, 2021 - Springer
Contemporary challenges for efficient similarity search include complex similarity functions,
the curse of dimensionality, and large sizes of descriptive features of data objects. This …

Similarity searching for the big data: Challenges and research objectives

P Zezula - Mobile Networks and Applications, 2015 - Springer
Abstract 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 …

Identifying unvisited portions of visited information

E Kondratova, O Islam, P Ionescu, IV Onut - US Patent 9,430,567, 2016 - Google Patents
Identifying unvisited portions of visited information to visit includes receiving information to
crawl, wherein the infor mation is representative of one of web based information and non …

An efficient peer-to-peer indexing tree structure for multidimensional data

R Zhang, W Qian, A Zhou, M Zhou - Future Generation Computer Systems, 2009 - Elsevier
As one of the most important technologies for implementing large-scale distributed systems,
peer-to-peer (P2P) computing has attracted much attention in both research and industrial …