1

VBI-Tree: A Peer-to-Peer Framework for Supporting

Multi-Dimensional Indexing Schemes
H. V. Jagadish, Beng Chin Ooi, Quang Hieu Vu, Rong Zhang, Aoying Zhou

โดย นายสุรเดช ไชยมงคล รหั ส 520631136

 2

ปั ญหาและสงิ่ ทีส
่ นใจจะทำ

• Multi-dimensional Range Query In P2P System

• Multi-dimensional range queries.
▫ 50 < age < 55 AND 80K < sal < 90K
 3

What is a P2P system?

Node

Node Node

Internet

Node Node

A distributed system architecture:

No centralized control
Nodes are symmetric in function
Large number of unreliable nodes
 Chord: Consistent Hashing - Successor Nodes

identifier
node
6
X key
1
0 successor(1) = 1
7 1

identifier
successor(6) = 0 6 6 circle 2 2 successor(2) = 3

5 3
4
2
 5

What is a Indexing ?
• Similar to the index used in a textbook.
• Used to speed up the retrieval of records in
response to certain search conditions.
 6

VBI-Tree: Virtual Binary Index Tree

• VBI-Tree is an
abstract tree structure
on top of an overlay
network
• support any kind of
hierarchical tree
indexing structures
▫ R-tree
▫ X-tree
▫ SS-tree
▫ M-tree
▫ and their variants
 7

VBI-Tree: Virtual Binary Index Tree

• Is a variation of BATON
• Each peer is assigned :
• A routing node
• A data node
• Data node is the left
adjacent node of the
routing node (inorder
traversal)
• The right most data node
does not have a routing
node
 8

VBI-Tree: Virtual Binary Index Tree

• Query request can be
forwarded via links in
the routing node.
• The rightmost data
node always forwards
requests to the parent
node
 9

VBI-Tree: Virtual Binary Index Tree

• Leaf routing node (LRN)
is a routing node which
is the parent node of data
node.
• If Routing Node is not
LRN
• It has maintainer the left
branch’s right most data
node
• or the right branch’s left
most data node
 10

VBI-Tree
• Root define level 0
• Each level has at
most 2^L nodes
• It number each
position at level L
from 1 to 2^L
• Routing node connect
to :
▫ Parent link
▫ children links
▫ adjacent links
▫ neighbor links
▫ Upside path links
 11

VBI-Tree
• Routing Node:
• Left routing table
• N-2^(j-1)
• Right routing
table
• N+2^(j-1)
• A routing table is
considered full if
all valid links are
not null.
 12

Node Join
• There are two phases in a new
node joining the network.
▫ The first is to determine
where the new node should
join.
 The cost of this step is
O(logN).
▫ The second is actually
including it in the network at
a specified place.
 The cost of updating routing
tables to reflect the existence
of the new node is 6logN,
Parent node’s neighbors, New
node’s neighbors and the new
node.
 13

Node Join (example)

 14

Node Departure
 15

Index Construction
• The basic idea is,
▫ Assign a region of
the attribute space
to each data node.
▫ Each internal
node has
associated a
region that covers
all regions
managed by its
children.
 16

General Range Query Process

The cost of the search algorithm is O(log N)

17