Nearest Neighbor Algorithms using xBR-Trees
Ημερομηνία
2011Λέξη-κλειδί
Επιτομή
One of the common queries in spatial databases is the (K) Nearest Neighbor Query that discovers the (K) closest objects to a query object. Processing of spatial queries, in most cases, is accomplished by indexing spatial data by an access method. In this paper, we present algorithms for Nearest Neighbor Queries using a disk based structure that belongs to the Quadtree family, the xBR-tree, that can be used for indexing large point datasets. We demonstrate performance results (I/O efficiency and execution time) of alternative Nearest Neighbor algorithms, using real datasets. © 2011 IEEE.
Collections
Related items
Showing items related by title, author, creator and subject.
-
Extended OQL for object oriented parallel query processing
Fountoukis, S. G.; Bekakos, M. P. (2007)Herein, an extension to the object query language (OQL) for incorporating binary relational expressions is investigated. The extended query language is suitable for query submissions to an object oriented database, whose ... -
The K group nearest-neighbor query on non-indexed RAM-resident data
Roumelis G., Vassilakopoulos M., Corral A., Manolopoulos Y. (2016)Data sets that are used for answering a single query only once (or just a few times) before they are replaced by new data sets appear frequently in practical applications. The cost of buiding indexes to accelerate query ... -
Plane-sweep algorithms for the K Group Nearest-Neighbor Query
Roumelis, G.; Vassilakopoulos, M.; Corral, A.; Manolopoulos, Y. (2015)One of the most representative and studied queries in Spatial Databases is the (K) Nearest-Neighbor (NNQ), that discovers the (K) nearest neighbor(s) to a query point. An extension that is important for practical applications ...