Information Technology Reference
In-Depth Information
3000
3000
2000
inDegree
outDegree
degree
1800
2500
2500
1600
1400
2000
2000
1200
1500
1500
1000
800
1000
1000
600
400
500
500
200
0
0
0
0
2
4
6
8
10
12
14
0
2
4
6
8
10
0
2
4
6
8
10 12 14 16 18
indegree
outdegree
total degree
Fig. 10.7.
Vertex degree distribution in the synthetic graph G10000
6000
6000
4000
inDegree
outDegree
degree
3500
5000
5000
3000
4000
4000
2500
3000
3000
2000
1500
2000
2000
1000
1000
1000
500
0
0
0
0
2
4
6
8
10
12
14
0
2
4
6
8
10
12
0
5
10
15
20
indegree
outdegree
total degree
Fig. 10.8.
Vertex degree distribution in the synthetic graph G20000
9000
9000
6000
inDegree
outDegree
degree
8000
8000
5000
7000
7000
6000
6000
4000
5000
5000
3000
4000
4000
3000
3000
2000
2000
2000
1000
1000
1000
0
0
0
0
2
4
6
8
10
12
14
0
2
4
6
8
10
12
0
5
10
15
20
indegree
outdegree
total degree
Fig. 10.9.
Vertex degree distribution in the synthetic graph G30000
results in graphs with different sizes, because the result of a search performed on
a smaller graph is also a subset of a search result of the same search performed
on any larger graph. So its true that G5000
G30000.
As we performed all the experiments described in the following sections we
stated the maximal indexing length
l
to be 10. The
ρ
-index then was built to
index all the paths up to this length and the search then returns all the paths to
this length and some paths longer. Due to the space limitations of this chapter
we will not present a detailed insight into what means
some
in exact numbers.
Yet we briefly tackle this issue in Section 10.5.3.
As for the machinery on which we executed all our experiments concerning
the
ρ
-index, the computer is a dual double core Athlon Opteron 2.4 GHz with
a 12 GB of RAM. During the time the tests were run the computer was not
⊆
G10000
⊆
G20000
⊆
