A. Corral, Y. Manolopoulos, Y. Theodoridis, M. Vassilakopoulos  Home/Search
Context
Related
| delab.csd.auth.gr/paper...DKE04cmtv.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: delab.csd.auth.gr/papers/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This paper addresses the problem of finding the K closest pairs between two spatial datasets (the socalled, K closest pairs query, K-CPQ), where each dataset is stored in an R-tree. There are two di#erent techniques for solving this kind of distance-based query. The first technique is the incremental approach, which returns the output elements one-by-one in ascending order of distance. The second one is the nonincremental alternative, which returns the K elements of the result all together at... (Update)
Similar documents (at the sentence level):
5.5%: Algorithms for Processing K-closest-pair Queries.. - Corral.. (2004) (Correct)
Active bibliography (related documents): More All
0.4: R-Trees Have Grown Everywhere - Manolopoulos, Nanopoulos.. (Correct)
0.2: Efficient Record Linkage in Large Data Sets - Jin, Li, Mehrotra (2003) (Correct)
0.2: NNH: Improving Performance of Nearest-Neighbor Searches Using .. - Jin, Koudas, Li (2004) (Correct)
Similar documents based on text: More All
0.7: Closest Pair Queries in Spatial Databases - Corral, Manolopoulos.. (2000) (Correct)
0.4: Algorithms for Joining R-trees and Linear Region.. - Corral.. (1999) (Correct)
0.3: Parallel Bulk-Loading of Spatial Data - Apostolos Papadopoulos Yannis (Correct)
BibTeX entry: (Update)
@misc{ corral-algorithms,
author = "A. Corral and Y. Manolopoulos and Y. Theodoridis and M. Vassilakopoulos",
title = "Algorithms for processing K-closest-pair queries in spatial databases",
url = "citeseer.ist.psu.edu/article/corral04algorithms.html" }
Citations (may not include all citations):1254 Computational Geometry: An Introduction (context) - Preparata, Shamos - 1985
765 trees: a dynamic index structure for spatial searching (context) - Guttman - 1984
266 An optimal algorithm for approximate nearest neighbor search.. - Arya, Mount et al. - 1998
262 Multidimensional access methods - Gaede, unther - 1998
247 An algorithm for finding best matches in logarithmic expecte.. (context) - Friedman, Bentley et al. - 1977
233 tree: a dynamic index for multidimensional objects - Sellis, Roussopoulos et al. - 1987
193 Nearest neighbor queries - Roussopoulos, Kelley et al. - 1995
121 External-memory computational geometry - Goodrich, Tsay et al. - 1993
115 Partition based spatial-merge join - Patel, DeWitt - 1996
110 Fundamentals of Spatial Information Systems (context) - Laurini, Thomson - 1992
109 A fast procedure for computing the distance between complex .. (context) - Gilbert, Johnson et al. - 1988
103 Ranking in spatial databases - Hjaltason, Samet - 1995
81 Spatial hash-joins - Lo, Ravishankar - 1996
59 cient and robust access method for points and rectangles (context) - Beckmann, Kriegel et al. - 1990
55 Spatial joins using R-trees: breadth-first traversal with gl.. - Huang, Jing et al. - 1997
49 Size separation spatial join - Koudas, Sevcik - 1997
48 Distance browsing in spatial databases - Hjaltason, Samet - 1999
41 Incremental distance join algorithms for spatial databases - Hjaltason, Samet - 1998
26 Cost models for join queries in spatial databases - Theodoridis, Stefanakis et al.
24 Processing and optimization of multiway spatial joins using .. - Papadias, Mamoulis et al. - 1999
21 Closest pair queries in spatial databases - Corral, Manolopoulos et al. - 2000
20 Performance of nearest neighbor queries in R-trees (context) - Papadopoulos, Manolopoulos - 1997
17 cient processing of spatial joins using R-trees (context) - Brinkho, Kriegel et al. - 1993
11 Enhanced nearest neighbour search on the R-tree - Cheung, Fu - 1998
10 er management strategies for relational database systems (context) - Chou, DeWitt et al. - 1985
9 Adaptive multi-stage distance jo (context) - Shin, Moon et al. - 2000
8 Principles of database bu#er management (context) - elsberg, Harder - 1984
2 Minimum vertex distance between separable convex polygons (context) - Chin, Wang - 1984
2 Scientific Publishing Company (context) - Ibaraki, Operations - 1987
2 Downloadable from <http:// technet (context) - Network, User et al. - 2001
2 er management of indexes (context) - Chan, Ooi et al. - 1992
2 Object-Relational Database Development (context) - Brown - 2001
2 ering for the closest pairs queries using Rtrees (context) - Corral, Vassilakopoulos et al. - 2001
2 Digital Chart of the World: real spatial datasets of the wor.. (context) - of, real et al. - 1997
Documents on the same site (http://delab.csd.auth.gr/papers/): More
Exploiting Web Log Mining for Web Cache Enhancement - Nanopoulos, Katsaros.. (Correct)
Binomial Coefficient Computation: Recursion or Iteration - Manolopoulos (Correct)
Efficient Storage and Querying of Sequential.. - Nanopoulos.. (2003) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC