Filters








9,676 Hits in 5.5 sec

Algorithms for processing K-closest-pair queries in spatial databases

A. Corral, Y. Manolopoulos, Y. Theodoridis, M. Vassilakopoulos
2004 Data & Knowledge Engineering  
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.  ...  use them in the design of three non-incremental branch-and-bound algorithms for K-CPQ between spatial objects stored in two R-trees.  ...  To the authorsÕ knowledge, [8, 21, 33] are the most relevant references for closest pairs queries (CPQ) in spatial databases using R-trees.  ... 
doi:10.1016/j.datak.2003.08.007 fatcat:c6smog6ps5bz3n6uyfr7uqh52i

Processing Constrained k-Closest Pairs Queries in Crime Databases [chapter]

Shaojie Qiao, Changjie Tang, Huidong Jin, Shucheng Dai, Xingshu Chen, Michael Chau, Jian Hu
2009 Annals of Information Systems  
In order to cope with the problem of discovering the closest pairs of objects within a constrained spatial region, as required in crime investigation applications, we propose a query processing algorithm  ...  The algorithm incrementally extends the query window without searching the whole workspace for multiple types of spatial objects.  ...  We propose a novel constrained k-closest pairs query processing algorithm based on growing windows in crime databases, namely GWCCP.  ... 
doi:10.1007/978-1-4419-1325-8_4 fatcat:ttqp3gecxjfdfme65qqpxnb7iu

Efficient k-Closest-Pair Range-Queries in Spatial Databases

Shaojie Qiao, Changjie Tang, Jing Peng, Hongjun Li, Shengqiao Ni
2008 2008 The Ninth International Conference on Web-Age Information Management  
In order to efficiently retrieve the k closest pairs between two spatial data sets in a specified space, such as in GIS and CAD applications, we propose a novel algorithm to handle the k-closest-pair range-query  ...  Then, we use R*-tree to store closest pairs and give algorithms for maintaining this structure.  ...  One important spatial database query is called "k Closest Pairs Query" (k-CPQ), which combines join and nearest neighbor queries in order to find the closest k pairs of spatial objects from two distinct  ... 
doi:10.1109/waim.2008.12 dblp:conf/waim/QiaoTPLN08 fatcat:3fe446m5bjg3lapx4clb2gh7ri

Closest Pair Queries with Spatial Constraints [chapter]

Apostolos N. Papadopoulos, Alexandros Nanopoulos, Yannis Manolopoulos
2005 Lecture Notes in Computer Science  
In this work we focus on constrained closest-pair queries (CCPQ), between two distinct datasets D A and D B , where objects from DA must be enclosed by a spatial region R.  ...  An extension to this problem is to generate the k closest pairs of objects (k-CPQ).  ...  Processing Techniques The Semi Closest-Pair Algorithm (SCP) Algorithms that process k-CPQ queries can be adapted in order to answer k-CSCPQ queries.  ... 
doi:10.1007/11573036_1 fatcat:uqos5wuburcq3aj4krvmo3676u

On Spatial-Range Closest-Pair Query [chapter]

Jing Shan, Donghui Zhang, Betty Salzberg
2003 Lecture Notes in Computer Science  
An important query for spatial database research is to find the closest pair of objects in a given space.  ...  In this paper, we address the closest pair problem within the same data set. Further more, we propose a practical extension to the closest pair problem to involve a query range.  ...  One important spatial database query is the closest pair (CP) query, which is to find the closest pair of objects among two data sets.  ... 
doi:10.1007/978-3-540-45072-6_15 fatcat:qkgyndzfonhilleqo6cmpri654

Spatial Queries in the Presence of Obstacles [chapter]

Jun Zhang, Dimitris Papadias, Kyriakos Mouratidis, Manli Zhu
2004 Lecture Notes in Computer Science  
Despite the existence of obstacles in many database applications, traditional spatial query processing utilizes the Euclidean distance metric assuming that points in space are directly reachable.  ...  We propose efficient algorithms for the most important query types, namely, range search, nearest neighbors, e-distance joins and closest pairs, considering that both data objects and obstacles are indexed  ...  Fig. 11 shows the OCP algorithm for retrieval of k closest-pairs.  ... 
doi:10.1007/978-3-540-24741-8_22 fatcat:fw53ai3dgzexnnsgrnj3zjtt4a

Query processing in spatial databases containing obstacles

Jun Zhang, Dimitris Papadias, Kyriakos Mouratidis, Zhu Manli
2005 International Journal of Geographical Information Science  
We propose efficient algorithms for the most important query types, namely, range search, nearest neighbours, e-distance joins, closest pairs and distance semi-joins, assuming that both data objects and  ...  Despite the existence of obstacles in many database applications, traditional spatial query processing assumes that points in space are directly reachable and utilizes the Euclidean distance metric.  ...  Figure 12 shows the OCP algorithm for retrieval of k closest pairs.  ... 
doi:10.1080/13658810500286935 fatcat:f5g74lqz2zcshnvvvhaeqwac5i

An Algorithm for Multi-way Distance Join Query

Yin Liang, Hong Zhang
2006 2006 IEEE International Conference on Systems, Man and Cybernetics  
In addition, distance-based plane-sweep technique is used as optimization techniques for K-DJQ to reduce the total query processing time.  ...  This paper presents K-DJQ algorithms for solving multi-way distance join query, which finds the K n-tuples from n spatial datasets that have the smallest distance value according to query graph.  ...  For the distance join query, algorithms only for processing K-closest-pair have been developed [1]- [2] . However, algorithm for multi-way distance spatial join query has not been developed yet.  ... 
doi:10.1109/icsmc.2006.384417 dblp:conf/smc/LiangZ06 fatcat:ozf5k5xykzabtg3ed2232hnl64

Enhancing SpatialHadoop with Closest Pair Queries [chapter]

Francisco García-García, Antonio Corral, Luis Iribarne, Michael Vassilakopoulos, Yannis Manolopoulos
2016 Lecture Notes in Computer Science  
Given two datasets P and Q, the K Closest Pair Query (KCPQ) finds the K closest pairs of objects from P ×Q. It is an operation widely adopted by many spatial and GIS applications.  ...  algorithm in SpatialHadoop to perform efficient parallel KCPQ on large-scale spatial datasets.  ...  And recently, two new algorithms for skyline query processing have been also proposed in [15] .  ... 
doi:10.1007/978-3-319-44039-2_15 fatcat:ny5fte4l35g4ppjmqtfln25kqe

Query Processing in Spatial Network Databases [chapter]

Dimitris Papadias, Jun Zhang, Nikos Mamoulis, Yufei Tao
2003 Proceedings 2003 VLDB Conference  
These frameworks are successfully applied to the most popular spatial queries, namely nearest neighbors, range search, closest pairs and edistance joins, in the context of spatial network databases.  ...  Despite the importance of spatial networks in real-life applications, most of the spatial database literature focuses on Euclidean spaces.  ...  We would like to thank Qiongmao Shen and Manli Zhu for helping with the implementation.  ... 
doi:10.1016/b978-012722442-8/50076-8 dblp:conf/vldb/PapadiasZMT03 fatcat:ai2px5dttvhxfdtfc55tos7pyq

Supporting KDD Applications by the k-Nearest Neighbor Join [chapter]

Christian Böhm, Florian Krebs
2003 Lecture Notes in Computer Science  
to a k-closest pair operation in computational geometry, cf. [19] ).  ...  Well-known are two types of the similarity join, the distance range join where the user defines a distance threshold for the join, and the closest point query or k-distance join which retrieves the k most  ...  The (k-)closest pair query can be formally defined as follows: Definition 2 (k-) Closest Pair Query R S R S is the smallest subset of R × S that contains at least k pairs of points and for which the following  ... 
doi:10.1007/978-3-540-45227-0_50 fatcat:x76wu4j6ijcwhgx6e2cncsz42i

Processing Distance Join Queries with Constraints

A. N. Papadopoulos
2005 Computer journal  
Results of CPQ variations for k ¼ 2. (a) Closest-pair query (k-CPQ). (b) Semi-closest-pair query (k-SCPQ). (c) Constrained semi-closest-pair query (k-CSCPQ). FIGURE 13.  ...  Distance join queries are used in many modern applications, such as spatial databases, spatiotemporal databases and data mining.  ...  Methods proposed for closest-pair queries [3, 17, 18] can be used in our case by applying the necessary modifications in order to (i) process semi-closest-pair queries and (ii) support spatial constraints  ... 
doi:10.1093/comjnl/bxl002 fatcat:iu6fjwgiwzafnfoqwbq7sd4mbi

A Comparison of Distributed Spatial Data Management Systems for Processing Distance Join Queries [chapter]

Francisco García-García, Antonio Corral, Luis Iribarne, George Mavrommatis, Michael Vassilakopoulos
2017 Lecture Notes in Computer Science  
Two of the most studied distance join queries are the K Closest Pair Query (KCPQ) and the ε Distance Join Query (εDJQ).  ...  The KCPQ finds the K closest pairs of points from two datasets and the εDJQ finds all the possible pairs of points from two datasets, that are within a distance threshold ε of each other.  ...  value of the K-th closest pair (β).  ... 
doi:10.1007/978-3-319-66917-5_15 fatcat:7luj3dj4kvfbdf45sqxsxdpvu4

Multi-Way Distance Join Queries in Spatial Databases

Antonio Corral, Yannis Manolopoulos, Yannis Theodoridis, Michael Vassilakopoulos
2004 Geoinformatica  
This query can be viewed as an extension of K-Closest-Pairs Query (K-CPQ) [CMT + 01] for n inputs.  ...  In addition, a recursive non-incremental branch-and-bound algorithm following a Depth-First search for processing synchronously all inputs without producing any intermediate result is proposed.  ...  On the other hand, in its non-incremental form (K-Closest-Pairs Query, called K-CPQ), it discovers K pairs of objects, for a beforehand known K.  ... 
doi:10.1023/b:gein.0000040832.25622.8d fatcat:3vbnkdhaubebxekdy67bubuu4i

The k-Nearest Neighbour Join: Turbo Charging the KDD Process

Christian B�hm, Florian Krebs
2004 Knowledge and Information Systems  
Well-known are two types of the similarity join, the distance range join where the user defines a distance threshold for the join, and the closest point query or k-distance join which retrieves the k most  ...  We discover that many standard algorithms of Knowledge Discovery in Databases (KDD) such as k-means and k-medoid clustering, nearest neighbor classification, data cleansing, postprocessing of sampling-based  ...  The (k-)closest pair query can be formally defined as follows: Definition 2 (k-) Closest Pair Query R S R S is the smallest subset of R × S that contains at least k pairs of points and for which the following  ... 
doi:10.1007/s10115-003-0122-9 fatcat:r3zytdqgoffxpethllx44o2kbe
« Previous Showing results 1 — 15 out of 9,676 results