<?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-18T17:42:34Z</responseDate>
  <request identifier="oai:www.ideals.illinois.edu:2142/23800" metadataPrefix="etdms" verb="GetRecord">https://www.ideals.illinois.edu/oai-pmh</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:www.ideals.illinois.edu:2142/23800</identifier>
        <datestamp>2023-07-10</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>Kuck, S.</dc:contributor>
          <dc:creator>Pang, Youlun</dc:creator>
          <dc:date>2011-05-07T14:27:32Z</dc:date>
          <dc:date>2011-05-07T14:27:32Z</dc:date>
          <dc:date>10000-01-01</dc:date>
          <dc:date>1990</dc:date>
          <dc:description>We give formulas for estimating the number of disk accesses when accessing a file randomly with buffering. We present the layered hot set model which quantifies the locality of page references when executing a query using a DBMS. We presented the ABLE buffer management algorithms for DBMS's. We give cost models for both relational DBMS's and network DBMS's. We also give some of the results of our experiments for testing the performance of the ABLE buffer management algorithm and the accuracy of the cost model.</dc:description>
          <dc:description>Made available in DSpace on 2011-05-07T14:27:32Z (GMT). No. of bitstreams: 2
license.txt: 4922 bytes, checksum: 910b249b4beec47e7ab768910c8f966f (MD5)
9026291.pdf: 7275979 bytes, checksum: 695002ab131aa28f23e4ff09599603c3 (MD5)
  Previous issue date: 1990</dc:description>
          <dc:description>Item marked as restricted to the 'UIUC Users [automated]' Group (id=2) by Howard Ding (hding2@illinois.edu) on 2011-05-07T15:06:56Z
Item is restricted indefinitely.</dc:description>
          <dc:description>Restriction data tranferred 2014-07-01T11:32:10-05:00
Original Data
Group with Access UIUC Users [automated]
Release Date: none
Reason: ETDs are only available to UIUC Users without author permission</dc:description>
          <dc:description>ETDs are only available to UIUC Users without author permission</dc:description>
          <dc:description>U of I Only</dc:description>
          <dc:identifier>AAI9026291</dc:identifier>
          <dc:identifier>(UMI)AAI9026291</dc:identifier>
          <dc:identifier>http://hdl.handle.net/2142/23800</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:rights>Copyright 1990 Pang, Youlun</dc:rights>
          <dc:subject>Computer Science</dc:subject>
          <dc:title>Performance evaluation of database management systems</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>
