nidx-binding 6.9.7.post683__tar.gz → 6.9.7.post693__tar.gz

{nidx_binding-6.9.7.post683 → nidx_binding-6.9.7.post693}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: nidx_binding
-Version: 6.9.7.post683
+Version: 6.9.7.post693
 Classifier: Programming Language :: Rust
 Classifier: Programming Language :: Python :: Implementation :: CPython
 Classifier: Programming Language :: Python :: Implementation :: PyPy

{nidx_binding-6.9.7.post683 → nidx_binding-6.9.7.post693}/nidx_paragraph/src/query_parser/keyword_parser.rs

@@ -77,7 +77,6 @@ pub fn parse_quoted(schema: &ParagraphSchema, quoted: &str) -> Result<Box<dyn Qu
         .map(|word| Term::from_field_text(schema.text, word))
         .collect();
 
-    #[allow(clippy::comparison_chain)]
     if terms.len() == 1 {
         // phrase queries must have more than one term, so we use a term query
         let term = terms.remove(0); // safe because terms.len() == 1

{nidx_binding-6.9.7.post683 → nidx_binding-6.9.7.post693}/nidx_protos/build.rs

@@ -21,6 +21,10 @@
 use std::io::Result;
 
 fn main() -> Result<()> {
+    println!("cargo:rerun-if-changed=nidx.proto");
+    println!("cargo:rerun-if-changed=nodereader.proto");
+    println!("cargo:rerun-if-changed=noderesources.proto");
+    println!("cargo:rerun-if-changed=nodewriter.proto");
     println!("cargo:rerun-if-changed=../../nucliadb_protos");
     println!("cargo:rerun-if-changed=src");
     tonic_build::configure().emit_rerun_if_changed(false).compile_protos(

{nidx_binding-6.9.7.post683 → nidx_binding-6.9.7.post693}/nidx_protos/nodereader.proto

@@ -151,16 +151,12 @@ message RelationPrefixSearchResponse {
 
 message GraphQuery {
     message Node {
+        reserved 4;
+
         optional string value = 1;
         optional utils.RelationNode.NodeType node_type = 2;
         optional string node_subtype = 3;
 
-        enum MatchKind {
-            DEPRECATED_EXACT = 0;
-            DEPRECATED_FUZZY = 1;
-        }
-        MatchKind match_kind = 4 [deprecated = true];
-
         enum MatchLocation {
             // Match full value. Search "Rosa Parks" to find "Rosa Parks"
             FULL = 0;
@@ -181,7 +177,7 @@ message GraphQuery {
             uint32 distance = 2;
         }
 
-        oneof new_match_kind {
+        oneof match_kind {
             ExactMatch exact = 5;
             FuzzyMatch fuzzy = 6;
         }

{nidx_binding-6.9.7.post683 → nidx_binding-6.9.7.post693}/nidx_protos/noderesources.proto

@@ -164,11 +164,13 @@ message Resource {
     map<string, IndexParagraphs> paragraphs = 6; // Paragraphs by field
 
     repeated string paragraphs_to_delete = 7;
-    // DEPRECATED: replaced by vector_prefixes_to_delete in order to support
-    // updates on a subset of the available vectorsets
-    repeated string sentences_to_delete = 8 [deprecated = true];
+
+    // Delete in all vectorsets (e.g: resource deletion)
+    repeated string vectors_to_delete_in_all_vectorsets = 8;
+    // Delete in some vectorsets (e.g: updating some vectors)
     // vectorset_id -> [vector_key_prefix, ...]
     map<string, StringList> vector_prefixes_to_delete = 15;
+
     repeated string relation_fields_to_delete = 16;
     repeated string texts_to_delete = 17;
 

{nidx_binding-6.9.7.post683 → nidx_binding-6.9.7.post693}/nidx_protos/nodewriter.proto

@@ -57,12 +57,11 @@ message VectorIndexConfig {
 }
 
 message NewShardRequest {
+    reserved 4, 5;
     utils.VectorSimilarity similarity = 1 [deprecated = true];
     string kbid = 2;
     utils.ReleaseChannel release_channel = 3;
-    // indicates whether the shard should normalize vectors on indexing or not
-    bool normalize_vectors = 4 [deprecated = true];
-    VectorIndexConfig config = 5 [deprecated = true];
+
     map<string, VectorIndexConfig> vectorsets_configs = 6;
     bool prewarm_enabled = 7;
 

{nidx_binding-6.9.7.post683 → nidx_binding-6.9.7.post693}/nidx_protos/pyproject.toml

@@ -10,7 +10,7 @@ build-backend = "pdm.backend"
 
 [project]
 name = "nidx_protos"
-version = "6.9.7.post683"
+version = "6.9.7.post693"
 license = "AGPL-3.0-or-later"
 description = "Protobuf definitions for nucliadb/nidx"
 authors = [{ name = "Nuclia", email = "nucliadb@nuclia.com" }]

{nidx_binding-6.9.7.post683 → nidx_binding-6.9.7.post693}/nidx_relation/src/graph_query_parser.rs

@@ -30,8 +30,6 @@ use tantivy::tokenizer::TokenizerManager;
 use crate::io_maps;
 use crate::schema::Schema;
 
-const DEFAULT_NODE_VALUE_FUZZY_DISTANCE: u8 = 1;
-
 #[derive(Clone)]
 pub struct FuzzyTerm {
     pub value: String,
@@ -702,56 +700,54 @@ impl TryFrom<&nidx_protos::graph_query::Node> for Node {
 
     fn try_from(node_pb: &nidx_protos::graph_query::Node) -> Result<Self, Self::Error> {
         let value = node_pb.value.clone().map(|value| {
-            if let Some(match_kind) = node_pb.new_match_kind {
-                match match_kind {
-                    nidx_protos::graph_query::node::NewMatchKind::Exact(exact) => match exact.kind() {
-                        MatchLocation::Full => Term::Exact(value),
-                        MatchLocation::Prefix => Term::Fuzzy(FuzzyTerm {
-                            value,
-                            fuzzy_distance: 0,
-                            is_prefix: true,
-                        }),
-                        MatchLocation::Words => Term::ExactWord(value),
-                        MatchLocation::PrefixWords => Term::FuzzyWord(FuzzyTerm {
-                            value,
-                            fuzzy_distance: 0,
-                            is_prefix: true,
-                        }),
-                    },
-                    nidx_protos::graph_query::node::NewMatchKind::Fuzzy(fuzzy) => match fuzzy.kind() {
-                        MatchLocation::Full => Term::Fuzzy(FuzzyTerm {
-                            value,
-                            fuzzy_distance: fuzzy.distance as u8,
-                            is_prefix: false,
-                        }),
-                        MatchLocation::Prefix => Term::Fuzzy(FuzzyTerm {
-                            value,
-                            fuzzy_distance: fuzzy.distance as u8,
-                            is_prefix: true,
-                        }),
-                        MatchLocation::Words => Term::FuzzyWord(FuzzyTerm {
-                            value,
-                            fuzzy_distance: fuzzy.distance as u8,
-                            is_prefix: false,
-                        }),
-                        MatchLocation::PrefixWords => Term::FuzzyWord(FuzzyTerm {
-                            value,
-                            fuzzy_distance: fuzzy.distance as u8,
-                            is_prefix: true,
-                        }),
+            // Default to exact match to keep backwards compatibility
+            let match_kind = node_pb
+                .match_kind
+                .unwrap_or(nidx_protos::graph_query::node::MatchKind::Exact(
+                    nidx_protos::graph_query::node::ExactMatch {
+                        kind: MatchLocation::Full as i32,
                     },
-                }
-            } else {
-                match node_pb.match_kind() {
-                    nidx_protos::graph_query::node::MatchKind::DeprecatedExact => Term::Exact(value),
-                    nidx_protos::graph_query::node::MatchKind::DeprecatedFuzzy => Term::Fuzzy(FuzzyTerm {
+                ));
+            match match_kind {
+                nidx_protos::graph_query::node::MatchKind::Exact(exact) => match exact.kind() {
+                    MatchLocation::Full => Term::Exact(value),
+                    MatchLocation::Prefix => Term::Fuzzy(FuzzyTerm {
                         value,
-                        fuzzy_distance: DEFAULT_NODE_VALUE_FUZZY_DISTANCE,
+                        fuzzy_distance: 0,
                         is_prefix: true,
                     }),
-                }
+                    MatchLocation::Words => Term::ExactWord(value),
+                    MatchLocation::PrefixWords => Term::FuzzyWord(FuzzyTerm {
+                        value,
+                        fuzzy_distance: 0,
+                        is_prefix: true,
+                    }),
+                },
+                nidx_protos::graph_query::node::MatchKind::Fuzzy(fuzzy) => match fuzzy.kind() {
+                    MatchLocation::Full => Term::Fuzzy(FuzzyTerm {
+                        value,
+                        fuzzy_distance: fuzzy.distance as u8,
+                        is_prefix: false,
+                    }),
+                    MatchLocation::Prefix => Term::Fuzzy(FuzzyTerm {
+                        value,
+                        fuzzy_distance: fuzzy.distance as u8,
+                        is_prefix: true,
+                    }),
+                    MatchLocation::Words => Term::FuzzyWord(FuzzyTerm {
+                        value,
+                        fuzzy_distance: fuzzy.distance as u8,
+                        is_prefix: false,
+                    }),
+                    MatchLocation::PrefixWords => Term::FuzzyWord(FuzzyTerm {
+                        value,
+                        fuzzy_distance: fuzzy.distance as u8,
+                        is_prefix: true,
+                    }),
+                },
             }
         });
+
         let node_type = node_pb.node_type.map(NodeType::try_from).transpose()?;
         let node_subtype = node_pb.node_subtype.clone();
 

{nidx_binding-6.9.7.post683 → nidx_binding-6.9.7.post693}/nidx_relation/src/lib.rs

@@ -29,8 +29,8 @@ mod top_unique_n;
 use anyhow::anyhow;
 use nidx_protos::graph_query;
 use nidx_protos::graph_query::node::FuzzyMatch;
+use nidx_protos::graph_query::node::MatchKind;
 use nidx_protos::graph_query::node::MatchLocation;
-use nidx_protos::graph_query::node::NewMatchKind;
 use nidx_protos::graph_query::path_query;
 use nidx_protos::graph_search_request::QueryKind;
 use nidx_protos::{
@@ -225,7 +225,7 @@ impl RelationSearcher {
                     source: Some(graph_query::Node {
                         value: Some(prefix),
                         node_type: Some(NodeType::Entity.into()),
-                        new_match_kind: Some(NewMatchKind::Fuzzy(FuzzyMatch {
+                        match_kind: Some(MatchKind::Fuzzy(FuzzyMatch {
                             kind: MatchLocation::Prefix.into(),
                             distance: FUZZY_DISTANCE as u32,
                         })),

{nidx_binding-6.9.7.post683 → nidx_binding-6.9.7.post693}/nidx_relation/src/schema.rs

@@ -394,7 +394,6 @@ pub fn encode_relation(relation_type: u64, relation_label: &str) -> Vec<u64> {
     out
 }
 
-#[allow(dead_code)]
 pub fn decode_relation(data: &[u64]) -> (u64, String) {
     let buffer = data[0].to_le_bytes();
     let relation_type = buffer[0] as u64;

{nidx_binding-6.9.7.post683 → nidx_binding-6.9.7.post693}/nidx_relation/tests/test_graph_search.rs

@@ -21,8 +21,7 @@ mod common;
 
 use std::collections::{HashMap, HashSet};
 
-use nidx_protos::graph_query::node::{ExactMatch, FuzzyMatch, NewMatchKind};
-use nidx_protos::graph_query::node::{MatchKind, MatchLocation};
+use nidx_protos::graph_query::node::{ExactMatch, FuzzyMatch, MatchKind, MatchLocation};
 use nidx_protos::graph_query::path_query::Query;
 use nidx_protos::graph_query::{BoolQuery, FacetFilter, Node, Path, PathQuery, Relation};
 use nidx_protos::graph_search_request::QueryKind;
@@ -217,7 +216,7 @@ fn test_graph_node_exact_matches() -> anyhow::Result<()> {
         Query::Path(Path {
             destination: Some(Node {
                 value: Some("Computer science".to_string()),
-                new_match_kind: Some(NewMatchKind::Exact(ExactMatch {
+                match_kind: Some(MatchKind::Exact(ExactMatch {
                     kind: MatchLocation::Full.into(),
                 })),
                 ..Default::default()
@@ -236,7 +235,7 @@ fn test_graph_node_exact_matches() -> anyhow::Result<()> {
         Query::Path(Path {
             destination: Some(Node {
                 value: Some("Computer sci".to_string()),
-                new_match_kind: Some(NewMatchKind::Exact(ExactMatch {
+                match_kind: Some(MatchKind::Exact(ExactMatch {
                     kind: MatchLocation::Prefix.into(),
                 })),
                 ..Default::default()
@@ -253,7 +252,7 @@ fn test_graph_node_exact_matches() -> anyhow::Result<()> {
         Query::Path(Path {
             destination: Some(Node {
                 value: Some("Compu".to_string()),
-                new_match_kind: Some(NewMatchKind::Exact(ExactMatch {
+                match_kind: Some(MatchKind::Exact(ExactMatch {
                     kind: MatchLocation::Prefix.into(),
                 })),
                 ..Default::default()
@@ -272,7 +271,7 @@ fn test_graph_node_exact_matches() -> anyhow::Result<()> {
         Query::Path(Path {
             destination: Some(Node {
                 value: Some("Computer".to_string()),
-                new_match_kind: Some(NewMatchKind::Exact(ExactMatch {
+                match_kind: Some(MatchKind::Exact(ExactMatch {
                     kind: MatchLocation::Words.into(),
                 })),
                 ..Default::default()
@@ -289,7 +288,7 @@ fn test_graph_node_exact_matches() -> anyhow::Result<()> {
         Query::Path(Path {
             destination: Some(Node {
                 value: Some("science".to_string()),
-                new_match_kind: Some(NewMatchKind::Exact(ExactMatch {
+                match_kind: Some(MatchKind::Exact(ExactMatch {
                     kind: MatchLocation::Words.into(),
                 })),
                 ..Default::default()
@@ -308,7 +307,7 @@ fn test_graph_node_exact_matches() -> anyhow::Result<()> {
         Query::Path(Path {
             destination: Some(Node {
                 value: Some("sci".to_string()),
-                new_match_kind: Some(NewMatchKind::Exact(ExactMatch {
+                match_kind: Some(MatchKind::Exact(ExactMatch {
                     kind: MatchLocation::PrefixWords.into(),
                 })),
                 ..Default::default()
@@ -328,14 +327,16 @@ fn test_graph_fuzzy_node_query() -> anyhow::Result<()> {
     let reader = create_reader()?;
 
     // (:~Anastas)
-    #[allow(deprecated)]
     let result = search(
         &reader,
         Query::Path(Path {
             source: Some(Node {
                 node_subtype: Some("PERSON".to_string()),
                 value: Some("Anastas".to_string()),
-                match_kind: MatchKind::DeprecatedFuzzy.into(),
+                match_kind: Some(MatchKind::Fuzzy(FuzzyMatch {
+                    kind: MatchLocation::Prefix.into(),
+                    distance: 1,
+                })),
                 ..Default::default()
             }),
             ..Default::default()
@@ -346,14 +347,16 @@ fn test_graph_fuzzy_node_query() -> anyhow::Result<()> {
     assert!(relations.contains(&("Anastasia", "IS_FRIEND", "Anna")));
 
     // (:~AnXstXsia) with fuzzy=1
-    #[allow(deprecated)]
     let result = search(
         &reader,
         Query::Path(Path {
             source: Some(Node {
                 node_subtype: Some("PERSON".to_string()),
                 value: Some("AnXstXsia".to_string()),
-                match_kind: MatchKind::DeprecatedFuzzy.into(),
+                match_kind: Some(MatchKind::Fuzzy(FuzzyMatch {
+                    kind: MatchLocation::Full.into(),
+                    distance: 1,
+                })),
                 ..Default::default()
             }),
             ..Default::default()
@@ -363,14 +366,16 @@ fn test_graph_fuzzy_node_query() -> anyhow::Result<()> {
     assert_eq!(relations.len(), 0);
 
     // (:~AnXstasia) with fuzzy=1
-    #[allow(deprecated)]
     let result = search(
         &reader,
         Query::Path(Path {
             source: Some(Node {
                 node_subtype: Some("PERSON".to_string()),
                 value: Some("AnXstasia".to_string()),
-                match_kind: MatchKind::DeprecatedFuzzy.into(),
+                match_kind: Some(MatchKind::Fuzzy(FuzzyMatch {
+                    kind: MatchLocation::Full.into(),
+                    distance: 1,
+                })),
                 ..Default::default()
             }),
             ..Default::default()
@@ -381,14 +386,16 @@ fn test_graph_fuzzy_node_query() -> anyhow::Result<()> {
     assert!(relations.contains(&("Anastasia", "IS_FRIEND", "Anna")));
 
     // (:^~Ana) matches Anna & Anastasia
-    #[allow(deprecated)]
     let result = search(
         &reader,
         Query::Path(Path {
             source: Some(Node {
                 node_subtype: Some("PERSON".to_string()),
                 value: Some("Ana".to_string()),
-                match_kind: MatchKind::DeprecatedFuzzy.into(),
+                match_kind: Some(MatchKind::Fuzzy(FuzzyMatch {
+                    kind: MatchLocation::Prefix.into(),
+                    distance: 1,
+                })),
                 ..Default::default()
             }),
             ..Default::default()
@@ -416,7 +423,7 @@ fn test_graph_node_fuzzy_matches() -> anyhow::Result<()> {
         Query::Path(Path {
             destination: Some(Node {
                 value: Some("Computer scXence".to_string()),
-                new_match_kind: Some(NewMatchKind::Fuzzy(FuzzyMatch {
+                match_kind: Some(MatchKind::Fuzzy(FuzzyMatch {
                     kind: MatchLocation::Full.into(),
                     distance: 1,
                 })),
@@ -436,7 +443,7 @@ fn test_graph_node_fuzzy_matches() -> anyhow::Result<()> {
         Query::Path(Path {
             destination: Some(Node {
                 value: Some("CompuXer sci".to_string()),
-                new_match_kind: Some(NewMatchKind::Fuzzy(FuzzyMatch {
+                match_kind: Some(MatchKind::Fuzzy(FuzzyMatch {
                     kind: MatchLocation::Prefix.into(),
                     distance: 1,
                 })),
@@ -454,7 +461,7 @@ fn test_graph_node_fuzzy_matches() -> anyhow::Result<()> {
         Query::Path(Path {
             destination: Some(Node {
                 value: Some("CoXpu".to_string()),
-                new_match_kind: Some(NewMatchKind::Fuzzy(FuzzyMatch {
+                match_kind: Some(MatchKind::Fuzzy(FuzzyMatch {
                     kind: MatchLocation::Prefix.into(),
                     distance: 1,
                 })),
@@ -474,7 +481,7 @@ fn test_graph_node_fuzzy_matches() -> anyhow::Result<()> {
         Query::Path(Path {
             destination: Some(Node {
                 value: Some("ComXuter".to_string()),
-                new_match_kind: Some(NewMatchKind::Fuzzy(FuzzyMatch {
+                match_kind: Some(MatchKind::Fuzzy(FuzzyMatch {
                     kind: MatchLocation::Words.into(),
                     distance: 1,
                 })),
@@ -492,7 +499,7 @@ fn test_graph_node_fuzzy_matches() -> anyhow::Result<()> {
         Query::Path(Path {
             destination: Some(Node {
                 value: Some("sciXnce".to_string()),
-                new_match_kind: Some(NewMatchKind::Fuzzy(FuzzyMatch {
+                match_kind: Some(MatchKind::Fuzzy(FuzzyMatch {
                     kind: MatchLocation::Words.into(),
                     distance: 1,
                 })),
@@ -512,7 +519,7 @@ fn test_graph_node_fuzzy_matches() -> anyhow::Result<()> {
         Query::Path(Path {
             destination: Some(Node {
                 value: Some("scXen".to_string()),
-                new_match_kind: Some(NewMatchKind::Fuzzy(FuzzyMatch {
+                match_kind: Some(MatchKind::Fuzzy(FuzzyMatch {
                     kind: MatchLocation::PrefixWords.into(),
                     distance: 1,
                 })),

{nidx_binding-6.9.7.post683 → nidx_binding-6.9.7.post693}/nidx_vector/src/config.rs

@@ -106,6 +106,8 @@ pub struct VectorConfig {
     pub vector_cardinality: VectorCardinality,
     #[serde(default, skip_serializing_if = "Vec::is_empty")]
     pub flags: Vec<String>,
+    #[serde(default)]
+    pub disable_indexes: bool,
 }
 
 impl VectorConfig {
@@ -144,6 +146,7 @@ impl TryFrom<VectorIndexConfig> for VectorConfig {
             vector_type,
             flags: vec![],
             vector_cardinality: VectorCardinality::Single,
+            disable_indexes: false,
         })
     }
 }

{nidx_binding-6.9.7.post683 → nidx_binding-6.9.7.post693}/nidx_vector/src/data_store/v1/store.rs

@@ -219,6 +219,7 @@ mod tests {
         normalize_vectors: false,
         flags: vec![],
         vector_cardinality: VectorCardinality::Single,
+        disable_indexes: false,
     };
 
     #[test]

{nidx_binding-6.9.7.post683 → nidx_binding-6.9.7.post693}/nidx_vector/src/lib.rs

@@ -81,9 +81,7 @@ impl VectorIndexer {
         if let Some(prefixes) = resource.vector_prefixes_to_delete.get(index_name) {
             prefixes.items.clone()
         } else {
-            // DEPRECATED: Bw/c while moving from sentences_to_delete to vector_prefixes_to_delete
-            #[allow(deprecated)]
-            resource.sentences_to_delete.clone()
+            resource.vectors_to_delete_in_all_vectorsets.clone()
         }
     }
 

{nidx_binding-6.9.7.post683 → nidx_binding-6.9.7.post693}/nidx_vector/src/searcher.rs

@@ -416,6 +416,7 @@ mod tests {
             vector_type: VectorType::DenseF32 { dimension: 3 },
             flags: vec![],
             vector_cardinality: VectorCardinality::Single,
+            disable_indexes: false,
         };
         let raw_sentences = [
             (
@@ -511,6 +512,7 @@ mod tests {
             vector_type: VectorType::DenseF32 { dimension: 3 },
             flags: vec![],
             vector_cardinality: VectorCardinality::Single,
+            disable_indexes: false,
         };
         let raw_sentences = [
             (
@@ -625,6 +627,7 @@ mod tests {
             vector_type: VectorType::DenseF32 { dimension: 3 },
             flags: vec![],
             vector_cardinality: VectorCardinality::Single,
+            disable_indexes: false,
         };
         let raw_sentences = [
             (

{nidx_binding-6.9.7.post683 → nidx_binding-6.9.7.post693}/nidx_vector/src/segment/tests.rs

@@ -35,6 +35,7 @@ const CONFIG: VectorConfig = VectorConfig {
     vector_type: crate::config::VectorType::DenseF32 { dimension: 128 },
     flags: vec![],
     vector_cardinality: VectorCardinality::Single,
+    disable_indexes: false,
 };
 
 fn create_query() -> Vec<f32> {

{nidx_binding-6.9.7.post683 → nidx_binding-6.9.7.post693}/nidx_vector/src/segment.rs

@@ -56,7 +56,7 @@ pub fn open(metadata: VectorSegmentMetadata, config: &VectorConfig) -> VectorR<O
         let data_store = DataStoreV2::open(path, &config.vector_type, OpenReason::Search { prewarm })?;
         // Build the index at runtime if they do not exist. This can
         // be removed once we have migrated all existing indexes
-        if !InvertedIndexes::exists(path) {
+        if !InvertedIndexes::exists(path) && !config.disable_indexes {
             build_indexes(path, &data_store)?;
         }
         Box::new(data_store)
@@ -64,7 +64,15 @@ pub fn open(metadata: VectorSegmentMetadata, config: &VectorConfig) -> VectorR<O
 
     let index = open_disk_hnsw(path, prewarm)?;
 
-    let inverted_indexes = InvertedIndexes::open(path, metadata.records, inverted_index::OpenOptions { prewarm })?;
+    let inverted_indexes = if !config.disable_indexes {
+        Some(InvertedIndexes::open(
+            path,
+            metadata.records,
+            inverted_index::OpenOptions { prewarm },
+        )?)
+    } else {
+        None
+    };
     let alive_bitset = FilterBitSet::new(metadata.records, true);
 
     Ok(OpenSegment {
@@ -160,12 +168,16 @@ fn merge_indexes<DS: DataStore + 'static>(
         },
     };
 
-    build_indexes(segment_path, &data_store)?;
-    let inverted_indexes = InvertedIndexes::open(
-        segment_path,
-        merged_vectors_count as usize,
-        inverted_index::OpenOptions { prewarm: false },
-    )?;
+    let inverted_indexes = if !config.disable_indexes {
+        build_indexes(segment_path, &data_store)?;
+        Some(InvertedIndexes::open(
+            segment_path,
+            merged_vectors_count as usize,
+            inverted_index::OpenOptions { prewarm: false },
+        )?)
+    } else {
+        None
+    };
     let alive_bitset = FilterBitSet::new(metadata.records, true);
 
     Ok(OpenSegment {
@@ -250,12 +262,15 @@ fn create_indexes<DS: DataStore + 'static>(
         index_metadata: VectorSegmentMeta { tags },
     };
 
-    build_indexes(path, &data_store)?;
-    let inverted_indexes = InvertedIndexes::open(
-        path,
-        vector_count as usize,
-        inverted_index::OpenOptions { prewarm: false },
-    )?;
+    let inverted_indexes = if !config.disable_indexes {
+        Some(InvertedIndexes::open(
+            path,
+            vector_count as usize,
+            inverted_index::OpenOptions { prewarm: false },
+        )?)
+    } else {
+        None
+    };
     let alive_bitset = FilterBitSet::new(metadata.records, true);
 
     Ok(OpenSegment {
@@ -396,7 +411,7 @@ pub struct OpenSegment {
     metadata: VectorSegmentMetadata,
     data_store: Box<dyn DataStore>,
     index: Box<dyn DiskHnsw>,
-    inverted_indexes: InvertedIndexes,
+    inverted_indexes: Option<InvertedIndexes>,
     alive_bitset: FilterBitSet,
 }
 
@@ -408,7 +423,10 @@ impl AsRef<OpenSegment> for OpenSegment {
 
 impl OpenSegment {
     pub fn apply_deletion(&mut self, key: &str) {
-        if let Some(deleted_ids) = self.inverted_indexes.ids_for_deletion_key(key) {
+        let Some(inverted_indexes) = &self.inverted_indexes else {
+            return;
+        };
+        if let Some(deleted_ids) = inverted_indexes.ids_for_deletion_key(key) {
             for id in deleted_ids {
                 self.alive_bitset.remove(id);
             }
@@ -428,7 +446,9 @@ impl OpenSegment {
     }
 
     pub fn space_usage(&self) -> usize {
-        self.data_store.size_bytes() + self.index.size() + self.inverted_indexes.space_usage()
+        self.data_store.size_bytes()
+            + self.index.size()
+            + self.inverted_indexes.as_ref().map_or(0, InvertedIndexes::space_usage)
     }
 
     pub fn get_paragraph(&self, id: ParagraphAddr) -> ParagraphRef<'_> {
@@ -478,7 +498,7 @@ impl OpenSegment {
         };
         let retriever = Retriever::new(data_store, config, min_score);
 
-        let mut filter_bitset = self.inverted_indexes.filter(filter);
+        let mut filter_bitset = self.inverted_indexes.as_ref().and_then(|ii| ii.filter(filter));
         if let Some(ref mut bitset) = filter_bitset {
             bitset.intersect_with(&self.alive_bitset);
         }
@@ -710,6 +730,7 @@ mod test {
             normalize_vectors: false,
             flags: vec![],
             vector_cardinality: VectorCardinality::Single,
+            disable_indexes: false,
         };
         let mut rng = SmallRng::seed_from_u64(1234567890);
         let temp_dir = tempdir()?;
@@ -756,6 +777,7 @@ mod test {
             normalize_vectors: false,
             flags: vec![],
             vector_cardinality: VectorCardinality::Single,
+            disable_indexes: false,
         };
         let mut rng = SmallRng::seed_from_u64(1234567890);
 
@@ -834,6 +856,7 @@ mod test {
             normalize_vectors: false,
             flags: vec![],
             vector_cardinality: VectorCardinality::Single,
+            disable_indexes: false,
         };
 
         // Create a segment

{nidx_binding-6.9.7.post683 → nidx_binding-6.9.7.post693}/nidx_vector/tests/test_basic_search.rs

@@ -62,6 +62,7 @@ fn test_basic_search(
         normalize_vectors: false,
         flags,
         vector_cardinality: VectorCardinality::Single,
+        disable_indexes: false,
     };
 
     // Creates a resource with some orthogonal vectors, to test search
@@ -163,6 +164,7 @@ fn test_deletions() -> anyhow::Result<()> {
         normalize_vectors: false,
         flags: vec![],
         vector_cardinality: VectorCardinality::Single,
+        disable_indexes: false,
     };
 
     // Creates a couple of resources
@@ -240,6 +242,7 @@ fn test_filtered_search() -> anyhow::Result<()> {
         normalize_vectors: false,
         flags: vec![],
         vector_cardinality: VectorCardinality::Single,
+        disable_indexes: false,
     };
 
     // Create 4 resources