1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080
pub mod serialization;
pub mod storage;
pub mod update;
use crate::{
annostorage::{AnnotationStorage, NodeAnnotationStorage, ValueSearch},
errors::Result,
graph::storage::{registry, GraphStorage, WriteableGraphStorage},
};
use crate::{
errors::GraphAnnisCoreError,
types::{AnnoKey, Annotation, Component, ComponentType, Edge, NodeID},
};
use clru::CLruCache;
use rayon::prelude::*;
use smartstring::alias::String as SmartString;
use std::io::prelude::*;
use std::ops::Bound::Included;
use std::path::{Path, PathBuf};
use std::string::ToString;
use std::{
borrow::Cow,
sync::{Arc, Mutex},
};
use std::{collections::BTreeMap, num::NonZeroUsize};
use update::{GraphUpdate, UpdateEvent};
pub const ANNIS_NS: &str = "annis";
pub const DEFAULT_NS: &str = "default_ns";
pub const NODE_NAME: &str = "node_name";
pub const NODE_TYPE: &str = "node_type";
pub const DEFAULT_EMPTY_LAYER: &str = "default_layer";
const GLOBAL_STATISTICS_FILE_NAME: &str = "global_statistics.bin";
lazy_static! {
pub static ref DEFAULT_ANNO_KEY: Arc<AnnoKey> = Arc::from(AnnoKey::default());
pub static ref NODE_NAME_KEY: Arc<AnnoKey> = Arc::from(AnnoKey {
ns: ANNIS_NS.into(),
name: NODE_NAME.into(),
});
/// Return an annotation key which is used for the special `annis::node_type` annotation which every node must have to mark its existence.
pub static ref NODE_TYPE_KEY: Arc<AnnoKey> = Arc::from(AnnoKey {
ns: ANNIS_NS.into(),
name: NODE_TYPE.into(),
});
}
/// A representation of a graph including node annotations and edges.
/// Edges are partioned into components and each component is implemented by specialized graph storage implementation.
///
/// Graphs can have an optional location on the disk.
/// In this case, changes to the graph via the [apply_update(...)](#method.apply_update) function are automatically persisted to this location.
///
pub struct Graph<CT: ComponentType> {
node_annos: Box<dyn NodeAnnotationStorage>,
location: Option<PathBuf>,
components: BTreeMap<Component<CT>, Option<Arc<dyn GraphStorage>>>,
current_change_id: u64,
background_persistance: Arc<Mutex<()>>,
pub global_statistics: Option<CT::GlobalStatistics>,
disk_based: bool,
}
fn load_component_from_disk(component_path: &Path) -> Result<Arc<dyn GraphStorage>> {
// load component into memory
let impl_path = PathBuf::from(component_path).join("impl.cfg");
let mut f_impl = std::fs::File::open(impl_path)?;
let mut impl_name = String::new();
f_impl.read_to_string(&mut impl_name)?;
let gs = registry::deserialize(&impl_name, component_path)?;
Ok(gs)
}
fn component_to_relative_path<CT: ComponentType>(c: &Component<CT>) -> PathBuf {
let mut p = PathBuf::new();
p.push("gs");
p.push(c.get_type().to_string());
p.push(if c.layer.is_empty() {
DEFAULT_EMPTY_LAYER
} else {
&c.layer
});
p.push(c.name.as_str());
p
}
fn component_path<CT: ComponentType>(
location: &Option<PathBuf>,
c: &Component<CT>,
) -> Option<PathBuf> {
match location {
Some(ref loc) => {
let mut p = PathBuf::from(loc);
// don't use the backup-folder per default
p.push("current");
p.push(component_to_relative_path(c));
Some(p)
}
None => None,
}
}
impl<CT: ComponentType> Graph<CT> {
/// Create a new and empty instance without any location on the disk.
pub fn new(disk_based: bool) -> Result<Self> {
let node_annos: Box<dyn NodeAnnotationStorage> = if disk_based {
Box::new(crate::annostorage::ondisk::AnnoStorageImpl::new(None)?)
} else {
Box::new(crate::annostorage::inmemory::AnnoStorageImpl::<NodeID>::new())
};
Ok(Graph {
node_annos,
components: BTreeMap::new(),
global_statistics: None,
location: None,
current_change_id: 0,
background_persistance: Arc::new(Mutex::new(())),
disk_based,
})
}
/// Create a new instance without any location on the disk but with the default graph storage components.
pub fn with_default_graphstorages(disk_based: bool) -> Result<Self> {
let mut db = Graph::new(disk_based)?;
for c in CT::default_components() {
db.get_or_create_writable(&c)?;
}
Ok(db)
}
fn set_location(&mut self, location: &Path) -> Result<()> {
self.location = Some(PathBuf::from(location));
Ok(())
}
/// Clear the graph content.
/// This removes all node annotations, edges and knowledge about components.
fn clear(&mut self) -> Result<()> {
self.node_annos = Box::new(crate::annostorage::inmemory::AnnoStorageImpl::new());
self.components.clear();
Ok(())
}
/// Load the graph from an external location.
/// This sets the location of this instance to the given location.
///
/// * `location` - The path on the disk
/// * `preload` - If `true`, all components are loaded from disk into main memory.
pub fn load_from(&mut self, location: &Path, preload: bool) -> Result<()> {
debug!("Loading corpus from {}", location.to_string_lossy());
self.clear()?;
let location = PathBuf::from(location);
self.set_location(location.as_path())?;
let backup = location.join("backup");
let mut backup_was_loaded = false;
let dir2load = if backup.exists() && backup.is_dir() {
backup_was_loaded = true;
backup.clone()
} else {
location.join("current")
};
// Get the global statistics if available
self.global_statistics = None;
let global_statistics_file = dir2load.join(GLOBAL_STATISTICS_FILE_NAME);
if global_statistics_file.exists() && global_statistics_file.is_file() {
let f = std::fs::File::open(global_statistics_file)?;
let mut reader = std::io::BufReader::new(f);
self.global_statistics = bincode::deserialize_from(&mut reader)?;
}
// Load the node annotations
let ondisk_subdirectory = dir2load.join(crate::annostorage::ondisk::SUBFOLDER_NAME);
if ondisk_subdirectory.exists() && ondisk_subdirectory.is_dir() {
self.disk_based = true;
// directly load the on disk storage from the given folder to avoid having a temporary directory
let node_annos_tmp =
crate::annostorage::ondisk::AnnoStorageImpl::new(Some(ondisk_subdirectory))?;
self.node_annos = Box::new(node_annos_tmp);
} else {
// assume a main memory implementation
self.disk_based = false;
let mut node_annos_tmp = crate::annostorage::inmemory::AnnoStorageImpl::new();
node_annos_tmp.load_annotations_from(&dir2load)?;
self.node_annos = Box::new(node_annos_tmp);
}
let log_path = dir2load.join("update_log.bin");
let logfile_exists = log_path.exists() && log_path.is_file();
self.find_components_from_disk(&dir2load)?;
// If backup is active or a write log exists, always a pre-load to get the complete corpus.
if preload | logfile_exists | backup_was_loaded {
self.ensure_loaded_all()?;
}
if logfile_exists {
// apply any outstanding log file updates
let log_reader = std::fs::File::open(&log_path)?;
let mut update = bincode::deserialize_from(log_reader)?;
self.apply_update_in_memory(&mut update, |_| {})?;
} else {
self.current_change_id = 0;
}
if backup_was_loaded {
// save the current corpus under the actual location
self.save_to(&location.join("current"))?;
// rename backup folder (renaming is atomic and deleting could leave an incomplete backup folder on disk)
let tmp_dir = tempfile::Builder::new()
.prefix("temporary-graphannis-backup")
.tempdir_in(location)?;
// the target directory is created and can cause issues on windows: delete it first
std::fs::remove_dir(tmp_dir.path())?;
std::fs::rename(&backup, tmp_dir.path())?;
// remove it after renaming it
tmp_dir.close()?;
}
Ok(())
}
fn find_components_from_disk(&mut self, location: &Path) -> Result<()> {
self.components.clear();
// for all component types
for c in CT::all_component_types().into_iter() {
let cpath = PathBuf::from(location).join("gs").join(c.to_string());
if cpath.is_dir() {
// get all the namespaces/layers
for layer in cpath.read_dir()? {
let layer = layer?;
if layer.path().is_dir() {
// try to load the component with the empty name
let layer_file_name = layer.file_name();
let layer_name_from_file = layer_file_name.to_string_lossy();
let layer_name: SmartString = if layer_name_from_file == DEFAULT_EMPTY_LAYER
{
SmartString::default()
} else {
layer_name_from_file.into()
};
let empty_name_component =
Component::new(c.clone(), layer_name.clone(), SmartString::default());
{
let cfg_file = PathBuf::from(location)
.join(component_to_relative_path(&empty_name_component))
.join("impl.cfg");
if cfg_file.is_file() {
self.components.insert(empty_name_component.clone(), None);
debug!("Registered component {}", empty_name_component);
}
}
// also load all named components
for name in layer.path().read_dir()? {
let name = name?;
let named_component = Component::new(
c.clone(),
layer_name.clone(),
name.file_name().to_string_lossy().into(),
);
let cfg_file = PathBuf::from(location)
.join(component_to_relative_path(&named_component))
.join("impl.cfg");
if cfg_file.is_file() {
self.components.insert(named_component.clone(), None);
debug!("Registered component {}", named_component);
}
}
}
}
}
} // end for all components
Ok(())
}
fn internal_save(&self, location: &Path) -> Result<()> {
let location = PathBuf::from(location);
std::fs::create_dir_all(&location)?;
self.node_annos.save_annotations_to(&location)?;
for (c, e) in &self.components {
if let Some(ref data) = *e {
let dir = PathBuf::from(&location).join(component_to_relative_path(c));
std::fs::create_dir_all(&dir)?;
let impl_name = data.serialization_id();
data.save_to(&dir)?;
let cfg_path = PathBuf::from(&dir).join("impl.cfg");
let mut f_cfg = std::fs::File::create(cfg_path)?;
f_cfg.write_all(impl_name.as_bytes())?;
}
}
// Save global statistics
let f = std::fs::File::create(location.join(GLOBAL_STATISTICS_FILE_NAME))?;
let mut writer = std::io::BufWriter::new(f);
bincode::serialize_into(&mut writer, &self.global_statistics)?;
Ok(())
}
/// Save the current database to a `location` on the disk, but do not remember this location.
pub fn save_to(&mut self, location: &Path) -> Result<()> {
// make sure all components are loaded, otherwise saving them does not make any sense
self.ensure_loaded_all()?;
self.internal_save(&location.join("current"))
}
/// Save the current database at a new `location` and remember it as new internal location.
pub fn persist_to(&mut self, location: &Path) -> Result<()> {
self.set_location(location)?;
self.internal_save(&location.join("current"))
}
fn get_cached_node_id_from_name(
&self,
node_name: Cow<String>,
cache: &mut CLruCache<String, Option<NodeID>>,
) -> Result<Option<NodeID>> {
if let Some(id) = cache.get(node_name.as_ref()) {
Ok(*id)
} else {
let id = self.node_annos.get_node_id_from_name(&node_name)?;
cache.put(node_name.to_string(), id);
Ok(id)
}
}
#[allow(clippy::cognitive_complexity)]
fn apply_update_in_memory<F>(&mut self, u: &mut GraphUpdate, progress_callback: F) -> Result<()>
where
F: Fn(&str),
{
let all_components = self.get_all_components(None, None);
let mut update_graph_index = ComponentType::init_update_graph_index(self)?;
// Cache the expensive mapping of node names to IDs
let cache_size = NonZeroUsize::new(1_000).ok_or(GraphAnnisCoreError::ZeroCacheSize)?;
let mut node_id_cache = CLruCache::new(cache_size);
// Iterate once over all changes in the same order as the updates have been added
let total_nr_updates = u.len()?;
progress_callback(&format!("applying {} atomic updates", total_nr_updates));
for (nr_updates, update_event) in u.iter()?.enumerate() {
let (id, change) = update_event?;
trace!("applying event {:?}", &change);
ComponentType::before_update_event(&change, self, &mut update_graph_index)?;
match &change {
UpdateEvent::AddNode {
node_name,
node_type,
} => {
// only add node if it does not exist yet
if !self.node_annos.has_node_name(node_name)? {
let new_node_id: NodeID =
if let Some(id) = self.node_annos.get_largest_item()? {
id + 1
} else {
0
};
let new_anno_name = Annotation {
key: NODE_NAME_KEY.as_ref().clone(),
val: node_name.into(),
};
let new_anno_type = Annotation {
key: NODE_TYPE_KEY.as_ref().clone(),
val: node_type.into(),
};
// add the new node (with minimum labels)
self.node_annos.insert(new_node_id, new_anno_name)?;
self.node_annos.insert(new_node_id, new_anno_type)?;
// update the internal cache
node_id_cache.put(node_name.clone(), Some(new_node_id));
}
}
UpdateEvent::DeleteNode { node_name } => {
if let Some(existing_node_id) = self.get_cached_node_id_from_name(
Cow::Borrowed(node_name),
&mut node_id_cache,
)? {
// delete all annotations
{
for a in self
.node_annos
.get_annotations_for_item(&existing_node_id)?
{
self.node_annos
.remove_annotation_for_item(&existing_node_id, &a.key)?;
}
}
// delete all edges pointing to this node either as source or target
for c in all_components.iter() {
if let Ok(gs) = self.get_or_create_writable(c) {
gs.delete_node(existing_node_id)?;
}
}
// update the internal cache
node_id_cache.put(node_name.clone(), None);
}
}
UpdateEvent::AddNodeLabel {
node_name,
anno_ns,
anno_name,
anno_value,
} => {
if let Some(existing_node_id) = self.get_cached_node_id_from_name(
Cow::Borrowed(node_name),
&mut node_id_cache,
)? {
let anno = Annotation {
key: AnnoKey {
ns: anno_ns.into(),
name: anno_name.into(),
},
val: anno_value.into(),
};
self.node_annos.insert(existing_node_id, anno)?;
}
}
UpdateEvent::DeleteNodeLabel {
node_name,
anno_ns,
anno_name,
} => {
if let Some(existing_node_id) = self.get_cached_node_id_from_name(
Cow::Borrowed(node_name),
&mut node_id_cache,
)? {
let key = AnnoKey {
ns: anno_ns.into(),
name: anno_name.into(),
};
self.node_annos
.remove_annotation_for_item(&existing_node_id, &key)?;
}
}
UpdateEvent::AddEdge {
source_node,
target_node,
layer,
component_type,
component_name,
} => {
let source = self.get_cached_node_id_from_name(
Cow::Borrowed(source_node),
&mut node_id_cache,
)?;
let target = self.get_cached_node_id_from_name(
Cow::Borrowed(target_node),
&mut node_id_cache,
)?;
// only add edge if both nodes already exist
if let (Some(source), Some(target)) = (source, target) {
if let Ok(ctype) = CT::from_str(component_type) {
let c = Component::new(ctype, layer.into(), component_name.into());
let gs = self.get_or_create_writable(&c)?;
gs.add_edge(Edge { source, target })?;
}
}
}
UpdateEvent::DeleteEdge {
source_node,
target_node,
layer,
component_type,
component_name,
} => {
let source = self.get_cached_node_id_from_name(
Cow::Borrowed(source_node),
&mut node_id_cache,
)?;
let target = self.get_cached_node_id_from_name(
Cow::Borrowed(target_node),
&mut node_id_cache,
)?;
if let (Some(source), Some(target)) = (source, target) {
if let Ok(ctype) = CT::from_str(component_type) {
let c = Component::new(ctype, layer.into(), component_name.into());
let gs = self.get_or_create_writable(&c)?;
gs.delete_edge(&Edge { source, target })?;
}
}
}
UpdateEvent::AddEdgeLabel {
source_node,
target_node,
layer,
component_type,
component_name,
anno_ns,
anno_name,
anno_value,
} => {
let source = self.get_cached_node_id_from_name(
Cow::Borrowed(source_node),
&mut node_id_cache,
)?;
let target = self.get_cached_node_id_from_name(
Cow::Borrowed(target_node),
&mut node_id_cache,
)?;
if let (Some(source), Some(target)) = (source, target) {
if let Ok(ctype) = CT::from_str(component_type) {
let c = Component::new(ctype, layer.into(), component_name.into());
let gs = self.get_or_create_writable(&c)?;
// only add label if the edge already exists
let e = Edge { source, target };
if gs.is_connected(source, target, 1, Included(1))? {
let anno = Annotation {
key: AnnoKey {
ns: anno_ns.into(),
name: anno_name.into(),
},
val: anno_value.into(),
};
gs.add_edge_annotation(e, anno)?;
}
}
}
}
UpdateEvent::DeleteEdgeLabel {
source_node,
target_node,
layer,
component_type,
component_name,
anno_ns,
anno_name,
} => {
let source = self.get_cached_node_id_from_name(
Cow::Borrowed(source_node),
&mut node_id_cache,
)?;
let target = self.get_cached_node_id_from_name(
Cow::Borrowed(target_node),
&mut node_id_cache,
)?;
if let (Some(source), Some(target)) = (source, target) {
if let Ok(ctype) = CT::from_str(component_type) {
let c = Component::new(ctype, layer.into(), component_name.into());
let gs = self.get_or_create_writable(&c)?;
// only add label if the edge already exists
let e = Edge { source, target };
if gs.is_connected(source, target, 1, Included(1))? {
let key = AnnoKey {
ns: anno_ns.into(),
name: anno_name.into(),
};
gs.delete_edge_annotation(&e, &key)?;
}
}
}
}
} // end match update entry type
ComponentType::after_update_event(change, self, &mut update_graph_index)?;
self.current_change_id = id;
if nr_updates > 0 && nr_updates % 100_000 == 0 {
// Get progress in percentage
let progress = ((nr_updates as f64) / (total_nr_updates as f64)) * 100.0;
progress_callback(&format!(
"applied {:.2}% of the atomic updates ({}/{})",
progress, nr_updates, total_nr_updates,
));
}
} // end for each consistent update entry
progress_callback("calculating node statistics");
self.get_node_annos_mut().calculate_statistics()?;
progress_callback("extending graph with model-specific index");
ComponentType::apply_update_graph_index(update_graph_index, self)?;
Ok(())
}
/// Apply a sequence of updates (`u` parameter) to this graph.
/// If the graph has a location on the disk, the changes are persisted.
pub fn apply_update<F>(&mut self, u: &mut GraphUpdate, progress_callback: F) -> Result<()>
where
F: Fn(&str),
{
progress_callback("applying list of atomic updates");
// we have to make sure that the corpus is fully loaded (with all components) before we can apply the update.
self.ensure_loaded_all()?;
let result = self.apply_update_in_memory(u, &progress_callback);
progress_callback("memory updates completed, persisting updates to disk");
if let Some(location) = self.location.clone() {
trace!("output location for persisting updates is {:?}", location);
if result.is_ok() {
let current_path = location.join("current");
// make sure the output path exits
std::fs::create_dir_all(¤t_path)?;
// If successfull write log
let log_path = location.join("update_log.bin");
// Create a temporary directory in the same file system as the output
let temporary_dir = tempfile::tempdir_in(¤t_path)?;
let mut temporary_disk_file = tempfile::NamedTempFile::new_in(&temporary_dir)?;
debug!("writing WAL update log to {:?}", temporary_disk_file.path());
bincode::serialize_into(temporary_disk_file.as_file(), &u)?;
temporary_disk_file.flush()?;
debug!("moving finished WAL update log to {:?}", &log_path);
// Since the temporary file should be on the same file system, persisting/moving it should be an atomic operation
temporary_disk_file.persist(&log_path)?;
progress_callback("finished writing WAL update log");
} else {
trace!("error occured while applying updates: {:?}", &result);
// load corpus from disk again
self.load_from(&location, true)?;
return result;
}
}
result
}
/// A function to persist the changes of a write-ahead-log update on the disk. Should be run in a background thread.
pub fn background_sync_wal_updates(&self) -> Result<()> {
// TODO: friendly abort any currently running thread
if let Some(ref location) = self.location {
// Acquire lock, so that only one thread can write background data at the same time
let _lock = self.background_persistance.lock()?;
self.internal_save_with_backup(location)?;
}
Ok(())
}
/// Save this graph to the given location using a temporary backup folder for the old graph.
/// The backup folder is used to achieve some atomicity in combination with the `load_from` logic,
// which will load the backup folder in case saving the corpus to the "current" location was aborted.
fn internal_save_with_backup(&self, location: &Path) -> Result<()> {
// Move the old corpus to the backup sub-folder. When the corpus is loaded again and there is backup folder
// the backup will be used instead of the original possible corrupted files.
// The current version is only the real one if no backup folder exists. If there is a backup folder
// there is nothing to do since the backup already contains the last consistent version.
// A sub-folder is used to ensure that all directories are on the same file system and moving (instead of copying)
// is possible.
let backup_location = location.join("backup");
let current_location = location.join("current");
if !backup_location.exists() {
std::fs::rename(¤t_location, &backup_location)?;
}
// Save the complete corpus without the write log to the target location
self.internal_save(¤t_location)?;
// rename backup folder (renaming is atomic and deleting could leave an incomplete backup folder on disk)
let tmp_dir = tempfile::Builder::new()
.prefix("temporary-graphannis-backup")
.tempdir_in(location)?;
// the target directory is created and can cause issues on windows: delete it first
std::fs::remove_dir(tmp_dir.path())?;
std::fs::rename(&backup_location, tmp_dir.path())?;
// remove it after renaming it, (since the new "current" folder was completely written)
tmp_dir.close()?;
Ok(())
}
fn ensure_writeable(&mut self, c: &Component<CT>) -> Result<()> {
self.ensure_loaded(c)?;
// Short path: exists and already writable
if let Some(gs_opt) = self.components.get_mut(c) {
// This should always work, since we just ensured the component is loaded
let gs = gs_opt
.as_mut()
.ok_or_else(|| GraphAnnisCoreError::ComponentNotLoaded(c.to_string()))?;
// copy to writable implementation if needed
let is_writable = {
Arc::get_mut(gs)
.ok_or_else(|| {
GraphAnnisCoreError::NonExclusiveComponentReference(c.to_string())
})?
.as_writeable()
.is_some()
};
if is_writable {
return Ok(());
}
} else {
// Component does not exist at all, we can abort here
return Ok(());
}
// Component does exist, but is not writable, replace with writeable implementation
let readonly_gs = self
.components
.get(c)
.cloned()
.ok_or_else(|| GraphAnnisCoreError::MissingComponent(c.to_string()))?
.ok_or_else(|| GraphAnnisCoreError::ComponentNotLoaded(c.to_string()))?;
let writable_gs = registry::create_writeable(self, Some(readonly_gs.as_ref()))?;
self.components.insert(c.to_owned(), Some(writable_gs));
Ok(())
}
/// (Re-) calculate the internal statistics needed for estimating graph components and annotations.
pub fn calculate_all_statistics(&mut self) -> Result<()> {
self.ensure_loaded_all()?;
debug!("Calculating node statistics");
self.node_annos.calculate_statistics()?;
for c in self.get_all_components(None, None) {
debug!("Calculating statistics for component {}", &c);
self.calculate_component_statistics(&c)?;
}
debug!("Calculating global graph statistics");
CT::calculate_global_statistics(self)?;
Ok(())
}
/// Makes sure the statistics for the given component are up-to-date.
pub fn calculate_component_statistics(&mut self, c: &Component<CT>) -> Result<()> {
let mut result: Result<()> = Ok(());
let mut entry = self
.components
.remove(c)
.ok_or_else(|| GraphAnnisCoreError::MissingComponent(c.to_string()))?;
if let Some(ref mut gs) = entry {
if let Some(gs_mut) = Arc::get_mut(gs) {
// Since immutable graph storages can't change, only writable graph storage statistics need to be re-calculated
if let Some(writeable_gs) = gs_mut.as_writeable() {
writeable_gs.calculate_statistics()?;
}
} else {
result = Err(GraphAnnisCoreError::NonExclusiveComponentReference(
c.to_string(),
));
}
}
// re-insert component entry
self.components.insert(c.clone(), entry);
result
}
/// Gets the the given component.
/// If the component does not exist yet, it creates a new empty one.
/// If the existing component is non-writable, a writable copy of it is created and returned.
pub fn get_or_create_writable(
&mut self,
c: &Component<CT>,
) -> Result<&mut dyn WriteableGraphStorage> {
if self.components.contains_key(c) {
// make sure the component is actually writable and loaded
self.ensure_writeable(c)?;
} else {
let w = registry::create_writeable(self, None)?;
self.components.insert(c.clone(), Some(w));
}
// get and return the reference to the entry
let entry: &mut Arc<dyn GraphStorage> = self
.components
.get_mut(c)
.ok_or_else(|| GraphAnnisCoreError::MissingComponent(c.to_string()))?
.as_mut()
.ok_or_else(|| GraphAnnisCoreError::ComponentNotLoaded(c.to_string()))?;
let gs_mut_ref: &mut dyn GraphStorage = Arc::get_mut(entry)
.ok_or_else(|| GraphAnnisCoreError::NonExclusiveComponentReference(c.to_string()))?;
let result = gs_mut_ref
.as_writeable()
.ok_or_else(|| GraphAnnisCoreError::ReadOnlyComponent(c.to_string()))?;
Ok(result)
}
/// Returns `true` if the graph storage for this specific component is loaded and ready to use.
pub fn is_loaded(&self, c: &Component<CT>) -> bool {
let entry: Option<&Option<Arc<dyn GraphStorage>>> = self.components.get(c);
if let Some(gs_opt) = entry {
if gs_opt.is_some() {
return true;
}
}
false
}
/// Ensure that the graph storages for all component are loaded and ready to use.
pub fn ensure_loaded_all(&mut self) -> Result<()> {
let mut components_to_load: Vec<_> = Vec::with_capacity(self.components.len());
// colllect all missing components
for (c, gs) in &self.components {
if gs.is_none() {
components_to_load.push(c.clone());
}
}
self.ensure_loaded_parallel(&components_to_load)?;
Ok(())
}
/// Ensure that the graph storage for a specific component is loaded and ready to use.
pub fn ensure_loaded(&mut self, c: &Component<CT>) -> Result<()> {
// We only load known components, so check the map if the entry exists
if let Some(gs_opt) = self.components.get_mut(c) {
// If this is none, the component is known but not loaded
if gs_opt.is_none() {
let component_path = component_path(&self.location, c)
.ok_or(GraphAnnisCoreError::EmptyComponentPath)?;
debug!(
"loading component {} from {}",
c,
&component_path.to_string_lossy()
);
let component = load_component_from_disk(&component_path)?;
gs_opt.get_or_insert_with(|| component);
}
}
Ok(())
}
/// Ensure that the graph storage for a the given component is loaded and ready to use.
/// Loading is done in paralell.
pub fn ensure_loaded_parallel(&mut self, components_to_load: &[Component<CT>]) -> Result<()> {
// We only load known components, so check the map if the entry exists
let components_to_load: Vec<_> = components_to_load
.iter()
.filter(|c| self.components.contains_key(c))
.collect();
// load missing components in parallel
let loaded_components: Vec<(_, Result<Arc<dyn GraphStorage>>)> = components_to_load
.into_par_iter()
.map(|c| match component_path(&self.location, c) {
Some(cpath) => {
debug!("loading component {} from {}", c, &cpath.to_string_lossy());
(c, load_component_from_disk(&cpath))
}
None => (c, Err(GraphAnnisCoreError::EmptyComponentPath)),
})
.collect();
// insert all the loaded components
for (c, gs) in loaded_components {
let gs = gs?;
self.components.insert(c.clone(), Some(gs));
}
Ok(())
}
pub fn optimize_impl(&mut self, disk_based: bool) -> Result<()> {
self.ensure_loaded_all()?;
if self.disk_based != disk_based {
self.disk_based = disk_based;
// Change the node annotation implementation
let mut new_node_annos: Box<dyn NodeAnnotationStorage> = if disk_based {
Box::new(crate::annostorage::ondisk::AnnoStorageImpl::new(None)?)
} else {
Box::new(crate::annostorage::inmemory::AnnoStorageImpl::<NodeID>::new())
};
// Copy all annotations for all nodes
info!("copying node annotations");
for m in self
.node_annos
.exact_anno_search(Some(ANNIS_NS), NODE_TYPE, ValueSearch::Any)
{
let m = m?;
for anno in self.node_annos.get_annotations_for_item(&m.node)? {
new_node_annos.insert(m.node, anno)?;
}
}
self.node_annos = new_node_annos;
}
info!("re-calculating all statistics");
self.calculate_all_statistics()?;
for c in self.get_all_components(None, None) {
// Perform the optimization if necessary
info!("optimizing implementation for component {}", &c);
self.optimize_gs_impl(&c)?;
}
if let Some(location) = &self.location {
info!("saving corpus to disk");
self.internal_save_with_backup(location)?;
}
Ok(())
}
pub fn optimize_gs_impl(&mut self, c: &Component<CT>) -> Result<()> {
if let Some(gs) = self.get_graphstorage(c) {
if let Some(stats) = gs.get_statistics() {
let opt_info = registry::get_optimal_impl_heuristic(self, stats);
// convert if necessary
if opt_info.id != gs.serialization_id() {
let mut new_gs = registry::create_from_info(&opt_info)?;
let converted = if let Some(new_gs_mut) = Arc::get_mut(&mut new_gs) {
info!(
"converting component {} to implementation {}",
c, opt_info.id,
);
new_gs_mut.copy(self.get_node_annos(), gs.as_ref())?;
true
} else {
false
};
if converted {
// insert into components map
info!(
"finished conversion of component {} to implementation {}",
c, opt_info.id,
);
self.components.insert(c.clone(), Some(new_gs.clone()));
}
}
}
}
Ok(())
}
/// Get a read-only graph storage copy for the given component `c`.
pub fn get_graphstorage(&self, c: &Component<CT>) -> Option<Arc<dyn GraphStorage>> {
// get and return the reference to the entry if loaded
let entry: &Arc<dyn GraphStorage> = self.components.get(c)?.as_ref()?;
Some(entry.clone())
}
/// Get a read-only graph storage reference for the given component `c`.
pub fn get_graphstorage_as_ref<'a>(
&'a self,
c: &Component<CT>,
) -> Option<&'a dyn GraphStorage> {
// get and return the reference to the entry if loaded
let entry: &Arc<dyn GraphStorage> = self.components.get(c)?.as_ref()?;
Some(entry.as_ref())
}
/// Get a read-only reference to the node annotations of this graph
pub fn get_node_annos(&self) -> &dyn NodeAnnotationStorage {
self.node_annos.as_ref()
}
/// Get a mutable reference to the node annotations of this graph
pub fn get_node_annos_mut(&mut self) -> &mut dyn NodeAnnotationStorage {
self.node_annos.as_mut()
}
/// Returns all components of the graph given an optional type (`ctype`) and `name`.
/// This allows to filter which components to receive.
/// If you want to retrieve all components, use `None` as value for both arguments.
pub fn get_all_components(&self, ctype: Option<CT>, name: Option<&str>) -> Vec<Component<CT>> {
if let (Some(ctype), Some(name)) = (&ctype, name) {
// lookup component from sorted map
let mut result: Vec<_> = Vec::new();
let ckey = Component::new(ctype.clone(), SmartString::default(), name.into());
for (c, _) in self.components.range(ckey..) {
if c.name != name || &c.get_type() != ctype {
break;
}
result.push(c.clone());
}
result
} else if let Some(ctype) = &ctype {
// lookup component from sorted map
let mut result: Vec<_> = Vec::new();
let ckey = Component::new(
ctype.clone(),
SmartString::default(),
SmartString::default(),
);
for (c, _) in self.components.range(ckey..) {
if &c.get_type() != ctype {
break;
}
result.push(c.clone());
}
result
} else {
// filter all entries
let filtered_components = self
.components
.keys()
.filter(move |c| {
if let Some(ctype) = ctype.clone() {
if ctype != c.get_type() {
return false;
}
}
if let Some(name) = name {
if name != c.name {
return false;
}
}
true
})
.cloned();
filtered_components.collect()
}
}
}
#[cfg(test)]
mod tests {
use super::*;
use crate::types::{AnnoKey, Annotation, DefaultComponentType, Edge};
#[test]
fn create_writeable_gs() {
let mut db = Graph::<DefaultComponentType>::new(false).unwrap();
let anno_key = AnnoKey {
ns: "test".into(),
name: "edge_anno".into(),
};
let anno_val = "testValue".into();
let component = Component::new(DefaultComponentType::Edge, "test".into(), "dep".into());
let gs: &mut dyn WriteableGraphStorage = db.get_or_create_writable(&component).unwrap();
gs.add_edge(Edge {
source: 0,
target: 1,
})
.unwrap();
gs.add_edge_annotation(
Edge {
source: 0,
target: 1,
},
Annotation {
key: anno_key,
val: anno_val,
},
)
.unwrap();
}
}