Parasitic databases: an investigation

  • Authors:
  • Svetlin Tzolov;Dianne Bills

  • Affiliations:
  • Rochester Institute of technology, Rochester, USA;Rochester Institute of Technology, Rochester, USA

  • Venue:
  • Proceedings of the 2011 conference on Information technology education
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

A parasitic database combines the fundamental principles of parasitic storage with those of database theory to create a distributed data storage strategy that provides basic database functionality in a design intended to maintain high data security. This approach is inspired by parasitic network storage in which information is stored across many machines, usually unbeknownst to their owners, in network traffic using a communication protocol such as Internet Control Message Protocol (ICMP) or Simple Mail Transfer Protocol (SMTP). The basis for parasitic data storage is that user data is "stored" by being continually transferred between various network nodes. For this investigation, a XML database design is used rather than the traditional RDMBS approach because the structure of XML is more suited to this kind of deployment. Data is "stored" in database data packets across multiple network nodes by splitting and distributing it in the "Data" fields of ICMP packets. To be successful, various issues need to be addressed, including: the implementation of traditional database DDL and DML functionality; maintaining data integrity and providing ACID; calculating and handling sufficient network redundancy; and the implementation of security features, such as encryption and the use of salt, to prevent the data from being viewed by unauthorized parties.