Direct neighbor search
We propose a novel query type called direct neighbor (DN) query. DN finds various applications, including competitor analysis and recommendation systems. We investigate DN and its variants (namely, K-DN and all-DN problems). We devise I/O optimal algorithms for DN and K-DN queries. We develop a novel, highly scalable algorithm for all-DN processing.
direct neighbors window query low-dimensional search