Abstract: The present invention provides a control method of a server, wherein the server includes a write buffer for temporarily storing data from an electronic device, the write buffer has a plurality of sectors, and the write buffer has a write pointer and a flush pointer; and the control method comprises: setting each sector to have one of a plurality of states comprising an empty state, a merging state, a need-flush state and a flushing state; and referring to a state of a specific sector indicted by the write pointer to determine if ignoring the specific sector to directly process a sector after the specific sector.

Abstract: A technique performs data reduction on host data of a write request during ingest under certain circumstances. Therein, raw host data of a write request is placed from the host into a data cache. Further, a data reducing ingest operation is performed that reduces the raw host data from the data cache into reduced host data (e.g., via deduplication, compression, combinations thereof, etc.). After completion of the data reducing ingest operation, a late-binding operation is performed that updates a mapper with ability to access the reduced host data from secondary storage. Such ingest-time data reduction may be enabled/disabled (e.g., turned on or off) per input/output (I/O) operation (e.g., used only for relatively large asynchronous I/O operations) and/or activated in situations in which the ingest bandwidth is becoming a bottleneck.

Abstract: Systems and methods are disclosed for protecting user privacy in, for example, online advertising environments. The method includes receiving data related to a user in a first communication session between a host server and a client device, and generating a user profile associated with the user. The method further may include encrypting the user profile to produce encrypted user profile data and generating a decryption key for decrypting the encrypted user profile data. Thereafter, either the decryption key or a portion of the encrypted user profile data may be transmitted to the client device and then deleted from host server before ending the first communication session. The method further may include establishing a second communication session between the host server and the client device and retrieving the transmitted content. Then targeted advertising may be provided by decrypting the encrypted user profile data.

Abstract: A method to protect code against altering includes reading immutable boot code from a ROM. A code image is loaded from an external memory and a hash is calculated by a core unit. The hash is initially authenticated using the boot code for decrypting the hash of the external memory. A salted hash for each equivalent of a cache line of the code image is concurrently calculated by a cache protection block and the salted hash for each cache line in an internal hash table is stored. If the authentication succeeds, a part of the code image is loaded into a secure cache of the embedded micro-processor.

Abstract: A method for storing data includes obtaining data, applying an erasure coding procedure to the data to obtain a plurality of data chunks and a parity chunk, deduplicating the plurality of data chunks to obtain a plurality of deduplicated data chunks, storing, across a plurality of nodes, the plurality of deduplicated data chunks and the parity chunk, and tracking location information for each of the plurality of deduplicated data chunks and the parity chunk.

Abstract: A method, computer program, and computer system is provided for decoding point cloud data. Data corresponding to a point cloud is received. Hash elements corresponding to one or more neighboring nodes associated with a current node are identified. A size of a hash table is decreased based on deleting one or more of the hash elements corresponding to non-border regions of the one or more neighboring nodes. The data corresponding to the point cloud is decoded based on the hash table having the decreased size.

Abstract: Described are platforms, systems, and methods for processing a chain of operations through an input output (IO) subsystem without central processing unit (CPU) involvement. In one aspect, a computer-implemented method comprises: providing, via the CPU, the chain of operations to the IO subsystem, wherein the IO subsystem is coupled to the one or more processors over Peripheral Component Interconnect Express (PCIe); processing, with the IO subsystem, the chain of operations by: retrieving, from a memory, data associated with the chain of operations; executing each of the operations in the chain to determine an output based on the data and output determined for any prior executed operation in the chain; and providing the output of each the executed operations for execution of the respective next operation in the chain; and providing, via the IO subsystem, an output for the chain of operations to the CPU.

Abstract: A data-masking tool encoded on one or more computing readable storage media that includes a code that uses a combination of fields that uniquely identifies data in a record and utilizing it as a reference to mask original data with substitute values, by either aggregating several into one, mapping one-to-one or expanding one into a set.

Abstract: Memory utilization in an SDRAM system may be improved by increasing memory bank group and memory bank interleaving. Memory bank group interleaving and memory bank interleaving may be increased by a memory controller generating a physical memory address in which the bank group address bits are positioned nearer the LSB of the physical memory address than the MSB. Alternatively, or in addition to positioning the bank group address bits in such a manner, memory bank group interleaving and memory bank interleaving may be increased by hashing the bank group address bits and bank address bits of the physical memory address with row address bits of the initial physical memory address, A rank address bit may also be involved in the hashing.

Abstract: Methods, systems, and devices for reduced pin status register are described. An apparatus may include a first memory die and a second memory die each coupled with a data bus. The apparatus may further include a controller coupled with the first memory die and the second memory die via the data bus that is configured to transmit a first command associated with a first operation to the first memory die and a second command associated with a second operation to the second memory die. The controller may further transmit a third command concurrently to the first memory die and the second memory die, the third command requesting a first status of the first operation and a second status of the second operation. The controller may receive the first status and the second status concurrently via the data bus from the first memory die and the second memory die.

Abstract: An aspect of determining per volume exclusive capacity in a deduplication system includes setting a percentage of a population of pages for selection. For each of the pages, an aspect includes selecting a page in the population, providing a data segment facilitating multiple references of the segment by at least one storage entity, maintaining counts corresponding with each segment in the page, and determining exclusive ownership of the page based on the counts and a key value of one of a plurality of storage entities.

Abstract: An example system implementing a processing-in-memory pipeline includes: a memory array to store data in a plurality of memory cells electrically coupled to a plurality of wordlines and a plurality of bitlines; a logic array coupled to the memory array, the logic array to implement configurable logic controlling the plurality of memory cells; and a control block coupled to the memory array and the logic array, the control block to control a computational pipeline to perform computations on the data by activating at least one of: one or more bitlines of the plurality of bitlines or one or more wordlines of the plurality of wordlines.

Abstract: The disclosed technology generally describes a preliminary (e.g., triple mirroring) data protection scheme that operates by writing data as redundant (e.g., three) composite copies made up of copies of data fragments to different nodes of a data storage system. The data fragments are distributed such that any two nodes can fail yet a complete set of data remains among the remaining data fragments. Later, erasure encoding creates redundant coding fragments that are written to the nodes of a data storage system in a distributed manner along with one copy of the data fragments, such that any two nodes can fail but the complete data can still be recovered. Redundant data fragments are then deleted.

Abstract: Systems, methods and apparatus for malware detection detect and stop the distribution of malware and other undesirable content before such content reaches computing systems. A cloud-based malware detection method includes receiving a signature from a computer, wherein the signature which identifies a file and the signature is smaller in size than the file; determining whether the file is trusted, untrusted, or unknown for malware based on the signature; and transmitting whether the file is trusted, untrusted, or unknown for malware to the computer based on the determining, wherein the computer is precluded from distribution of the file responsive to the file being untrusted.

Abstract: A method for multi-connectivity communication in an application layer of a communication network. The method includes generating a plurality of decision elements and repeating a first iterative process. An ith iteration of the first iterative process includes generating an ith transmit message set by executing an application, transmitting the ith transmit message set from a transmitter to a receiver, receiving an ith receive message set of a plurality of receive message sets, and updating the plurality of decision elements. The ith transmit message set is transmitted over a plurality of networks. The ith transmit message set is transmitted based on the plurality of decision elements. Each transmit message in the ith transmit message set is associated with at least one respective network of the plurality of networks. The plurality of decision elements are updated based on a jth receive message set in the plurality of receive message sets.

Abstract: Disclosed herein are a hardware security module, a device having the hardware security module, and a method for operating the device. The method for verifying integrity of executable code in a device includes dividing, by a Micro-Control Unit (MCU), executable code into multiple blocks, generating, by the MCU, hash values corresponding to the blocks resulting from the division, storing, by a Hardware Security Module (HSM), the generated hash values, calculating, by the MCU, at least one hash value, among hash values of the multiple blocks when the executable code boots, and comparing, by the HSM, the calculated hash value with a hash value corresponding to the calculated hash value, among the hash values stored in the HSM.

Abstract: A Key-Value (KV) storage device is disclosed. The KV storage device may include storage for a first object and a second object. Each object may include data associated with a key. A KV translation layer may translate a key to a physical address in the storage where the data is stored. A KV interface may receive a KV request involving an object, and a block interface may receive a block request involving an object. A block emulator may generate a KV request including a key generated from the block request.

Abstract: A processing device includes a system tag data structure to store a system tag that includes a logical transfer unit (LTU) identifier corresponding to an LTU, which includes a subset of a plurality of sequential logical block addresses (LBAs) that includes an LBA of a read request, and a mapping data structure that maps a zone of LBA space to physical address space. Hardware logic is to: retrieve the LTU identifier from the system tag; determine a zone identifier (ID) based on the LTU identifier; index, using at least one of the zone ID or the LTU identifier, into the mapping data structure to retrieve metadata that specifies a mapping between the LTU identifier and a physical address of the physical address space; and store the metadata in the system tag data structure in association with the system tag.

Abstract: A computer-implemented method includes sending key group information to a storage system. The key group information includes keyID information for client data keys in the key group. The client data keys enable deduplication of data chunks encrypted in any of the client data keys in the key group. The method also includes generating deduplication information. The deduplication information includes fingerprints associated with chunks of client data. The method also includes encrypting the data chunks with one of the client data keys, wherein a corresponding decryption key for the encrypted data chunks is not available to the storage system. The method includes sending the deduplication information to the storage system for use in a deduplication process by the storage system and sending the encrypted data chunks to the storage system.

Abstract: Techniques for processing an access request and updating a storage system are provided. For instance, a method comprises: receiving an access request for an object associated with a storage system, the storage system including a plurality of physical nodes, each of the plurality of physical nodes including at least one set of virtual units, each set of virtual units including at least one virtual unit; determining, from a plurality of sets of virtual units included in the plurality of physical nodes of the storage system, a target set of virtual units associated with the object; and determining, from the target set of virtual units, a target virtual unit corresponding to the object. With the technical solution of the present disclosure, not only a set of virtual units on a physical node may be easily split and merged, but also huge computing resources that need to be allocated may be saved, so better user experience may be brought about at a lower cost.

Abstract: A two-step algorithm for conducting near real time fuzzy searches of a target on one or more large data sets is described, where the address and the geolocation are included in the match criteria. This algorithm includes the simplification of the data by removing grammatical constructs to bring the target search term (and the stored database) to their base elements and then perform a Levenshtein comparison to create a subset of the data set that may be a match. Location is determined by a geohash comparison of the latitude and longitude and a Levenshtein comparison of the address text. Then performing a scoring algorithm while comparing the target to the subset of the data set to identify any matches.

Abstract: An example apparatus for memory addressing can include an array of memory cells. The apparatus can include a memory cache configured to store at least a portion of an address mapping table. The address mapping table can include a number of regions corresponding to respective amounts of logical address space of the array. The address mapping table can map translation units (TUs) to physical locations in the array. Each one of the number of regions can include a first table. The first table can include entries corresponding to respective TU logical address of the respective amounts of logical address space, respective pointers, and respective offsets. Each one of the number of regions can include a second table. The second table can include entries corresponding to respective physical address ranges of the array. The entries of the second table can include respective physical address fields and corresponding respective count fields.

Abstract: An example system may provide for plurality of object block stores and a store management system. The store management system is configured to access a first bucket including a first storage class bucket tag identified by a first key-value pair corresponding to a first one of the plurality of object block stores with a first storage class. The store management system is further configured to write a first data object to the first one of the plurality of object block stores with a first storage class. The first one of the plurality of object block stores is represented by the first bucket. The first one of the plurality of object block stores is configured to store the first data object according to the first storage class specified by the first storage class bucket tag.

Abstract: A set of dependence relationships in a set of program instructions is detected by a processor. The set of dependence relationships comprises a first load instruction to load a first data object and a second load instruction to load a second data object from a second address that is provided by address data within the first data object. The processor identifies a number of dependence instances in the set of dependence relationships and determines that the number is over a pattern threshold. The processor sends an enhanced load request to a memory controller. The enhanced load request comprises instructions to load the first data object from a first address on a physical page, locate address data in the first data object based on a memory offset, load the second data object from a second address in the address data, and transmit the first and second data objects to the processor.

Abstract: The present teaching relates to a method, system and programming for searching a data storage. A key is extracted from a request and a metadata object associated with the key is identified. Further, a determination is made as to whether the metadata object is associated with a data structure stored in a first portion of the data storage. In response to a successful determination, the data structure is searched to retrieve a value associated with the key from the first portion. In response to an unsuccessful determination, a cache is searched to retrieve the value associated with the key, and in response to the key being absent in the cache, a file associated with the metadata object is searched to retrieve the value associated with the key, wherein the file is stored in a second portion of the data storage.

Abstract: Techniques are described herein for a vectorized hash table that uses very efficient grow and insert techniques. A single-probe hash table is grown via vectorized instructions that split each bucket, of the hash table, into a respective upper and lower bucket of the expanded hash table. Further, vacant slots are indicated using a vacant-slot-indicator value, e.g., ‘0’, and all vacant slots follow to the right of all occupied slots in a bucket. A vectorized compare instruction determines whether a value is already in the bucket. If not, the vectorized compare instruction is also used to determine whether the bucket has a vacant slot based on whether the bucket contains the vacant-slot-indicator value. To insert the value into the bucket, vectorized instructions are used to shift the values in the bucket to the right by one slot and to insert the new value into the left-most slot.

Abstract: Disclosed herein are systems and method for building content for a de-duplication engine. In one aspect, an exemplary method comprises periodically receiving instructions for cycling through a coalescing phase and a sedimentation phase of the de-duplication engine, during a first coalescing phase, selecting a set of seed blocks that are similar to each other, when an instruction for proceeding to a next sedimentation phase is received, entering the sedimentation phase during which newly received blocks are processed to be stored near similar seed blocks, and when an instruction to proceed to a next coalescing phase is received, entering the coalescing phase to update the set of seed blocks.

Abstract: A method for storing a key-value pair can include dividing the key-value pair into a first data record and a second data record. The first data record can include a key associated with the key-value pair. The second data record can include a portion of a value associated with the key-value pair. The second data record can be stored in a secondary data store based on a size of the second data record exceeding a threshold value. The first data record can be stored in an in-memory key-value store based on a size of the first data record not exceeding the threshold value. The first data record can include a reference to the second data record in the secondary data store. A query requiring the key-value pair can be executed by retrieving the first data record from the in-memory key-value store. Related systems and articles of manufacture are also provided.

Abstract: A hybrid mechanism for operating on a data item in connection with an associative structure combines first-fit and K-choice. The hybrid mechanism leverages advantages of both approaches by choosing whether to insert, retrieve, delete, or modify a data item using either first-fit or K-choice. Based on the data item, a function of the data item, and/or other factors such as the load statistics of the associative structure, one of either first-fit or K-choice is used to improve operation on the associative structure across a variety of different load states of the associative structure.

Abstract: A storage system which stores a plurality of volumes and performs an I/O process on the volume includes a processor. The volume includes a first volume and a second volume which is copied from the first volume by snapshot. In a case where a write request is received, the processor determines whether a volume of a copy source related to a target volume of the write request is a volume of which a storage region is a valid region where a data amount reduction process is applied. Depending on a case where the volume of the copy source is a volume of which the storage region is a valid region or a case where the volume of the copy source is a volume of which the storage region is not a valid region, the processor switches and performs a process of creating the second volume related to the snapshot.

Abstract: Verification system and methods are provided for allowing database server responses to be verified. A proxy device may maintain a data structure (e.g., a Merkle B+-tree) within a secure memory space (e.g., an Intel SGX enclave) associated with a protected application. In some embodiments, the data structure may comprise hashed values representing hashed versions of the data managed by the database server. The proxy may intercept client requests submitted from a client device and forward such requests to the database server. Responses from the database server may be verified using the data structure (e.g., the hashes contained in the Merkle B+-tree). If the data is verified by the proxy device, the response may be transmitted to the client device.

Abstract: A data storage device is provided. The data storage device a buffer configured to store a mapping table comprising physical block addresses (PBAs) corresponding to logical block addresses (LBAs), a non-volatile memory configured to store data; and a controller configured to control the buffer and the non-volatile. The controller is configured to read data stored at a first PBA of the non-volatile memory corresponding to a first LBA by referring to the mapping table when receiving a command to read data corresponding to the first LBA from outside of the data storage device, and, when a second LBA included in the data read from the non-volatile memory is different from the first LBA, retry reading, from the non-volatile memory, the data corresponding to the first LBA.

Abstract: Methods, apparatus and computer program products implement embodiments of the present invention that include selecting an archive storing one or more archived files. Respective locations are identified for each of the one or more archived files, the respective locations are stored to a memory, and using the respective locations in the memory, a corresponding accessible file is defined for each of the one or more archived files. Upon receiving a request to access a given accessible file, a given location in the archive for the given archived file is identified, and the given accessible file can be accessed at the given location. In embodiments where the given accessible file consists of a data file, the given accessible file is accessed by reading data from the data file. In embodiments where the given accessible file consists of an executable file, the given accessible file is accessed by executing the executable file.

Abstract: An aspect of implementing a Cuckoo tree includes providing a Cuckoo filter table for performing lookups in a Cuckoo tree. The table tracks fingerprints of keys and tablets in which the keys reside. An aspect also includes providing a stash configured to manage duplicate keys in the tree. The stash includes: a key hash table that stores full keys corresponding bucket index references that point to a reverse time ordered list of values corresponding to the full keys; and a value store having buckets with slots for storing the list. An aspect further includes setting a duplicate threshold value in the tree that provides a limit on a number of fingerprints that can exist in a bucket. During a store operation on a key, upon determining the number of existing entries with same fingerprint in target bucket would exceed the threshold, another bucket is selected for the key.

Abstract: Described is using flash memory (or other secondary storage), RAM-based data structures and mechanisms to access key-value pairs stored in the flash memory using only a low RAM space footprint. A mapping (e.g. hash) function maps key-value pairs to a slot in a RAM-based index. The slot includes a pointer that points to a bucket of records on flash memory that each had keys that mapped to the slot. The bucket of records is arranged as a linear-chained linked list, e.g., with pointers from the most-recently written record to the earliest written record. Also described are compacting non-contiguous records of a bucket onto a single flash page, and garbage collection. Still further described is load balancing to reduce variation in bucket sizes, using a bloom filter per slot to avoid unnecessary searching, and splitting a slot into sub-slots.

Abstract: A method for parallel maintenance of data consistency includes: 1) a node broadcasts requests to other nodes in a network, request a synchronization data block of current synchronization cycle, and calculates a synchronization anchor of this synchronization cycle; 2) for node i requiring data feeding, writing the synchronization anchor of the current synchronization cycle in data block A0, and to produce an array [A]N based on the requirement; data block A0 is the provision that is be added into consistency data in the current synchronization cycle; 3) each node builds its own array [A]N in parallel and broadcasts the array; and 4) the node filters all received arrays of [A]N by the synchronization anchor of array, discards invalid data, and thereafter builds the synchronization data block for the next synchronization cycle.

Abstract: The present disclosure relates to a method for tamper-proof storage of data of a field device operated by means of automation technology, wherein the field device comprises a sensor and/or actuator and an electronic unit, the field device generating data. The method comprises steps of creating at least one transaction containing generated data of the field device and storing the transaction in a data block of Blockchain technology comprising a data field containing stored transactions and a hash value. The method also includes steps of linking the data block to previously created data blocks, storing the data block in a service platform and creating and storing a security data block in the service platform.

Abstract: A data processing method is disclosed, and the method includes: encoding a data chunk of a predetermined size, to generate an error-correcting data chunk corresponding to the data chunk, where the data chunk includes a data object, and the data object includes a key, a value, and metadata; and generating a data chunk index and a data object index, where the data chunk index is used to retrieve the data chunk and the error-correcting data chunk corresponding to the data chunk, the data object index is used to retrieve the data object in the data chunk, and each data object index is used to retrieve a unique data object.

Abstract: A data health monitoring system and method are provided which may be configured to monitor different indicators of a computing device which may affect the health of data, looking for early warning signs that could indicate future data loss or corruption. The system may periodically query certain data health indicators, such as S.M.A.R.T. status, disk temperature, read and write errors, etc. The system may also monitor data as it is being accessed keeping track of other indicators such as: files that are modified, when the last backed up was, protection status of the file, type of changes made to the file, which application is making changes, etc. Preferably, the combined status of each data health indicator may be rolled up into a simple message and shown to the user via notifications, reports, logs or a user interface.

Abstract: Some embodiments provide a non-transitory machine-readable medium that stores a program. The program receives a request for a map visualization that includes a plurality of geo-enriched data and geographical elements associated with a level of a plurality of levels in a hierarchy of geographical elements. The program further identifies a set of geographical elements associated with the level based on the hierarchy of geographical elements. The program also generates the map visualization to include the plurality of geo-enriched data and the set of geographical elements.

Abstract: An apparatus includes an address bus configured to convey a command address; a primary address latch connected to the address bus and configured to latch a first address; a primary counter connected to the primary address latch and configured to track a primary count value when the command address matches the first address; and a secondary counter connected to the primary counter and configured to update a secondary count value when the primary count value reaches a primary threshold.

Abstract: Optimistic concurrency is effectuated to manage constraints in a synchronization environment at multiple computing device endpoints in a consistent fashion without utilizing concentrated centralized constraint logic. Implemented data synchronization constraints that identify false violation scenarios may be automatically resolved without user intervention by using an etag system directed by a master component to assist computing device endpoints to maintain data synchronization among them. Data entries defining each file hierarchy component to be synched are generated and shared with the master component and each computing device endpoint in a synchronization environment. Individual computing device endpoints can use the data entries generated locally with those generated by other computing device endpoints to locally resolve identified false violation scenarios.

Abstract: A hierarchical dictionary having methods of storing words based on frequency thereof in one or more documents which includes the steps of identifying a hash value corresponding to an inputted word; storing the word in a first hash map and in a second hash map having a substantially larger word storage capacity than the first hash map based on the identified hash value; clearing the first hash map at every predetermined period or triggering event; determining whether a frequency of the word as stored in the second hash map exceeds a predetermined value; and if so, promoting the word from the second hash map to a third hash map having a substantially larger word storage capacity than the second hash map for long-term storage and later retrieval.

Abstract: A storage device includes a controller that receives a value corresponding to data stored in a memory and a key to be referenced to identify the value from a host. In addition, the controller manages partial key-value mapping information indicating a correspondence relationship between a partial key and a value address, and returns information to the host in response to a host request. The information corresponds to a key that includes a same character as a character at a specific position of the received key. The controller to determine the information by determining a partial region of the memory that stores the data based on the partial key-value mapping information and performing a read operation on the partial region to obtain an entire key including the partial key.

Abstract: A storage system in one embodiment is configured to participate as a source storage system in a synchronous replication process with a target storage system. In verifying synchronously replicated data, the source storage system generates a current snapshot for one or more storage volumes subject to synchronous replication to the target storage system, identifies a plurality of pages of the current snapshot that have changed since generation of a previous snapshot for the one or more storage volumes, obtains content-based signatures for respective ones of the changed pages, assigns the changed pages to a page group, generates a group signature for the page group based at least in part on the content-based signatures of the pages of the page group, and sends the group signature to the target storage system. The group signature is configured to allow the target storage system to determine if the page group contains at least one page that is inconsistent between the source and target storage systems.

Abstract: A read operation to retrieve data from memory component and that bypasses a prior search for the data at a buffer in a read data path associated with the read operation can be performed. Responsive to performing the read operation that bypasses the prior search for the data at the buffer, the data is returned to a host system.

Abstract: A memory device includes: a conductive layer coupled to a reference voltage level; a first storage portion vertically coupled to a first surface of the conductive layer; and a second storage portion vertically coupled to a second surface of the conductive layer; wherein the second surface is opposite to the first surface.

Abstract: According to one embodiment, a data processing device is provided. The request interpreter receives a read request with a specified key and interprets the read request. The first accessor identifies a key that has a positional relation with the specified key in a manner specified by the read request, in an order key string in which a plurality of keys are stored in order under a predetermined rule. The second accessor is implemented by the computer to acquire a second address corresponding to a first address based on a hash value of the key identified by the first accessor from management data associating the first address and the second address each other. The third accessor is implemented by the computer to read out data associated with the second address acquired by the second accessor from among pieces of data respectively associated with a plurality of the second addresses.

Abstract: According to embodiments of the present invention, methods, systems and computer-readable media are presented for processing a database query. The query may specify an arrangement for resulting data. A digest is generated for each of a plurality of database object elements. The plurality of database object elements are grouped or mapped into one or more groups based on the digest to arrange the database object elements in digest order. The database object elements from the one or more groups are extracted and/or processed in order of the digest, in accordance with the specified arrangement.

Abstract: A given policy file is obtained at a publishing node of a decentralized system of nodes, wherein the given policy file defines a policy that applies to at least a subset of nodes in the decentralized system of nodes. The given policy file is sent to a decentralized storage network for storage therein. Storage metadata is received from the decentralized storage network, wherein the storage metadata represents address information associated with storage of the given policy file in the decentralized storage network. The publishing node generates policy file retrieval metadata based on the storage metadata received from the decentralized storage system. The policy file retrieval metadata is sent to a blockchain network for storage therein. One or more querying nodes of the decentralized system of nodes access the blockchain network to obtain the policy file retrieval metadata in order to then retrieve the policy file from the decentralized storage network.