GeoSpark: a cluster computing framework for processing large-scale spatial data
暂无分享,去创建一个
Mohamed Sarwat | Jia Yu | Jinxuan Wu | Jia Yu | Mohamed Sarwat | Jinxuan Wu
[1] Xiaofang Zhou,et al. Data Partitioning for Parallel Spatial Join Processing , 1998, GeoInformatica.
[2] Xiaofang Zhou,et al. Data Partitioning for Parallel Spatial Join Processing , 1997, GeoInformatica.
[3] Antonin Guttman,et al. R-trees: a dynamic index structure for spatial searching , 1984, SIGMOD '84.
[4] RoussopoulosNick,et al. Nearest neighbor queries , 1995 .
[5] Joel H. Saltz,et al. Hadoop-GIS: A High Performance Spatial Data Warehousing System over MapReduce , 2013, Proc. VLDB Endow..
[6] Jeffrey F. Naughton,et al. A non-blocking parallel spatial join algorithm , 2002, Proceedings 18th International Conference on Data Engineering.
[7] Michael J. Franklin,et al. Resilient Distributed Datasets: A Fault-Tolerant Abstraction for In-Memory Cluster Computing , 2012, NSDI.
[8] Ralf Hartmut Güting,et al. Parallel Secondo: Boosting Database Engines with Hadoop , 2012, 2012 IEEE 18th International Conference on Parallel and Distributed Systems.
[9] Ahmed Eldawy,et al. A Demonstration of SpatialHadoop: An Efficient MapReduce Framework for Spatial Data , 2013, Proc. VLDB Endow..
[10] Hanan Samet,et al. The Quadtree and Related Hierarchical Data Structures , 1984, CSUR.
[11] Nick Roussopoulos,et al. Nearest neighbor queries , 1995, SIGMOD '95.
[12] Divyakant Agrawal,et al. MD-HBase: A Scalable Multi-dimensional Data Infrastructure for Location Aware Services , 2011, 2011 IEEE 12th International Conference on Mobile Data Management.