Technical Reports

The ICICS/CS Reading Room


UBC CS TR-2011-09 Summary

SinExTree : Scalable Multi-Attribute Queries through Distributed Spatial Partitioning, July 22, 2011 Mahdi Tayarani Najaran, Charles Krasic and Norman C. Hutchinson, 7 pages

In this paper we present SinExTree, a spatial partitioning tree designed for scalable low-latency information stor- age and retrieval. SinExTree is built over a Sinfonia-like service that provides atomic access to distributed mem- ory suitable for a cloud environment. An n-dimension SinExTree provides key/value storage, where each key has n attributes, and supports general application-defined queries over multiple attributes.


If you have any questions or comments regarding this page please send mail to help@cs.ubc.ca.