<?xml version="1.0" encoding="UTF-8"?>
<?xml-stylesheet type="text/xsl" href="/oai-pmh.xsl"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
  <responseDate>2026-09-23T15:35:38Z</responseDate>
  <request identifier="oai:www.ideals.illinois.edu:2142/81851" metadataPrefix="etdms" verb="GetRecord">https://www.ideals.illinois.edu/oai-pmh</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:www.ideals.illinois.edu:2142/81851</identifier>
        <datestamp>2023-07-11</datestamp>
        <setSpec>col_2142_5131</setSpec>
        <setSpec>col_2142_10761</setSpec>
        <setSpec>com_2142_5130</setSpec>
        <setSpec>com_2142_10755</setSpec>
        <setSpec>com_2142_234</setSpec>
      </header>
      <metadata>
        <thesis xmlns="http://www.ndltd.org/standards/metadata/etdms/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:dc="http://purl.org/dc/elements/1.1/" xsi:schemaLocation="http://www.ndltd.org/standards/metadata/etdms/1.1/ http://www.ndltd.org/standards/metadata/etdms/1.1/etdms11.xsd http://purl.org/dc/elements/1.1/ http://www.ndltd.org/standards/metadata/etdms/1.1/etdmsdc.xsd">
          <dc:contributor>Winslett, Marianne</dc:contributor>
          <dc:creator>Mitra, Soumyadeb</dc:creator>
          <dc:date>2015-09-25T20:20:41Z</dc:date>
          <dc:date>2015-09-25T20:20:41Z</dc:date>
          <dc:date>10000-01-01</dc:date>
          <dc:date>2008</dc:date>
          <dc:date>2008</dc:date>
          <dc:description>This dissertation shows that it is possible to greatly improve the assurances offered by current approaches to providing tamper resistance for records on WORM storage, without significantly increasing their cost. We propose and evaluate tamperproof and tamper-resistant approaches to searching and indexing documents, migrating documents between WORM storage servers, and destroying documents and the information related to them at the end of their retention periods. We also propose and evaluate effective ways to partition arriving documents across a hierarchy of storage devices, even without knowledge of their future query workload. In addition, we show how to provide tamper resistance for the data stored in relational databases at very modest cost.</dc:description>
          <dc:description>Made available in DSpace on 2015-09-25T20:20:41Z (GMT). No. of bitstreams: 2
license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5)
3347456.pdf: 13582144 bytes, checksum: 5af76c6dc1e2cccb9d60723a6b8cb049 (MD5)
  Previous issue date: 2008</dc:description>
          <dc:description>Embargo set by: Seth Robbins for item 83132
Lift date: Forever
Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs</dc:description>
          <dc:description>Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs</dc:description>
          <dc:description>U of I Only</dc:description>
          <dc:description>275 p.</dc:description>
          <dc:description>Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2008.</dc:description>
          <dc:identifier>http://hdl.handle.net/2142/81851</dc:identifier>
          <dc:identifier>(MiAaPQ)AAI3347456</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:subject>Computer Science</dc:subject>
          <dc:title>Trustworthy and Cost Effective Management of Compliance Records</dc:title>
          <dc:type>text</dc:type>
          <degree>
            <department>Computer Science</department>
            <discipline>Computer Science</discipline>
            <grantor>University of Illinois at Urbana-Champaign</grantor>
            <level>Dissertation</level>
            <name>Ph.D.</name>
          </degree>
        </thesis>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
