Database Reference
In-Depth Information
Fig. 8.2
Overview of CSS, which proceeds in two stages, (
a
) indexing and (
b
) query processing.
Each peer has CSS, DHash, and Chord layers. Peers communicate with each other using
asynchronous remote procedure calls
clusID
=
Q
(
f
v
)=
arg min
i
(
f
v
−
w
i
)
(8.3)
where
Q
is the mapping function. To construct the key for this data object, the
consistent hash function SHA1 is employed,
(
f
v
)
key
=
SHA1
(
clusID
)
(8.4)
This distributes indexes as symmetrically as possible on the Chord ID space in
order to keep the load balanced. In this way, if
f
v
1
and
f
v
2
are the feature vectors of
Search WWH ::
Custom Search