This paper proposes a new problem, called superseding nearest neighbor search, on uncertain spatial databases, where each object is described by a multidimensional probability den...
Sze Man Yuen, Yufei Tao, Xiaokui Xiao, Jian Pei, D...
In this paper we discuss a new type of query in Spatial Databases, called the Trip Planning Query (TPQ). Given a set of points of interest P in space, where each point belongs to ...
For data to be successfully integrated, semantically similar database elements must be identified as candidates for merging. However, there may be significant differences between ...
The importance of topological relationships between spatial objects is recognized in many disciplines. In the field of spatial databases, topological relationships have played an ...
In order to answer efficiently range queries in 2-d R-trees, first we sort queries by means of a space filling curve, then we group them together, and finally pass them for process...