18571500. ENCODING OF DATA IN A HIERARCHICAL DATA STRUCTURE USING HASH TREES FOR INTEGRITY PROTECTION simplified abstract (KONINKLIJKE PHILIPS N.V.)
Contents
ENCODING OF DATA IN A HIERARCHICAL DATA STRUCTURE USING HASH TREES FOR INTEGRITY PROTECTION
Organization Name
Inventor(s)
Oscar Garcia Morchon of ENDHOBEN (NL)
Yee Him Cheung of Cambridge MA (US)
ENCODING OF DATA IN A HIERARCHICAL DATA STRUCTURE USING HASH TREES FOR INTEGRITY PROTECTION - A simplified explanation of the abstract
This abstract first appeared for US patent application 18571500 titled 'ENCODING OF DATA IN A HIERARCHICAL DATA STRUCTURE USING HASH TREES FOR INTEGRITY PROTECTION
The patent application is focused on a data structure that includes multiple blocks and part of a hash tree computed from hash values of genomic blocks. The part of the hash tree includes the first two highest levels but excludes lower levels.
- The data structure includes multiple blocks and part of a hash tree.
- The hash tree is computed from hash values of genomic blocks.
- Part of the hash tree includes the first two highest levels but excludes lower levels.
Potential Applications: This technology could be used in genomics research, data storage systems, and blockchain technology.
Problems Solved: This technology helps efficiently organize and store genomic data, improving data retrieval and analysis processes.
Benefits: Enhanced data organization, faster data retrieval, improved data analysis capabilities.
Commercial Applications: This technology could be valuable for companies in the biotech, healthcare, and data storage industries looking to optimize genomic data management and analysis processes.
Questions about the Technology: 1. How does this data structure improve genomic data storage and retrieval processes? 2. What are the potential implications of using this technology in blockchain systems?
Original Abstract Submitted
Some embodiments are directed to a data structure. The data structure includes multiple blocks and part of a first hash tree. The hash tree is computed from multiple hash values of the multiple genomic blocks. The part of the first hash tree includes at least the first two highest levels of the first hash tree but excluding one or more lower levels of the first hash tree.
