Efficient Constraint Processing for Highly Personalized Location Based Services Zhengdao Xu and Hans-Arno Jacobsen   View Paper (PDF)   Return to DEMO GROUP 2: DISTRIBUTED DATABASES Abstract Recently, with the advances in wireless communications and location positioning technology, the potential for tracking, correlating, and filtering information about moving entities has greatly increased. In this demonstration, we define two types of the location constraints, n-body and n-body (static) constraints, which model the correlation among a set of moving objects, and demonstrate an algorithm that efficiently evaluates those location constraints. We will show that our algorithm using Kd-tree indexing outperform the naïve approach even with little overhead for the partition update. ©2005 Association for Computing Machinery