<?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-18T19:38:25Z</responseDate>
  <request identifier="oai:www.ideals.illinois.edu:2142/81857" metadataPrefix="etdms" verb="GetRecord">https://www.ideals.illinois.edu/oai-pmh</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:www.ideals.illinois.edu:2142/81857</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>Han, Jiawei</dc:contributor>
          <dc:creator>Chen, Chen</dc:creator>
          <dc:date>2015-09-25T20:20:43Z</dc:date>
          <dc:date>2015-09-25T20:20:43Z</dc:date>
          <dc:date>10000-01-01</dc:date>
          <dc:date>2009</dc:date>
          <dc:date>2009</dc:date>
          <dc:description>In conclusion, the multi-dimensional analysis framework could lead to intuitive and insightful knowledge discovery on graphs, especially when the data is large and complex. Given the emerging trend of huge information networks as listed above, it is an important research topic to devote more efforts to. We point out a few possible future works, especially discovery-driven Graph OLAP. We believe that this is an interesting direction to go, and give our initial thoughts on it.</dc:description>
          <dc:description>Made available in DSpace on 2015-09-25T20:20:43Z (GMT). No. of bitstreams: 2
license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5)
3391903.pdf: 1358113 bytes, checksum: 49a13671f1affc44839a043a4721a883 (MD5)
  Previous issue date: 2009</dc:description>
          <dc:description>Embargo set by: Seth Robbins for item 83138
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>87 p.</dc:description>
          <dc:description>Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2009.</dc:description>
          <dc:identifier>http://hdl.handle.net/2142/81857</dc:identifier>
          <dc:identifier>(MiAaPQ)AAI3391903</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:subject>Computer Science</dc:subject>
          <dc:title>Multi-Dimensional Analysis of Graph Data</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>
