|
|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||
java.lang.Objectde.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants.util.TopologicalSplitter
@Reference(authors="N. Beckmann, H.-P. Kriegel, R. Schneider, B. Seeger",
title="The R*-tree: an efficient and robust access method for points and rectangles",
booktitle="Proceedings of the 1990 ACM SIGMOD International Conference on Management of Data, Atlantic City, NJ, May 23-25, 1990",
url="http://dx.doi.org/10.1145/93597.98741")
public class TopologicalSplitter
Encapsulates the required parameters for a topological split of a R*-Tree.
| Nested Class Summary | |
|---|---|
private class |
TopologicalSplitter.Split<E extends SpatialEntry>
Internal data for an actual split. |
| Constructor Summary | |
|---|---|
TopologicalSplitter()
constructor. |
|
| Method Summary | ||
|---|---|---|
|
split(List<E> entries,
int minEntries)
Split a page |
|
| Methods inherited from class java.lang.Object |
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
| Constructor Detail |
|---|
public TopologicalSplitter()
| Method Detail |
|---|
public <E extends SpatialEntry> Pair<List<E>,List<E>> split(List<E> entries,
int minEntries)
SplitStrategy
split in interface SplitStrategy<SpatialEntry>E - Actual data typeentries - Entries to splitminEntries - Minimum number of entries in each part
|
|
|||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||||