Revision b7a7f34f7355d7a6796ef8b4a85095ac5c744b77 authored by Dan LaRocque on 16 October 2013, 17:01:05 UTC, committed by Dan LaRocque on 16 October 2013, 17:01:05 UTC
1 parent 01f18ed
Raw File
NOTICE.txt
==============================================================
 Titan: Distributed Graph Database
 Copyright 2012 and onwards Aurelius
==============================================================

This product includes software developed by Aurelius (http://thinkaurelius.com/) and the following individuals:

 * Matthias Broecheler
 * Dan LaRocque
 * Marko A. Rodriguez
 * Stephen Mallette
 * Pavel Yaskevich

It also includes software from other open source projects including, but not limited to (check pom.xml for complete listing):

 * TinkerPop Blueprints [http://blueprints.tinkerpop.com]
 * TinkerPop Gremlin [http://gremlin.tinkerpop.com]
 * TinkerPop Rexster [http://rexster.tinkerpop.com]
 * TinkerPop Frames [http://frames.tinkerpop.com]
 * Apache Commons [http://commons.apache.org/]
 * Google Guava [http://code.google.com/p/guava-libraries/]
 * Cern Colt [http://acs.lbl.gov/software/colt/]
 * HPPC [http://labs.carrotsearch.com/hppc.html]
 * Junit Benchmark [http://labs.carrotsearch.com/junit-benchmarks.html]
 * Kryo [http://code.google.com/p/kryo/]
 * SLF4J [http://www.slf4j.org/]
 * Metrics [http://metrics.codahale.com/]
 * Apache log4j [http://logging.apache.org/log4j/]
 * Apache HBase [http://hbase.apache.org/]
 * Apache Hadoop [http://hadoop.apache.org/]
 * Apache Cassandra [http://cassandra.apache.org/]
 * Apache Lucene [http://lucene.apache.org/]
 * Elastic Search [http://www.elasticsearch.org/]
 * Astyanax [https://github.com/Netflix/astyanax]
 * JUnit [http://www.junit.org/]
 * Mockito [http://code.google.com/p/mockito/]
 * Persistit [https://github.com/pdbeaman/persistit]
 * Hazelcast [https://github.com/hazelcast/hazelcast]
 * Oracle's BerkeleyDB [http://www.oracle.com/technetwork/products/berkeleydb/] (see license below)


=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=
The following is the license that applies to this copy of the Berkeley
DB Java Edition software.  For a license to use the Berkeley DB Java
Edition software under conditions other than those described here, or
to purchase support for this software, please contact Oracle at
berkeleydb-info_us@oracle.com.

=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=
/*
 * Copyright (c) 2002, 2012 Oracle and/or its affiliates.  All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 * 1. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 * 2. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in the
 *    documentation and/or other materials provided with the distribution.
 * 3. Redistributions in any form must be accompanied by information on
 *    how to obtain complete source code for the DB software and any
 *    accompanying software that uses the DB software.  The source code
 *    must either be included in the distribution or be available for no
 *    more than the cost of distribution plus a nominal fee, and must be
 *    freely redistributable under reasonable conditions.  For an
 *    executable file, complete source code means the source code for all
 *    modules it contains.  It does not include source code for modules or
 *    files that typically accompany the major components of the operating
 *    system on which the executable file runs.
 *
 * THIS SOFTWARE IS PROVIDED BY ORACLE ``AS IS'' AND ANY EXPRESS OR
 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
 * WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, OR
 * NON-INFRINGEMENT, ARE DISCLAIMED.  IN NO EVENT SHALL ORACLE BE LIABLE
 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR
 * BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
 * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE
 * OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN
 * IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 */
=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=
/***
 * ASM: a very small and fast Java bytecode manipulation framework
 * Copyright (c) 2000-2005 INRIA, France Telecom
 * All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 * 1. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 * 2. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in the
 *    documentation and/or other materials provided with the distribution.
 * 3. Neither the name of the copyright holders nor the names of its
 *    contributors may be used to endorse or promote products derived from
 *    this software without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
 * THE POSSIBILITY OF SUCH DAMAGE.
 */
back to top