Abstract

AbstractThis paper studies indexing multidimensional data based on the Borel Cayley graph. In order to provide the scalable query method, a special distributed hash table based on Borel Cayley graph is applied to key‐value–based data‐storing system. By taking advantage of the two different representations for the same one Borel Cayley graph, we present an efficient way for distributed multidimensional queries. Compared with other ring‐like indexing method, experimental results demonstrate that Borel Cayley–based index method reduces the routing table length and improves the index maintenance efficiency.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call