Name
Abstract | ||
|---|---|---|
In spatial databases, there are two basic types of queries, namely nearest neighbour queries (kNN) and range queries. Spatial range queries are not only finding objects of interest within a certain range or radius, but feature a wide spectrum: from finding objects of interest to forming the range (or region). Therefore, in this paper, we coin a term \"Region Queries\" to indicate a broad category of spatial range queries. It is imperative to understand the full capabilities of region queries, before starting to work on processing and optimising such queries. The aim of this paper is to show a complete picture of region queries. In this study, we present taxonomy of region queries, comprising of three categories: (i) finding objects of interest, (ii) forming regions, and (iii) determining centroids. These three query types form a comprehensive view of what region queries are about. Region is an important concept in many aspects of spatial information systems.Spatial query processing is one of the important applications of online maps.The study of spatial databases has some roots in computational geometry. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1016/j.jcss.2014.12.025 | Journal of Computer and System Sciences |
Keywords | Field | DocType |
Spatial databases,Spatial queries,Range queries,Region queries,Query processing | Spatial analysis,Data mining,Nearest neighbour,Conjunctive query,Information retrieval,Computer science,Range query (data structures),Computational geometry,Spatial query,Database,Spatial database,Centroid | Journal |
Volume | Issue | ISSN |
81 | 8 | 0022-0000 |
Citations | PageRank | References |
7 | 0.54 | 27 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| David Taniar | 1 | 1890 | 189.50 |
| J. Wenny Rahayu | 2 | 1275 | 106.72 |