Iridis group Metodologías Ágiles - UNSL Crystal Claudio Ochoa - Patricio Maller.
Dynamic P2P Indexing and Search based on Compact Clustering Mauricio Marin Veronica Gil-Costa...
-
Upload
angelica-golden -
Category
Documents
-
view
212 -
download
0
Transcript of Dynamic P2P Indexing and Search based on Compact Clustering Mauricio Marin Veronica Gil-Costa...
![Page 1: Dynamic P2P Indexing and Search based on Compact Clustering Mauricio Marin Veronica Gil-Costa Cecilia Hernandez UNSL, Argentina Universidad de Chile Yahoo!](https://reader036.fdocuments.in/reader036/viewer/2022070411/56649f295503460f94c43455/html5/thumbnails/1.jpg)
Dynamic P2P Indexing and Search based on Compact Clustering
Mauricio Marin Veronica Gil-Costa Cecilia Hernandez
UNSL, Argentina Universidad de ChileYahoo! Research Latin America
![Page 2: Dynamic P2P Indexing and Search based on Compact Clustering Mauricio Marin Veronica Gil-Costa Cecilia Hernandez UNSL, Argentina Universidad de Chile Yahoo!](https://reader036.fdocuments.in/reader036/viewer/2022070411/56649f295503460f94c43455/html5/thumbnails/2.jpg)
OutlineIntroductionData Structure IndexP2P NetworksSimPeerP2P Bottom-upExperimentsConclusions and Future Work
![Page 3: Dynamic P2P Indexing and Search based on Compact Clustering Mauricio Marin Veronica Gil-Costa Cecilia Hernandez UNSL, Argentina Universidad de Chile Yahoo!](https://reader036.fdocuments.in/reader036/viewer/2022070411/56649f295503460f94c43455/html5/thumbnails/3.jpg)
IntroductionSimilarity search over a collection of metric-
space database objects distributed on a large and dynamic set of small computers forming a Peer-to-Peer (P2P) network has been widely studied in recent years.
Currently there are efficient solutions for structured networks like those based on the general purpose CAN and Chord protocols.
![Page 4: Dynamic P2P Indexing and Search based on Compact Clustering Mauricio Marin Veronica Gil-Costa Cecilia Hernandez UNSL, Argentina Universidad de Chile Yahoo!](https://reader036.fdocuments.in/reader036/viewer/2022070411/56649f295503460f94c43455/html5/thumbnails/4.jpg)
IntroductionSuper-peer systems are believed to represent
a good tradeoff between centralized and distributed architectures. They are also considered a reasonable tradeoff between unstructured and structured P2P networks.
In this case the network is seen as a collection of stable peers called super-peers to which normal peers can connect and initiate queries.
![Page 5: Dynamic P2P Indexing and Search based on Compact Clustering Mauricio Marin Veronica Gil-Costa Cecilia Hernandez UNSL, Argentina Universidad de Chile Yahoo!](https://reader036.fdocuments.in/reader036/viewer/2022070411/56649f295503460f94c43455/html5/thumbnails/5.jpg)
Previous WorkKM (SimPeers) is the state of the arte strategy
for peers and super-peers.
Its main drawback is that it employs local indexingin a bottom-up fashion.
This work (LC) employs global indexing in a top-downfashion.
![Page 6: Dynamic P2P Indexing and Search based on Compact Clustering Mauricio Marin Veronica Gil-Costa Cecilia Hernandez UNSL, Argentina Universidad de Chile Yahoo!](https://reader036.fdocuments.in/reader036/viewer/2022070411/56649f295503460f94c43455/html5/thumbnails/6.jpg)
List of Cluster (LC)I3
(c3, r3, I3)
I2
(c2, r2, I2)E2
I1
(c1, r1, I1)E1
c1r1
c2
c3
r2
r3
Clusters of fixed size
![Page 7: Dynamic P2P Indexing and Search based on Compact Clustering Mauricio Marin Veronica Gil-Costa Cecilia Hernandez UNSL, Argentina Universidad de Chile Yahoo!](https://reader036.fdocuments.in/reader036/viewer/2022070411/56649f295503460f94c43455/html5/thumbnails/7.jpg)
List of Cluster (LC)
c
r
q
rd(c,q) cr
q r
d(c,q)
c
r
q rd(c,q)
![Page 8: Dynamic P2P Indexing and Search based on Compact Clustering Mauricio Marin Veronica Gil-Costa Cecilia Hernandez UNSL, Argentina Universidad de Chile Yahoo!](https://reader036.fdocuments.in/reader036/viewer/2022070411/56649f295503460f94c43455/html5/thumbnails/8.jpg)
LC-SSS(c1, r1, I1) (c1, r1, I1) (c1, r1, I1)
Sparse Spatial Selection Algorithm
![Page 9: Dynamic P2P Indexing and Search based on Compact Clustering Mauricio Marin Veronica Gil-Costa Cecilia Hernandez UNSL, Argentina Universidad de Chile Yahoo!](https://reader036.fdocuments.in/reader036/viewer/2022070411/56649f295503460f94c43455/html5/thumbnails/9.jpg)
P2PHierarchical system of peers and super-peers
Super-peer
peers
![Page 10: Dynamic P2P Indexing and Search based on Compact Clustering Mauricio Marin Veronica Gil-Costa Cecilia Hernandez UNSL, Argentina Universidad de Chile Yahoo!](https://reader036.fdocuments.in/reader036/viewer/2022070411/56649f295503460f94c43455/html5/thumbnails/10.jpg)
Bottom-up
Np
Np
Np
1 … M
1 … M
(ci,ri)
M*Np1… M
1… M
LC-SSS
LC-SSS
semi-globalcenters
1… M
![Page 11: Dynamic P2P Indexing and Search based on Compact Clustering Mauricio Marin Veronica Gil-Costa Cecilia Hernandez UNSL, Argentina Universidad de Chile Yahoo!](https://reader036.fdocuments.in/reader036/viewer/2022070411/56649f295503460f94c43455/html5/thumbnails/11.jpg)
Bottom-up
Np
Np
Np
1 … M
1 … M
LC-SSS
LC-SSS
<ci,rm,rx,bi>
<cj,rm,rx,bj>
semi-globalcenters
…
(i,csp,sp,r’m,r’x)*(i,csp,sp,r’m,r’x)*(i,p,rm,rx)…(i,p,rm,rx)(i,p,rm,rx)
![Page 12: Dynamic P2P Indexing and Search based on Compact Clustering Mauricio Marin Veronica Gil-Costa Cecilia Hernandez UNSL, Argentina Universidad de Chile Yahoo!](https://reader036.fdocuments.in/reader036/viewer/2022070411/56649f295503460f94c43455/html5/thumbnails/12.jpg)
Searching
Np
<ci,rm,rx,bi>
<cj,rm,rx,bj>…
(i,csp,sp,r’m,r’x)*(i,csp,sp,r’m,r’x)*(i,p,rm,rx)…(i,p,rm,rx)(i,p,rm,rx)
qr
tp
ts
rx
rm
q
d(q,c)-r ≤ rx
q
d(q,c)+r rm
![Page 13: Dynamic P2P Indexing and Search based on Compact Clustering Mauricio Marin Veronica Gil-Costa Cecilia Hernandez UNSL, Argentina Universidad de Chile Yahoo!](https://reader036.fdocuments.in/reader036/viewer/2022070411/56649f295503460f94c43455/html5/thumbnails/13.jpg)
Updates
requerimiento Sends M semi-global centers (ci,ri)
Overflow area
Overflow areaNew centersIntersectionIntersection
degreedegree
M
![Page 14: Dynamic P2P Indexing and Search based on Compact Clustering Mauricio Marin Veronica Gil-Costa Cecilia Hernandez UNSL, Argentina Universidad de Chile Yahoo!](https://reader036.fdocuments.in/reader036/viewer/2022070411/56649f295503460f94c43455/html5/thumbnails/14.jpg)
c2
Updates: Intersection Degree
c1r1
c2
r2
If (d(c1, c2) ≤ r1 + r2) S1,2 = 1 Else S1,2 = 0
c1
c2
S1,2 = 1+r2/r1
c1
S1,2 = (r1/r2) ·S1,2 S1,2 = (|r1 − r2|/d(c1, c2) ) · S1,2
c1c2
All centers k for which Sk,1 is 0 are considered candidates to become new global centers (ck, rk)
![Page 15: Dynamic P2P Indexing and Search based on Compact Clustering Mauricio Marin Veronica Gil-Costa Cecilia Hernandez UNSL, Argentina Universidad de Chile Yahoo!](https://reader036.fdocuments.in/reader036/viewer/2022070411/56649f295503460f94c43455/html5/thumbnails/15.jpg)
Experimental ResultsMetric Spaces Library SISAP (
http://www.sisap.org/Home.html)Uniform 3.000.000Gauss 3.000.000NASA 3.000.00030 super-peers and 1.000 peersM = 10 centers
![Page 16: Dynamic P2P Indexing and Search based on Compact Clustering Mauricio Marin Veronica Gil-Costa Cecilia Hernandez UNSL, Argentina Universidad de Chile Yahoo!](https://reader036.fdocuments.in/reader036/viewer/2022070411/56649f295503460f94c43455/html5/thumbnails/16.jpg)
Constant Number of Peers
Total number of distance evaluations and messages for global and local indexing by using the LC strategy.
![Page 17: Dynamic P2P Indexing and Search based on Compact Clustering Mauricio Marin Veronica Gil-Costa Cecilia Hernandez UNSL, Argentina Universidad de Chile Yahoo!](https://reader036.fdocuments.in/reader036/viewer/2022070411/56649f295503460f94c43455/html5/thumbnails/17.jpg)
PERCENTAGE OF EFFECTIVENESS:Percentage of objects that are compared with the query and become part
of the query answer.
![Page 18: Dynamic P2P Indexing and Search based on Compact Clustering Mauricio Marin Veronica Gil-Costa Cecilia Hernandez UNSL, Argentina Universidad de Chile Yahoo!](https://reader036.fdocuments.in/reader036/viewer/2022070411/56649f295503460f94c43455/html5/thumbnails/18.jpg)
Increasing the Number of Peers
As new peers join to the network the algorithms require more distance evaluations to processes queries,
Further experiments in the paper
![Page 19: Dynamic P2P Indexing and Search based on Compact Clustering Mauricio Marin Veronica Gil-Costa Cecilia Hernandez UNSL, Argentina Universidad de Chile Yahoo!](https://reader036.fdocuments.in/reader036/viewer/2022070411/56649f295503460f94c43455/html5/thumbnails/19.jpg)
Conclusions
The paper has shown that by approximating global but resumed information about the indexed data in each peer, the average amount of computation and communication performed to solve range queries can be significantly reduced.
![Page 20: Dynamic P2P Indexing and Search based on Compact Clustering Mauricio Marin Veronica Gil-Costa Cecilia Hernandez UNSL, Argentina Universidad de Chile Yahoo!](https://reader036.fdocuments.in/reader036/viewer/2022070411/56649f295503460f94c43455/html5/thumbnails/20.jpg)
Future Work
Currently we are studying different cache techniques to optimize similar searches and reduce queries response time.
![Page 21: Dynamic P2P Indexing and Search based on Compact Clustering Mauricio Marin Veronica Gil-Costa Cecilia Hernandez UNSL, Argentina Universidad de Chile Yahoo!](https://reader036.fdocuments.in/reader036/viewer/2022070411/56649f295503460f94c43455/html5/thumbnails/21.jpg)
Contact Information
Mauricio Marin [email protected]
Veronica Gil-Costa [email protected]
Cecilia Hernandez [email protected]