Spatial data are common in many scientific and commercial domains such as geographical
information systems and gene/protein expression profiles. Querying for distribution patterns …

In this paper, we study the spatial pattern matching (SPM) query. Given a set D of spatial
objects (eg, houses and shops), each with a textual description, we aim at finding all …

Analysis of range queries on spatial (multidimensional) data is both important and
challenging. Most previous analysis attempts have made certain simplifying assumptions …

This paper proposes a group version of the nearest neighbor (NN) query, called the nearest
neighborhood (NNH) query, which aims to find the nearest group of points, instead of one …

Processing of spatial queries has been studied extensively in the literature. In most cases, it
is accomplished by indexing spatial data using spatial access methods. Spatial indexes …

As online spatial datasets grow both in number and sophistication, it becomes increasingly
difficult for users to decide whether a dataset is suitable for their tasks, especially when they …

Many spatial applications require the ability to display locations of geographic data entries
on an online map. For example, an online photo-sharing service may wish to display photos …

Can we quickly explore large multidimensional data in main memory? Adaptive indexing
responds to this need by building an index incrementally, in response to queries; in its …

E cient processing of queries in spatial database systems relies upon auxiliary indexing
structures. A large number of spatial indexing structures have been proposed. In this short …

In this paper, we identify and solve a new type of spatial queries, called continuous visible
nearest neighbor (CVNN) search. Given a data set P, an obstacle set O, and a query line …