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
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
|
package de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants.deliclu;
/*
This file is part of ELKI:
Environment for Developing KDD-Applications Supported by Index-Structures
Copyright (C) 2011
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.HashMap;
import java.util.HashSet;
import java.util.Set;
import de.lmu.ifi.dbs.elki.index.tree.BreadthFirstEnumeration;
import de.lmu.ifi.dbs.elki.index.tree.Entry;
import de.lmu.ifi.dbs.elki.index.tree.spatial.SpatialEntry;
import de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants.NonFlatRStarTree;
import de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants.bulk.BulkSplit;
import de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants.util.InsertionStrategy;
import de.lmu.ifi.dbs.elki.logging.Logging;
import de.lmu.ifi.dbs.elki.persistent.PageFile;
/**
* DeLiCluTree is a spatial index structure based on an R-TRee. DeLiCluTree is
* designed for the DeLiClu algorithm, having in each node a boolean array which
* indicates whether the child nodes are already handled by the DeLiClu
* algorithm.
*
* @author Elke Achtert
*
* @apiviz.has DeLiCluNode oneway - - contains
*/
public class DeLiCluTree extends NonFlatRStarTree<DeLiCluNode, DeLiCluEntry> {
/**
* The logger for this class.
*/
private static final Logging logger = Logging.getLogger(DeLiCluTree.class);
/**
* Holds the ids of the expanded nodes.
*/
private HashMap<Integer, HashSet<Integer>> expanded = new HashMap<Integer, HashSet<Integer>>();
/**
* Constructor.
*
* @param pagefile Page file
* @param bulkSplitter bulk load strategy
* @param insertionStrategy the strategy to find the insertion child
*/
public DeLiCluTree(PageFile<DeLiCluNode> pagefile, BulkSplit bulkSplitter, InsertionStrategy insertionStrategy) {
super(pagefile, bulkSplitter, insertionStrategy);
}
/**
* Marks the nodes with the specified ids as expanded.
*
* @param entry1 the first node
* @param entry2 the second node
*/
public void setExpanded(SpatialEntry entry1, SpatialEntry entry2) {
HashSet<Integer> exp1 = expanded.get(getPageID(entry1));
if(exp1 == null) {
exp1 = new HashSet<Integer>();
expanded.put(getPageID(entry1), exp1);
}
exp1.add(getPageID(entry2));
}
/**
* Returns the nodes which are already expanded with the specified node.
*
* @param entry the id of the node for which the expansions should be returned
* @return the nodes which are already expanded with the specified node
*/
public Set<Integer> getExpanded(SpatialEntry entry) {
HashSet<Integer> exp = expanded.get(getPageID(entry));
if(exp != null) {
return exp;
}
return new HashSet<Integer>();
}
/**
* Returns the nodes which are already expanded with the specified node.
*
* @param entry the id of the node for which the expansions should be returned
* @return the nodes which are already expanded with the specified node
*/
public Set<Integer> getExpanded(DeLiCluNode entry) {
HashSet<Integer> exp = expanded.get(entry.getPageID());
if(exp != null) {
return exp;
}
return new HashSet<Integer>();
}
/**
* Determines and returns the number of nodes in this index.
*
* @return the number of nodes in this index
*/
public int numNodes() {
int numNodes = 0;
BreadthFirstEnumeration<DeLiCluNode, DeLiCluEntry> bfs = new BreadthFirstEnumeration<DeLiCluNode, DeLiCluEntry>(this, getRootPath());
while(bfs.hasMoreElements()) {
Entry entry = bfs.nextElement().getLastPathComponent().getEntry();
if(!entry.isLeafEntry()) {
numNodes++;
}
}
return numNodes;
}
/**
* Creates a new leaf node with the specified capacity.
*
* @return a new leaf node
*/
@Override
protected DeLiCluNode createNewLeafNode() {
return new DeLiCluNode(leafCapacity, true);
}
/**
* Creates a new directory node with the specified capacity.
*
* @return a new directory node
*/
@Override
protected DeLiCluNode createNewDirectoryNode() {
return new DeLiCluNode(dirCapacity, false);
}
/**
* Creates a new directory entry representing the specified node.
*
* @param node the node to be represented by the new entry
*/
@Override
protected DeLiCluEntry createNewDirectoryEntry(DeLiCluNode node) {
return new DeLiCluDirectoryEntry(node.getPageID(), node.computeMBR(), node.hasHandled(), node.hasUnhandled());
}
/**
* Creates an entry representing the root node.
*
* @return an entry representing the root node
*/
@Override
protected DeLiCluEntry createRootEntry() {
return new DeLiCluDirectoryEntry(0, null, false, true);
}
@Override
protected Logging getLogger() {
return logger;
}
}
|
