Introducing Stig

Architect of Scalable Infrastructure - Jason Lucas

Stig is…

• A very large-scale non-SQL database,– But it speaks SQL and can emulate many aspects of an SQL-based system.

• A graph-oriented data store,– But it can also look like a key-value store, a set of relational tables, or a file

system.

• A foundation for building general web applications,B t it ti l l l t i l– But it particularly excels at social apps.

• A general-purpose programming language in its own right,– But can be used from other languages like PHP, Perl, Java, and Python.

A di t ib t d t ith h d thi hit t• A distributed system with a shared-nothing architecture,– But offers developers a stable, consistent, easy-to-manage path to data.

• A solution to the complex problem of CAP-limited storage systems,– But it empowers the developer rather than burdening him.

Is Your Project…

G h h d? R ll h ?• Graph-shaped?– Representing graphs as graphs

(instead of as tables or key pairs) simplifies your life.

• Really huge?– The store scales very close to

linearly, so more data just means more machines.p y

– Stig graphs are fat, meaning they're really any number of simultaneous, intersecting graphs, so go nuts.

• Transactional?

– The size of the cluster doesn't generally doesn't affect the performance of individual operations.• Transactional?

– Reliably atomic state transitions also simplify your life.

– Asynchronous transaction

operations.

• Deeply analytic?– Use inferences to describe relations

and conditions you're interested in.ymanagement makes it more tolerable.

• Real-time?C f f

– Build up arbitrarily complex libraries of inference to extract meaning from data.

– Control the influence of updates with shared points-of-view.

– Never be blocked waiting for the database to respond.

Come see us

• Stig: Social Graphs & Discovery at ScaleStig: Social Graphs & Discovery at Scale 10:30 – 11:20AM

• Lunch ‘N Learn – Dive into the Stig query g q ylanguage and API - 1:15 – 2:15PM

• Online– www.stigdb.org– jlucas@tagged.com