Titlebook: Advances in Spatial and Temporal Databases; 10th International S Dimitris Papadias,Donghui Zhang,George Kollios Conference proceedings 2007

獨(dú)輪車

Hao Lu,Wenze Liu,Hongtao Fu,Zhiguo Cao regions. Our model focuses on leveraging information about the . topological relationships that hold between the components of two spatial objects, thereby providing a . view of the overall global topological relationship.

syring

Qihang Zhang,Zhenghao Peng,Bolei Zhouystem is used to anonymize a query by mapping it to a random group of . users that are consecutive in the 1-D space. Compared to existing state-of-the-art, . does not provide theoretical anonymity guarantees for skewed query distributions. Nevertheless, it achieves strong anonymity in practice, and

惡臭

,Tracking by?Associating Clips,uch approaches treat points as vectors in space and do not exploit their spatial properties. In contrast, we use Hilbert curves as efficient one-way transformations and design algorithms to evaluate a KNN query in the Hilbert transformed space. Consequently, we reduce the complexity of computing a K

tendinitis

Hanbin Hong,Binghui Wang,Yuan Hongnguishes between location privacy and query privacy. By this distinction, we achieve two main goals: (1)?supporting private location-based services to those customers with public locations, and (2)?performing spatial cloaking on-demand basis only (i.e., when issuing queries) rather than exhaustively

chance

Qi Fan,Chi-Keung Tang,Yu-Wing Tai-time algorithm that solves the problem (unless P=NP). Hence, in this work we consider heuristics for the problem. Three methods for computing a short .-route are presented. The three methods are compared analytically and experimentally. For these three methods, experiments on both synthetic and rea

難解

ANT

Mri485

集合

刺激

Generalizing the Optimality of Multi-step ,-Nearest Neighbor Query Processing,reducing the number of candidates. In this paper, we generalize the traditional concept of .-optimality and introduce the notion of ..-optimality depending on the distance information . available in the filter step. We propose a new multi-step .NN search algorithm that utilizes lower- and upper boun