feat: LeanStore-style zero-allocation read and write paths

bundles/sirix-core/src/main/java/io/sirix/BinaryEncodingVersion.java

@@ -36,8 +36,9 @@
 public enum BinaryEncodingVersion {
 
   /**
-   * Zero-copy format: slot offsets array + raw slotMemory blob. Enables direct buffer slice as page
-   * storage without copying.
+   * Unified page format: Header(32B) + Bitmap(128B) + Directory(8KB) + Heap.
+   * FlyweightNode records bind directly to page memory for zero-copy reads.
+   * Non-FlyweightNode records are serialized to the heap at commit time.
    */
   V0((byte) 0);
 

bundles/sirix-core/src/main/java/io/sirix/access/Databases.java

@@ -36,7 +36,6 @@
  * @author Sebastian Graf, University of Konstanz
  */
 public final class Databases {
-
   /**
    * Private constructor to prevent instantiation.
    */
@@ -596,4 +595,5 @@ public static synchronized void reinitializeBufferManagerForTesting(long recordP
 
     logger.info("BufferManager reinitialized for testing");
   }
+
 }

bundles/sirix-core/src/main/java/io/sirix/access/ResourceStoreImpl.java

@@ -60,7 +60,10 @@ public R getOpenResourceSession(final Path resourceFile) {
 
   @Override
   public void close() {
-    resourceSessions.forEach((_, resourceSession) -> resourceSession.close());
+    resourceSessions.forEach((resourceFile, resourceSession) -> {
+      resourceSession.close();
+      allResourceSessions.removeObject(resourceFile, resourceSession);
+    });
     resourceSessions.clear();
   }
 

bundles/sirix-core/src/main/java/io/sirix/access/trx/node/AbstractNodeHashing.java

@@ -70,13 +70,25 @@ public void setAutoCommit(final boolean value) {
 
   /**
    * Adapting the structure with a hash for all ancestors only with insert.
+   * Uses the current cursor position as the start node.
    *
    * @throws SirixIOException if an I/O error occurs
    */
   public void adaptHashesWithAdd() {
+    adaptHashesWithAdd(nodeReadOnlyTrx.getNodeKey());
+  }
+
+  /**
+   * Adapting the structure with a hash for all ancestors only with insert.
+   * Accepts the start node key directly, avoiding a moveTo to position the cursor.
+   *
+   * @param startNodeKey the node key to start hashing from
+   * @throws SirixIOException if an I/O error occurs
+   */
+  public void adaptHashesWithAdd(final long startNodeKey) {
     if (!bulkInsert || autoCommit) {
       switch (hashType) {
-        case ROLLING -> rollingAdd();
+        case ROLLING -> rollingAdd(startNodeKey);
         case POSTORDER -> postorderAdd();
         case NONE -> {
         }
@@ -190,7 +202,8 @@ private void postorderAdd() {
   protected abstract StructNode getStructuralNode();
 
   private void persistNode(final Node node) {
-    storageEngineWriter.updateRecordSlot(node, IndexType.DOCUMENT, -1);
+    // Ensure the mutated node is stored in the TIL's modified page.
+    storageEngineWriter.persistRecord(node, IndexType.DOCUMENT, -1);
   }
 
   /**
@@ -290,10 +303,14 @@ private static void setRemoveDescendants(final long startDescendantCount, final
    *
    * @throws SirixIOException if an I/O error occurs
    */
-  private void rollingAdd() {
-    // start with hash to add
-    final Node startNode = storageEngineWriter.prepareRecordForModification(nodeReadOnlyTrx.getNodeKey(), IndexType.DOCUMENT, -1);
-    final long startNodeKey = startNode.getNodeKey();
+  private void rollingAdd(final long startNodeKey) {
+    // Position cursor on start node — needed for getStructuralNode().getDescendantCount()
+    // and to restore position at end. The caller eliminated the moveTo before adaptForInsert
+    // which is the bigger win (adaptForInsert is called unconditionally; rollingAdd only
+    // when hashing is enabled).
+    nodeReadOnlyTrx.moveTo(startNodeKey);
+    // start with hash to add — startNodeKey passed directly
+    final Node startNode = storageEngineWriter.prepareRecordForModification(startNodeKey, IndexType.DOCUMENT, -1);
     // Capture all needed values from startNode before any subsequent prepareRecordForModification
     // calls, which may return the same write-path singleton and overwrite startNode's fields.
     final long startParentKey = startNode.getParentKey();