umich-dbgroup.github.io/project/timber/introduction.html at master · umich-dbgroup/umich-dbgroup.github.io · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
<html>
<head>
<title>TIMBER</title>
<meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
</head>

<body bgcolor="#FFFFFF">
<table width="600" border="0" cellspacing="0" cellpadding="10" align="center" bordercolorlight="#FFFFFF" bordercolordark="#CCFFFF">
  <tr align="center" valign="bottom" bgcolor="#6666FF">
    <td colspan="2" height="100"><img src="timber2.gif" width="477" height="128">
    </td>
  </tr>
  <tr>
    <td width="100" valign="top" bgcolor="#CCFFCC">
      <p>&nbsp;</p>
      <p><a href="introduction.html">Introduction</a></p>
      <p><a href="overview.html">Overview</a></p>
      <p><a href="support.html">Support</a></p>
      <p><a href="people.html">People</a></p>
      <p><a href="publications.html">Publications</a></p>
      <p><a href="http://dbgroup-internal.eecs.umich.edu/timber/download.php">Download</a></p>
      <p><a href="usermanual/index.htm">User manual</a></p>
      <p><a href="bug.php">Report bugs</a></p>
      <p><a href="links.html">Useful links</a></p>
      </td>
    <td bgcolor="#CCCCFF" valign="top" align="left" width="454">
      <h2>Introduction</h2>
      <p>XML has become ubiquitous, and XML data has to be managed in databases.
        The current industry standard is to map XML data into relational tables
        and store this information in a relational database. Such mappings create
        both expressive power problems (such as requiring transitive closure computations
        to compute ancestor-descendant relationships) and performance problems
        (for instance to reconstruct XML for output). </p>
      <p>In the TIMBER project we are exploring the issues involved in storing
        XML in native format. We recognize XML documents to be trees, and build
        a system to manipulate collections of trees. In doing so, we attempt to
        avoid the pitfall of "instance-at-a-time" navigational access. Rather,
        we attempt to bring to bear the core ideas of database technology, such
        as declarative querying, a bulk algebra, and cost-based query optimization.
      </p>
      <p>The name TIMBER is actually an acronym for: <b><font size="+1"> T</font></b>ree-structured
        native XML database<b> <font size="+1">I</font></b>mplemented at the University
        of <b><font size="+1">M</font></b>ichigan by <b><font size="+1">B</font></b>right
        :-) <b><font size="+1">E</font></b>nergetic <b><font size="+1">R</font></b>esearchers
      </p>
      <p>
        <img src="new.gif" /><font color="red">more than 1000 downloads across 5 continents! (and counting...)</font>
      </p>
      <hr>
      <p align="right"><img src="email.gif" /><i><font size="2"><br>Page last modified on 09/May/06</font></i></p>
      </td>
  </tr>
</table>
</body>
</html>