Spatio-temporal indexing in non-relational distributed databases
暂无分享,去创建一个
Christopher N. Eichelberger | James N. Hughes | Anthony D. Fox | Skylar Lyon | Anthony D. Fox | S. Lyon
[1] Timos K. Sellis,et al. Topological relations in the world of minimum bounding rectangles: a study with R-trees , 1995, SIGMOD '95.
[2] Christos Faloutsos,et al. Proceedings of the 1999 ACM SIGMOD international conference on Management of data , 1999, SIGMOD 1999.
[3] P. Bahr,et al. Sampling: Theory and Applications , 2020, Applied and Numerical Harmonic Analysis.
[4] Antonin Guttman,et al. R-trees: a dynamic index structure for spatial searching , 1984, SIGMOD '84.
[5] Jon Louis Bentley,et al. Quad trees a data structure for retrieval on composite keys , 1974, Acta Informatica.
[6] Yannis Manolopoulos,et al. R-Trees: Theory and Applications (Advanced Information and Knowledge Processing) , 2005 .
[7] Douglas Comer,et al. Ubiquitous B-Tree , 1979, CSUR.
[8] Wilson C. Hsieh,et al. Bigtable: A Distributed Storage System for Structured Data , 2006, TOCS.
[9] Kothuri Venkata Ravi Kanth,et al. Quadtree and R-tree indexes in oracle spatial: a comparison using GIS data , 2002, SIGMOD '02.
[10] Burton H. Bloom,et al. Space/time trade-offs in hash coding with allowable errors , 1970, CACM.
[11] Nick Roussopoulos,et al. Nearest neighbor queries , 1995, SIGMOD '95.
[12] J. Kuan,et al. Fast k nearest neighbour search for R-tree family , 1997, Proceedings of ICICS, 1997 International Conference on Information, Communications and Signal Processing. Theme: Trends in Information Systems Engineering and Wireless Multimedia Communications (Cat..