Supporting Multi-dimensional Range Query in HD Tree

There are two basic concerns for supporting multi-dimensional range query in P2P overlay networks. The first is to preserve data locality in the process of data space partitioning, and the second is the maintenance of data locality among data items with an exponentially expanding rate and an exponen...

Full description

Saved in:

Bibliographic Details
Published in:	2010 IEEE/ACM 14th International Symposium on Distributed Simulation and Real Time Applications pp. 71 - 78
Main Authors:	Yunfeng Gu, Boukerche, A, Xun Ye, Araujo, R B
Format:	Conference Proceeding
Language:	English
Published:	IEEE 01.10.2010
Subjects:	Algorithm design and analysis associative searching data space partitioning Data structures DDM distributed Distributed databases HD Tree High definition video multi-dimensional overlay P2P Pattern matching Peer to peer computing peer-to-peer range query Routing
ISBN:	1424486513, 9781424486519
ISSN:	1550-6525
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!