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...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	2010 IEEE/ACM 14th International Symposium on Distributed Simulation and Real Time Applications s. 71 - 78
Hlavní autori:	Yunfeng Gu, Boukerche, A, Xun Ye, Araujo, R B
Médium:	Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	IEEE 01.10.2010
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!