Learned spatial data partitioning
원문 초록
Due to the significant increase in the size of spatial data, it is essential to use distributed parallel processing systems to efficiently analyze spatial data. In this paper, we first study learned spatial data partitioning, which effectively assigns groups of big spatial data to computers based on locations of data by using machine learning techniques. We formalize spatial data partitioning in the context of reinforcement learning and develop a novel deep reinforcement learning algorithm. Our learning algorithm leverages features of spatial data partitioning and prunes ineffective learning processes to find optimal partitions efficiently. Our experimental study, which uses Apache Sedona and real-world spatial data, demonstrates that our method efficiently finds partitions for accelerating distance join queries and reduces the workload run time by up to 59.4%.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Deep Reinforcement Learning with Gradient Eligibility Traces
DR-SAC: Distributionally Robust Soft Actor-Critic for Reinforcement Learning under Uncertainty
Explainable AI for Radar Resource Management: Modified LIME in Deep Reinforcement Learning
Multi-Objective Reinforcement Learning for Cognitive Radar Resource Management
Synergizing Reinforcement Learning and Genetic Algorithms for Neural Combinatorial Optimization
MOORL: A Framework for Integrating Offline-Online Reinforcement Learning
토론
이 논문과 연결된 포럼 글이 아직 없습니다.