TY - GEN

T1 - An efficient sum query algorithm for distance-based locally dominating functions

AU - Huang, Ziyun

AU - Xu, Jinhui

N1 - Funding Information:
∗ This research was supported in part by NSF through Grants IIS-1422591, CCF-1422324, CNS-1547167, and CCF-1716400.

PY - 2017/12/1

Y1 - 2017/12/1

N2 - In this paper, we consider the following sum query problem: Given a point set P in Rd, and a distance-based function f(p, q) (i.e., a function of the distance between p and q) satisfying some general properties, the goal is to develop a data structure and a query algorithm for efficiently computing a (1)-Approximate solution to the sum P p2P f(p, q) for any query point q 2 Rd and any small constant 0. Existing techniques for this problem are mainly based on some core-set techniques which often have difficulties to deal with functions with local domination property. Based on several new insights to this problem, we develop in this paper a novel technique to overcome these encountered difficulties. Our algorithm is capable of answering queries with high success probability in time no more than Od(n0.5+c), and the underlying data structure can be constructed in d(n1+c) time for any c > 0, where the hidden constant has only polynomial dependence on and d. Our technique is simple and can be easily implemented for practical purpose.

AB - In this paper, we consider the following sum query problem: Given a point set P in Rd, and a distance-based function f(p, q) (i.e., a function of the distance between p and q) satisfying some general properties, the goal is to develop a data structure and a query algorithm for efficiently computing a (1)-Approximate solution to the sum P p2P f(p, q) for any query point q 2 Rd and any small constant 0. Existing techniques for this problem are mainly based on some core-set techniques which often have difficulties to deal with functions with local domination property. Based on several new insights to this problem, we develop in this paper a novel technique to overcome these encountered difficulties. Our algorithm is capable of answering queries with high success probability in time no more than Od(n0.5+c), and the underlying data structure can be constructed in d(n1+c) time for any c > 0, where the hidden constant has only polynomial dependence on and d. Our technique is simple and can be easily implemented for practical purpose.

UR - http://www.scopus.com/inward/record.url?scp=85038595613&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85038595613&partnerID=8YFLogxK

U2 - 10.4230/LIPIcs.ISAAC.2017.47

DO - 10.4230/LIPIcs.ISAAC.2017.47

M3 - Conference contribution

AN - SCOPUS:85038595613

T3 - Leibniz International Proceedings in Informatics, LIPIcs

BT - 28th International Symposium on Algorithms and Computation, ISAAC 2017

A2 - Tokuyama, Takeshi

A2 - Okamoto, Yoshio

PB - Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing

T2 - 28th International Symposium on Algorithms and Computation, ISAAC 2017

Y2 - 9 December 2017 through 22 December 2017

ER -