use super::{
merge::create_merged_partition, partition_cache::PartitionCache,
partition_source_data::hash_to_object_count, view::View,
};
use crate::response_writer::Logger;
use anyhow::{Context, Result};
use chrono::{DateTime, TimeDelta, Utc};
use datafusion::execution::runtime_env::RuntimeEnv;
use micromegas_ingestion::data_lake_connection::DataLakeConnection;
use std::sync::Arc;
pub enum PartitionCreationStrategy {
CreateFromSource,
MergeExisting(Arc<PartitionCache>),
Abort,
}
#[allow(clippy::too_many_arguments)]
async fn verify_overlapping_partitions(
existing_partitions: &PartitionCache,
begin_insert: DateTime<Utc>,
end_insert: DateTime<Utc>,
view_set_name: &str,
view_instance_id: &str,
file_schema_hash: &[u8],
source_data_hash: &[u8],
logger: Arc<dyn Logger>,
) -> Result<PartitionCreationStrategy> {
let desc = format!(
"[{}, {}] {view_set_name} {view_instance_id}",
begin_insert.to_rfc3339(),
end_insert.to_rfc3339()
);
if source_data_hash.len() != std::mem::size_of::<i64>() {
anyhow::bail!("Source data hash should be a i64");
}
let nb_source_events = hash_to_object_count(source_data_hash)?;
let filtered = existing_partitions.filter(
view_set_name,
view_instance_id,
file_schema_hash,
begin_insert,
end_insert,
);
if filtered.partitions.is_empty() {
logger
.write_log_entry(format!("{desc}: matching partitions not found"))
.await?;
return Ok(PartitionCreationStrategy::CreateFromSource);
}
let mut existing_source_hash: i64 = 0;
let nb_existing_partitions = filtered.partitions.len();
for part in &filtered.partitions {
let begin = part.begin_insert_time;
let end = part.end_insert_time;
if begin < begin_insert || end > end_insert {
logger
.write_log_entry(format!(
"{desc}: found overlapping partition [{}, {}], aborting the update",
begin.to_rfc3339(),
end.to_rfc3339()
))
.await?;
return Ok(PartitionCreationStrategy::Abort);
}
if part.source_data_hash.len() == std::mem::size_of::<i64>() {
existing_source_hash += hash_to_object_count(&part.source_data_hash)?
} else {
logger
.write_log_entry(format!(
"{desc}: found partition with incompatible source hash: recreate"
))
.await?;
return Ok(PartitionCreationStrategy::CreateFromSource);
}
}
if nb_source_events != existing_source_hash {
logger
.write_log_entry(format!(
"{desc}: existing partitions do not match source data ({nb_source_events} vs {existing_source_hash}) : creating a new partition"
))
.await?;
return Ok(PartitionCreationStrategy::CreateFromSource);
}
if nb_existing_partitions > 1 {
return Ok(PartitionCreationStrategy::MergeExisting(Arc::new(filtered)));
}
logger
.write_log_entry(format!(
"{desc}: already up to date, nb_source_events={nb_source_events}"
))
.await?;
Ok(PartitionCreationStrategy::Abort)
}
async fn materialize_partition(
existing_partitions: Arc<PartitionCache>,
runtime: Arc<RuntimeEnv>,
lake: Arc<DataLakeConnection>,
begin_insert: DateTime<Utc>,
end_insert: DateTime<Utc>,
view: Arc<dyn View>,
logger: Arc<dyn Logger>,
) -> Result<()> {
let view_set_name = view.get_view_set_name();
let partition_spec = view
.make_batch_partition_spec(
runtime.clone(),
lake.clone(),
existing_partitions.clone(),
begin_insert,
end_insert,
)
.await
.with_context(|| "make_batch_partition_spec")?;
if partition_spec.is_empty() {
return Ok(());
}
let view_instance_id = view.get_view_instance_id();
let strategy = verify_overlapping_partitions(
&existing_partitions,
begin_insert,
end_insert,
&view_set_name,
&view_instance_id,
&view.get_file_schema_hash(),
&partition_spec.get_source_data_hash(),
logger.clone(),
)
.await
.with_context(|| "verify_overlapping_partitions")?;
if let PartitionCreationStrategy::Abort = &strategy {
return Ok(());
}
let new_delta = view.get_max_partition_time_delta(&strategy);
if new_delta < (end_insert - begin_insert) {
if let PartitionCreationStrategy::MergeExisting(partition_cache) = &strategy {
if partition_cache
.partitions
.iter()
.all(|p| (p.end_insert_time - p.begin_insert_time) == new_delta)
{
let desc = format!(
"[{}, {}] {view_set_name} {view_instance_id}",
begin_insert.to_rfc3339(),
end_insert.to_rfc3339()
);
logger
.write_log_entry(format!("{desc}: subpartitions already present",))
.await?;
return Ok(());
}
}
return Box::pin(materialize_partition_range(
existing_partitions,
runtime,
lake,
view,
begin_insert,
end_insert,
new_delta,
logger,
))
.await
.with_context(|| "materialize_partition_range");
}
match strategy {
PartitionCreationStrategy::CreateFromSource => {
partition_spec
.write(lake, logger)
.await
.with_context(|| "writing partition")?;
}
PartitionCreationStrategy::MergeExisting(partitions) => {
create_merged_partition(
partitions,
runtime,
lake,
view,
begin_insert,
end_insert,
logger,
)
.await
.with_context(|| "create_merged_partition")?;
}
PartitionCreationStrategy::Abort => {}
}
Ok(())
}
#[allow(clippy::too_many_arguments)]
pub async fn materialize_partition_range(
existing_partitions: Arc<PartitionCache>,
runtime: Arc<RuntimeEnv>,
lake: Arc<DataLakeConnection>,
view: Arc<dyn View>,
begin_range: DateTime<Utc>,
end_range: DateTime<Utc>,
partition_time_delta: TimeDelta,
logger: Arc<dyn Logger>,
) -> Result<()> {
let mut begin_part = begin_range;
let mut end_part = begin_part + partition_time_delta;
while end_part <= end_range {
materialize_partition(
existing_partitions.clone(),
runtime.clone(),
lake.clone(),
begin_part,
end_part,
view.clone(),
logger.clone(),
)
.await
.with_context(|| "materialize_partition")?;
begin_part = end_part;
end_part = begin_part + partition_time_delta;
}
Ok(())
}