<?xml version="1.0" encoding="UTF-8"?>

<rdf:RDF
   xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
   xmlns:rdfs="http://www.w3.org/2000/01/rdf-schema#"
   xmlns="http://purl.org/rss/1.0/"
   xmlns:dc="http://purl.org/dc/elements/1.1/"
   xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/"
   xmlns:dcterms="http://purl.org/dc/terms/"

>
<channel rdf:about="http://www.citeulike.org/about">
<pubDate>Thu, 21 Aug 2008 15:34:25 BST</pubDate>


	<title>CiteULike: bigbossman's database</title>
	<description>CiteULike: bigbossman's database</description>


	<link>http://www.citeulike.org/user/bigbossman/tag/database</link>
	<dc:publisher>CiteULike.org</dc:publisher>
	<dc:language>en-gb</dc:language>
	<dc:rights>Copyright &#169; 2004-2008 citeulike.org</dc:rights>
	<items>
    <rdf:Seq>
        <rdf:li rdf:resource="http://www.citeulike.org/user/bigbossman/article/2544253"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/bigbossman/article/2427291"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/bigbossman/article/1580198"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/bigbossman/article/1401851"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/bigbossman/article/226627"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/bigbossman/article/1134213"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/bigbossman/article/1115107"/>

	</rdf:Seq>
	</items>
	</channel>


<item rdf:about="http://www.citeulike.org/user/bigbossman/article/2544253">
    <title>GraphStream: A Tool for bridging the gap between Complex Systems and Dynamic Graphs</title>
    <link>http://www.citeulike.org/user/bigbossman/article/2544253</link>
    <description>&lt;i&gt;(14 Mar 2008)&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;The notion of complex systems is common to many domains, from Biology to Economy, Computer Science, Physics, etc. Often, these systems are made of sets of entities moving in an evolving environment. One of their major characteristics is the emergence of some global properties stemmed from local interactions between the entities themselves and between the entities and the environment. The structure of these systems as sets of interacting entities leads researchers to model them as graphs. However, their understanding requires most often to consider the dynamics of their evolution. It is indeed not relevant to study some properties out of any temporal consideration. Thus, dynamic graphs seem to be a very suitable model for investigating the emergence and the conservation of some properties. GraphStream is a Java-based library whose main purpose is to help researchers and developers in their daily tasks of dynamic problem modeling and of classical graph management tasks: creation, processing, display, etc. It may also be used, and is indeed already used, for teaching purpose. GraphStream relies on an event-based engine allowing several event sources. Events may be included in the core of the application, read from a file or received from an event handler.</description>
    <dc:title>GraphStream: A Tool for bridging the gap between Complex Systems and Dynamic Graphs</dc:title>

    <dc:creator>Yoann Pign&#38;#xe9;</dc:creator>
    <dc:creator>Antoine Dutot</dc:creator>
    <dc:creator>Fr&#38;#xe9;d&#38;#xe9;ric Guinand</dc:creator>
    <dc:creator>Damien Olivier</dc:creator>
    <dc:source>(14 Mar 2008)</dc:source>
    <dc:date>2008-03-17T04:46:56-00:00</dc:date>
    <prism:publicationYear>2008</prism:publicationYear>
    <prism:category>database</prism:category>
    <prism:category>graph</prism:category>
    <prism:category>language</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/bigbossman/article/2427291">
    <title>Survey of graph database models</title>
    <link>http://www.citeulike.org/user/bigbossman/article/2427291</link>
    <description>&lt;i&gt;ACM Comput. Surv., Vol. 40, No. 1. (February 2008), pp. 1-39.&lt;/i&gt;</description>
    <dc:title>Survey of graph database models</dc:title>

    <dc:creator>Renzo Angles</dc:creator>
    <dc:creator>Claudio Gutierrez</dc:creator>
    <dc:identifier>doi:10.1145/1322432.1322433</dc:identifier>
    <dc:source>ACM Comput. Surv., Vol. 40, No. 1. (February 2008), pp. 1-39.</dc:source>
    <dc:date>2008-02-25T22:23:48-00:00</dc:date>
    <prism:publicationYear>2008</prism:publicationYear>
    <prism:publicationName>ACM Comput. Surv.</prism:publicationName>
    <prism:issn>0360-0300</prism:issn>
    <prism:volume>40</prism:volume>
    <prism:number>1</prism:number>
    <prism:startingPage>1</prism:startingPage>
    <prism:endingPage>39</prism:endingPage>
    <prism:publisher>ACM</prism:publisher>
    <prism:category>database</prism:category>
    <prism:category>graph</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/bigbossman/article/1580198">
    <title>Correlation search in graph databases</title>
    <link>http://www.citeulike.org/user/bigbossman/article/1580198</link>
    <description>&lt;i&gt;(2007), pp. 390-399.&lt;/i&gt;</description>
    <dc:title>Correlation search in graph databases</dc:title>

    <dc:creator>Yiping Ke</dc:creator>
    <dc:creator>James Cheng</dc:creator>
    <dc:creator>Wilfred Ng</dc:creator>
    <dc:identifier>doi:10.1145/1281192.1281236</dc:identifier>
    <dc:source>(2007), pp. 390-399.</dc:source>
    <dc:date>2007-08-21T13:19:17-00:00</dc:date>
    <prism:publicationYear>2007</prism:publicationYear>
    <prism:startingPage>390</prism:startingPage>
    <prism:endingPage>399</prism:endingPage>
    <prism:publisher>ACM Press</prism:publisher>
    <prism:category>correlation</prism:category>
    <prism:category>database</prism:category>
    <prism:category>graph</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/bigbossman/article/1401851">
    <title>Out-of-core coherent closed quasi-clique mining from large dense graph databases</title>
    <link>http://www.citeulike.org/user/bigbossman/article/1401851</link>
    <description>&lt;i&gt;ACM Trans. Database Syst., Vol. 32, No. 2. (June 2007)&lt;/i&gt;</description>
    <dc:title>Out-of-core coherent closed quasi-clique mining from large dense graph databases</dc:title>

    <dc:creator>Zhiping Zeng</dc:creator>
    <dc:creator>Jianyong Wang</dc:creator>
    <dc:creator>Lizhu Zhou</dc:creator>
    <dc:creator>George Karypis</dc:creator>
    <dc:identifier>doi:10.1145/1242524.1242530</dc:identifier>
    <dc:source>ACM Trans. Database Syst., Vol. 32, No. 2. (June 2007)</dc:source>
    <dc:date>2007-06-21T03:53:04-00:00</dc:date>
    <prism:publicationYear>2007</prism:publicationYear>
    <prism:publicationName>ACM Trans. Database Syst.</prism:publicationName>
    <prism:issn>0362-5915</prism:issn>
    <prism:volume>32</prism:volume>
    <prism:number>2</prism:number>
    <prism:publisher>ACM Press</prism:publisher>
    <prism:category>clique</prism:category>
    <prism:category>database</prism:category>
    <prism:category>graph</prism:category>
    <prism:category>mining</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/bigbossman/article/226627">
    <title>DIP: the database of interacting proteins.</title>
    <link>http://www.citeulike.org/user/bigbossman/article/226627</link>
    <description>&lt;i&gt;Nucleic Acids Res, Vol. 28, No. 1. (1 January 2000), pp. 289-291.&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;The Database of Interacting Proteins (DIP; http://dip.doe-mbi.ucla.edu) is a database that documents experimentally determined protein-protein interactions. This database is intended to provide the scientific community with a comprehensive and integrated tool for browsing and efficiently extracting information about protein interactions and interaction networks in biological processes. Beyond cataloging details of protein-protein interactions, the DIP is useful for understanding protein function and protein-protein relationships, studying the properties of networks of interacting proteins, benchmarking predictions of protein-protein interactions, and studying the evolution of protein-protein interactions.</description>
    <dc:title>DIP: the database of interacting proteins.</dc:title>

    <dc:creator>I Xenarios</dc:creator>
    <dc:creator>DW Rice</dc:creator>
    <dc:creator>L Salwinski</dc:creator>
    <dc:creator>MK Baron</dc:creator>
    <dc:creator>EM Marcotte</dc:creator>
    <dc:creator>D Eisenberg</dc:creator>
    <dc:source>Nucleic Acids Res, Vol. 28, No. 1. (1 January 2000), pp. 289-291.</dc:source>
    <dc:date>2005-06-12T22:26:34-00:00</dc:date>
    <prism:publicationYear>2000</prism:publicationYear>
    <prism:publicationName>Nucleic Acids Res</prism:publicationName>
    <prism:issn>0305-1048</prism:issn>
    <prism:volume>28</prism:volume>
    <prism:number>1</prism:number>
    <prism:startingPage>289</prism:startingPage>
    <prism:endingPage>291</prism:endingPage>
    <prism:category>database</prism:category>
    <prism:category>dip</prism:category>
    <prism:category>proteins</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/bigbossman/article/1134213">
    <title>Generalized Search Trees for Database Systems</title>
    <link>http://www.citeulike.org/user/bigbossman/article/1134213</link>
    <description>&lt;i&gt;(1995), pp. 562-573.&lt;/i&gt;</description>
    <dc:title>Generalized Search Trees for Database Systems</dc:title>

    <dc:creator>Joseph Hellerstein</dc:creator>
    <dc:creator>Jeffrey Naughton</dc:creator>
    <dc:creator>Avi Pfeffer</dc:creator>
    <dc:source>(1995), pp. 562-573.</dc:source>
    <dc:date>2007-03-01T20:25:18-00:00</dc:date>
    <prism:publicationYear>1995</prism:publicationYear>
    <prism:startingPage>562</prism:startingPage>
    <prism:endingPage>573</prism:endingPage>
    <prism:publisher>Morgan Kaufmann Publishers Inc.</prism:publisher>
    <prism:category>database</prism:category>
    <prism:category>gist</prism:category>
    <prism:category>index</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/bigbossman/article/1115107">
    <title>Computational Database Structures</title>
    <link>http://www.citeulike.org/user/bigbossman/article/1115107</link>
    <description>&lt;i&gt;(2006)&lt;/i&gt;</description>
    <dc:title>Computational Database Structures</dc:title>

    <dc:creator>Hung-Chih Yang</dc:creator>
    <dc:source>(2006)</dc:source>
    <dc:date>2007-02-20T21:18:29-00:00</dc:date>
    <prism:publicationYear>2006</prism:publicationYear>
    <prism:category>computational</prism:category>
    <prism:category>database</prism:category>
</item>



</rdf:RDF>

