1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
|
package de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants.query;
/*
This file is part of ELKI:
Environment for Developing KDD-Applications Supported by Index-Structures
Copyright (C) 2012
Ludwig-Maximilians-Universität München
Lehr- und Forschungseinheit für Datenbanksysteme
ELKI Development Team
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU Affero General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU Affero General Public License for more details.
You should have received a copy of the GNU Affero General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
import java.util.ArrayList;
import java.util.Collections;
import java.util.List;
import de.lmu.ifi.dbs.elki.data.spatial.SpatialComparable;
import de.lmu.ifi.dbs.elki.database.ids.DBID;
import de.lmu.ifi.dbs.elki.database.query.DistanceResultPair;
import de.lmu.ifi.dbs.elki.database.query.GenericDistanceResultPair;
import de.lmu.ifi.dbs.elki.database.query.distance.SpatialDistanceQuery;
import de.lmu.ifi.dbs.elki.database.query.range.AbstractDistanceRangeQuery;
import de.lmu.ifi.dbs.elki.distance.distancefunction.SpatialPrimitiveDistanceFunction;
import de.lmu.ifi.dbs.elki.distance.distancevalue.Distance;
import de.lmu.ifi.dbs.elki.index.tree.DirectoryEntry;
import de.lmu.ifi.dbs.elki.index.tree.LeafEntry;
import de.lmu.ifi.dbs.elki.index.tree.query.GenericDistanceSearchCandidate;
import de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants.AbstractRStarTree;
import de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants.AbstractRStarTreeNode;
import de.lmu.ifi.dbs.elki.utilities.datastructures.heap.Heap;
import de.lmu.ifi.dbs.elki.utilities.documentation.Reference;
/**
* Instance of a range query for a particular spatial index.
*
* Reference:
* <p>
* J. Kuan, P. Lewis<br />
* Fast k nearest neighbour search for R-tree family<br />
* In Proc. Int. Conf Information, Communications and Signal Processing, ICICS
* 1997
* </p>
*
* @author Erich Schubert
*
* @apiviz.uses AbstractRStarTree
* @apiviz.uses SpatialPrimitiveDistanceFunction
*/
@Reference(authors = "J. Kuan, P. Lewis", title = "Fast k nearest neighbour search for R-tree family", booktitle = "Proc. Int. Conf Information, Communications and Signal Processing, ICICS 1997", url = "http://dx.doi.org/10.1109/ICICS.1997.652114")
public class GenericRStarTreeRangeQuery<O extends SpatialComparable, D extends Distance<D>> extends AbstractDistanceRangeQuery<O, D> {
/**
* The index to use
*/
protected final AbstractRStarTree<?, ?> tree;
/**
* Spatial primitive distance function
*/
protected final SpatialPrimitiveDistanceFunction<? super O, D> distanceFunction;
/**
* Constructor.
*
* @param tree Index to use
* @param distanceQuery Distance query to use
*/
public GenericRStarTreeRangeQuery(AbstractRStarTree<?, ?> tree, SpatialDistanceQuery<O, D> distanceQuery) {
super(distanceQuery);
this.tree = tree;
this.distanceFunction = distanceQuery.getDistanceFunction();
}
/**
* Perform the actual query process.
*
* @param object Query object
* @param epsilon Query range
* @return Objects contained in query range.
*/
protected List<DistanceResultPair<D>> doRangeQuery(O object, D epsilon) {
final List<DistanceResultPair<D>> result = new ArrayList<DistanceResultPair<D>>();
final Heap<GenericDistanceSearchCandidate<D>> pq = new Heap<GenericDistanceSearchCandidate<D>>();
// push root
pq.add(new GenericDistanceSearchCandidate<D>(distanceFunction.getDistanceFactory().nullDistance(), tree.getRootID()));
// search in tree
while(!pq.isEmpty()) {
GenericDistanceSearchCandidate<D> pqNode = pq.poll();
if(pqNode.mindist.compareTo(epsilon) > 0) {
break;
}
AbstractRStarTreeNode<?, ?> node = tree.getNode(pqNode.nodeID);
final int numEntries = node.getNumEntries();
for(int i = 0; i < numEntries; i++) {
D distance = distanceFunction.minDist(node.getEntry(i), object);
if(distance.compareTo(epsilon) <= 0) {
if(node.isLeaf()) {
LeafEntry entry = (LeafEntry) node.getEntry(i);
result.add(new GenericDistanceResultPair<D>(distance, entry.getDBID()));
}
else {
DirectoryEntry entry = (DirectoryEntry) node.getEntry(i);
pq.add(new GenericDistanceSearchCandidate<D>(distance, entry.getEntryID()));
}
}
}
}
// sort the result according to the distances
Collections.sort(result);
return result;
}
@Override
public List<DistanceResultPair<D>> getRangeForObject(O obj, D range) {
return doRangeQuery(obj, range);
}
@Override
public List<DistanceResultPair<D>> getRangeForDBID(DBID id, D range) {
return getRangeForObject(relation.get(id), range);
}
}
|
