Coursera Flash Sale
40% Off Coursera Plus for 3 Months!
Grab it
Explore a groundbreaking conference presentation that introduces a revolutionary DNA-based query processing system for efficiently retrieving partial information from RDF graph data without sequencing entire DNA libraries. Learn how this innovative approach addresses the critical challenge of massive data storage requirements in future analytics by leveraging DNA's exceptional longevity and storage density. Discover the limitations of existing DNA storage models that require complete data retrieval even for partial queries, making them expensive and impractical for complex graph data analytics. Understand how the proposed system uses binary search algorithms to fetch and decode significantly fewer DNA strands when running SPARQL queries on RDF graph data, achieving average data retrieval rates of less than 1% for graphs larger than 1 megabyte. Examine experimental analysis based on two datasets with eight graphs that demonstrates substantial cost reductions in sequencing operations compared to traditional full-data retrieval methods. Gain insights into the trade-offs between reduced sequencing costs and increased synthesis costs due to additional index structures and multiple sequencing runs. Presented by Asad Usmani from Goethe University Frankfurt am Main at the 2025 Storage and Computing with DNA Conference, this 11-minute presentation offers a comprehensive look at how DNA storage technology can be optimized for advanced data analytics applications in network biology and medicine domains.
