Enabling Skip Graphs to Process K-Dimensional Range Queries in a Mobile Sensor Network
Abstract
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 graph can optimize range query performance in mobile networks such as unmanned aerial vehicle swarms. We propose a skip graph extension that inverts the key and membership vector roles and bases group membership on deterministic vectors derived from the z-ordering of k-dimensional data and sorting within groups is based on locally computed random keys.
Cite
@article{arxiv.2411.16990,
title = {Enabling Skip Graphs to Process K-Dimensional Range Queries in a Mobile Sensor Network},
author = {Gregory J. Brault and Christopher James Augeri and Barry E. Mullins and Rusty O. Baldwin and Christopher B. Mayer},
journal= {arXiv preprint arXiv:2411.16990},
year = {2024}
}
Comments
archival pre-print of this k-D distributed prefix-free distributed encoding technique ahead of another arXiv release which will cite this work, specifically with respect to using a more extensive prefix-free encoding technique to localize token partitions in an arbitrary input/output context of an LLM, SSM, or other k-D tokenized model