Spatio-temporal indexing in non-relational distributed databases
Authors:
- 1 October 2013
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 291-299
Abstract
Big Data has driven the need for datastores that can scale horizontally leading to the development of many different NoSQL database implementations, each with different persistence and query philosophies. Spatio-temporal data such as location data is one of the largest types of data being collected today. We describe a novel spatio-temporal index structure that leverages the horizontal scalability of NoSQL databases to achieve performant query and transformation semantics. We present performance characteristics gathered from testing with Accumulo.Keywords
This publication has 7 references indexed in Scilit:
- Fast k nearest neighbour search for R-tree family2002
- Proceedings of the 1995 ACM SIGMOD international conference on Management of data - SIGMOD '951995
- Topological relations in the world of minimum bounding rectangles1995
- Nearest neighbor queries1995
- R-trees1984
- Quad trees a data structure for retrieval on composite keysActa Informatica, 1974
- Space/time trade-offs in hash coding with allowable errorsCommunications of the ACM, 1970