Enabling Skip Graphs to Process K-Dimensional Range Queries in a Mobile Sensor Network

Autor: Brault, Gregory J., Augeri, Christopher James, Mullins, Barry E., Baldwin, Rusty O., Mayer, Christopher B.

Publikováno v: Proceedings of the 6th IEEE International Symposium on Network Computing and Applications NCA, Cambridge, MA, IEEE, 12-14 July 2007

A skip graph is a resilient application-layer routing structure that supports range queries of distributed k-dimensional data. By sorting deterministic keys into groups based on locally computed random membership vectors, nodes in a standard skip gra

Externí odkaz: http://arxiv.org/abs/2411.16990