AllegroGraph is a graph database and semantic web application framework. It stores data in triples that describe resources and relationships. AllegroGraph provides high performance, scalability, and supports standards like RDF, RDFS, and SPARQL. It offers features like ACID transactions, read/write concurrency, dynamic indexing, and resource management. AllegroGraph has been used in commercial and open source projects including social networking, logistics, and network analysis applications.

1. B.V.V Sangha’s
BASAVESHWAR ENGINEERING COLLEGE(Autonomous)
BAGALKOT-587103
Department of Computer Science and Engineering
TUTORIALASSIGNMENT – 4
“Seminar on NOSQL AllegroGraph Database”
Submitted by: Submitted to:
Shweta Policepatil Dr. S M Hatture
M.Tech 1st Sem CSE Course-Coordinator
Roll No:09

2. Contents
Overview
Introduction
Features
Advantages
Disadvantages
Applications
Recent Projects
Comparison Of Graph Databases
Conclusion

3. Overview
AllegroGraph is a database and application
framework for building Semantic Web
applications. It includes support for Federation,
Social Network Analysis, Geospatial capabilities
and Temporal reasoning.
Software genre: Graph database.
Protocols used: Resource Description
Framework.
Developer: Franz Incl.

4. Introduction
 Allegrograph is a framework to develop
semantic web applications.
- Semantic web technology aim to build websites.
- Sufficient self describing data.
It is a high performance Graph Database.
Store data and metadata in triple format.
Provides various query APIs to perform query
triples.
AllegroGraph actually stores quints.

5. Figure 1.Logical Structure of an AllegroGraph triple store
- A triple in AllegroGraph contains 5 slots, the first three being subject (s),
predicate (p), and object (o).
- The remaining two are a named-graph slot (g) and a unique id assigned by
Allegro Graph.
- The id slot is used for internal administrative purposes, but can also be
referred to by other triples directly.

6. Features
ACID transactions and Recoverability
 Read/Write concurrency
-100% read concurrency at all times.
 Dynamic and automatic indexing
- With column based compression.
 Resource management
- Use all disks, all memory all processors(one
box).
- Automatic or user configurable.

7. Advantages
Scalable and persistent quad store.
 Federated
Compliant with standards
- RDF, RDFS, OWL, SPARQL, Named
Graphs, ISO Prolog, OWL-lite reasoning.
“Minutes to Milliseconds” performance.
 Drastically-accelerated development cycles.

8. Disadvantages
Does not support for portability.
Sharding ( lots of people working on this)
- Scales UP reasonably well
Requires rewiring your brain.
Very easy to describe data inconsistency.
Can be conceptually difficult to understand at
very first look.

9. Applications
Route finding (going from point A to point B)
Logistics Authorization and Access Control
Network Impact Analysis
Network and IT Operations Management
Social Networking

10. Recent Projects
Allegrograph is used in many commercial,
Open Source, Defense projects as a data store.
Some of the significant ones are:-
- DBpedia Germany
- Genome Web
- Tweet logic

11. Comparison Of Graph Databases

12. Conclusion
Here at the end we conclude that we have
studied about the Allegrograph database.
AllegroGraph uses disk-based storage, enabling
it to scale to billions of triples while maintaining
high performance through indices. Advantages,
disadvantages of the Allegrograph database and
its application comparison of graph database.
Comparison shows that Nested graphs is not
supported by most of the graph database.

13. References
 http://www.franz.com/agraph/support/documentation/v4/java-tutorial/java-
tutorial-40.html
 http://tinman.cs.gsu.edu/~raj/8711/sp11/presentations/allegroGraphPresenta
tion.pdf
 https://franz.com/agraph/services/conferences_seminars/Franz_Webinar_6-
12-08.pdf
 http://www.iscb.org/archive/conferences/iscb/cms_addon/conferences/cshal
s2009/presentations/GudivadaCFeb09.pdf
 https://en.wikipedia.org/wiki/AllegroGraph
 http://aircconline.com/ijscai/V5N1/5116ijscai04.pdf

14. Thank You