Code Monkey home page Code Monkey logo

arcadedb's Introduction

ArcadeDB

Ruby Interface to a Arcade Database.

The program utilizes the HTTP-JSON API to direct database queries to an ArcadeDB server. The server's response is then mapped to an ORM (Object-Relational Mapping) based on DRY::Struct. Each database type is represented by a dedicated Model Class, where complex queries are encapsulated. The program also includes a Query-Preprocessor and Match-statment generator for constructing custom queries in ruby fashion.

ArcadeDB internally uses Arcade as primary namespace*

Prerequisites

A running AracdeDB-Instance. Quick-Start-Guide.

New Project

mkdir project && cd project
bundle init
bundle add arcadedb
bundle add pastel  # for console output
mkdir model
mkdir bin

copy https://github.com/topofocus/arcadedb/blob/main/bin/console to the bin directory
copy https://github.com/topofocus/arcadedb/blob/main/arcade.yml to the project root and modify to your needs

Console

To start an interactive console, a script is provided in the bin-directory.

$ cd bin && ./console.rb  t   ( or "d" or "p" for Test, Development and Production environment)

**in Test environment Database definitions  (model-files) of the test-suite are included!**

Add to a project

Just require it in your program:

require "arcade"

Config

Add a file arcade.yml at the root of your program or in the config-dir and provide suitable databases for test, development and production environment.

Examples & Specs

The example directory contains documented sample files for typical usecases

The spec-files in the rspec-test-suite-section are worth reading, too.

Implementation

The adapter uses a 3 layer concept.

Top-Layer : Arcade::Base-Model-Objects. Similar to ActiveRecord Model Objects but based on Dry-Struct.

# Example model file  /model/demo/user.rb
module Demo
  class User < Arcade::Vertex
    attribute :name, Types::Nominal::String
    
    def grandparents
      db.query( "select in('is_family') from #{rid} ") &.allocate_model
    end
  end
end
__END__
  CREATE PROPERTY demo_user.name STRING
  CREATE INDEX on demo_user( name ) UNIQUE

Only the name attribute is declared.

Demo::User.create_type creates the type and executes provided database-commands after __END__.

Other properties are schemaless. They are present in the database and are mapped to the value-attribute on the ruby side.

Person.insert name: "Hubert", age: 35
Person.update set: { age: 36 }, where: { name: 'Hubert' }
persons = Person.where "age > 40"
persons.first.update age: 37
persons.first.update father: Person.create( name: 'Mike', age: 94 )

Person.all
Person.delete all: true || where: age: 56 , ...

Nodes and Traverse

ArcadeDB wraps common queries of bidirectional connected vertices.

Suppose

m = Person.insert name: 'Hubert', age: 25
f = Person.insert name: 'Pauline', age: 28
m.assign via: IsMarriedTo, vertex: f , divorced: false

This creates the simple graph

Hubert --- is_married_to --> Pauline | -- divorced (attribute on the edge)

This can be queried through

hubert =  Person.find name: 'Hubert'
pauline = hubert.nodes( :out, via: IsMarriedTo ).first
# or simply
pauline = hubert.out.first

Conditions may be set, too.

hubert.nodes( :out, via: IsMarriedTo, where: "age < 30" )

gets all wives of hubert, who are younger then 30 years.
or

Person.nodes( :outE, via: IsMarriedTo, where: { divorced: false } )

gets all wives where the divorced-condition, which is set on the edge, is false.

Query

A Query Preprocessor is implemented. Its adapted from ActiveOrient. The documentation is still valid, however the class has changed to Arcade::Query.

Match

A simple Match Statement Generator is provided for convenience. As the declarative syntax seems to be very intuitive, a preprocessor should not be necessary. With the help of some ruby magic, the creation of match-statements is simply an no-brainer.

a =  Arcade::Match.new( type: Person, as: :persons)
                  .out( IsMarriedTo )
                  .node( where: 'age < 30')
a.to_s
=>  Match { type: person, as: persons }.out('is_married_to'){ where: ( age < 30) } RETURN persons

a.execute.select_results  #  sends the statement to the database and returns Arcade Objects. 

Arcade::Match-objects can be used as from: argument to Arcade::Query-Statements, thus hybrid queries are easily constructed without extensive string-manipulations.

Low Level Database Requests

The second Layer handles Database-Requests.
In its actual implementation, these requests are delegated to the HTTP/JSON-API.

Arcade::Init uses the database specification of the arcade.yml file.
The database-handle is always present through Arcade::Init.db

db =  Arcade::Init.db

$ db.get nn, mm                                 # returns a Aracde:Base object
                                                # rid is either "#11:10:" or two numbers
$ db.query querystring                          # returns either an Array of results (as  Hash) 
$ db.execute { querystring }                    # execute a non idempotent query within a (nested) transaction
$ db.create <name>, attribute: value ....       # Creates a new <Document | Vertex> and returns the rid
                                                # Operation is performed as Database-Transaction and is rolled back on error
$ db.insert <name>, attribute: value ....       # Inserts a new <Document | Vertex> and returns the new object
$ db.create_edge <name>, from: <rid> or [rid, rid, ..] , to: <rid> or [rid, rid, ..]

Convert database input to Arcade::Base Models

Either db.query or dbB.execute return the raw JSON-input from the database. It can always converted to model-objects by chaining allocate_model or select_result.

$ db.query "select from my_names limit 1"
# which is identical to
$ My::Names.query( limit: 1).query
 => [{:@out=>0, :@rid=>"#225:6", :@in=>0, :@type=>"my_names", :@cat=>"v", :name=>"Zaber"}] 
# then
$ My::Names.query( limit: 1).query.allocate_model.to_human
 => ["<my_names[#225:6]: name: Zaber>" ]
 # replaces the hash with a My::Names Object 

The Base Layer implements a low level access to the database API.

$ Arcade::Api.databases                        # returns an array of known databases
$ Arcade::Api.create_database <a string>       # returns true if successfull
$ Arcade::Api.drop_database   <a string>       # returns true if successfull

$ Arcade::Api.begin_transaction <database>
$ Arcade::Api.create_document <database>, <type>,  attribute: value , ...
$ Arcade::Api.execute( <database>  ) { <query>  }
$ Arcade::Api.commit <database>                #  or Arcade::Api.rollback  


$ Arcade::Api.query( <database>  ) { <query>  }
$ Arcade::Api.get_record <database>,  rid      #  returns a hash

<query> is either a string or a hash:

{  :query      => "<the query string> ",
   :language   => one of :sql, :cypher, :gmelin: :neo4 ,
	 :params     =>   a  hash of parameters,
	 :limit      => a number ,
	 :serializer =>  one of :graph, :record }    

ORM Behavior

Simple tasks are implemented on the model layer.

Ensure that a Record exists

The upsert command either updates or creates a database record.

  User.upsert name: 'Hugo'
  # or
  User.upsert set: { age: 46 }, where: { name: 'Hugo' }

either creates the record (and returns it) or returns the existing database entry. Obviously, the addressed attribute (where condition) must have a proper index.

The upsert statement provides a smart method to ensure the presence of a defined starting point.

Assign Nodes to a Vertex

Apart from accessing attributes by their method-name, adjacent edges and notes are fetched through

  new_vertex = ->(n) { Node.create( note_count: n )  }                      ## lambda to create a Node type record
  nucleus    =  BaseNode.create item: 'b'                                   ## create a start node
  (1..10).each{ |n| nucleus.assign( via: Connects, vertex: new_vertex[n]) } ## connect nodes via Connects-Edges

After creating a star-like structure, the environment can be explored

  nucleus.edges.to_human
  =>["<connects[#80:14] :.: #4:0->{}->#34:2>",                                  
     "<connects[#79:13] :.: #4:0->{}->#31:1>",                                  
     ( ... )
     "<connects[#79:14] :.: #4:0->{}->#31:2>"] 

   nucleus.nodes.to_human
 => ["<node[#34:2]: item: 10>",                                                         
     "<node[#31:1]: item: 1>",                                                          
     ( ... )
     "<node[#31:2]: item: 9>"]    

Edges provide a vertices-method to load connected ones. Both vertices and edges expose in, out, both-methods to select connections further. Specific edge-classes (types) are provided with the via: parameter, as shown in assign above.

Traverse Facility

To ease queries to the graph database, Arcade::Query supports traversal of nodes

Create a Chain of Nodes:

  def linear_elements start, count  #returns the edge created
      new_vertex = ->(n) { Arcade::ExtraNode.create( note_count: n )  }
      (2..count).each{ |n| start = start.assign vertex: new_vertex[n], via: Arcade::Connects  }
  end
   
  start_node =  Arcade::ExtraNode.create( item: 'linear'  )
  linear_elements start_node , 200

Select a range of nodes and perform a mathematical operation

  hundred_elements =  start_node.traverse :out, via: Arcade::Connects, depth: 100
  median = Query.new from: hundred_elements,
               projection: 'median(note_count)',
                    where: '$depth>=50'
  median.to_s
  -=> select median(note_count) from  ( traverse out(connects) from #52:0 while $depth < 100 )  where $depth>=50  
   =>   {:"median(note_count)"=>75.5 }

Transactions

Database-Transactions are largely encapsulated

db =  Arcade::Init.db
db.begin_transaction

{ perform insert, update, query, etc tasks in the database }

db.commit 

# or

db.rollback

Audit proofed Bookings

Although ArcadeDB is a mutable database, the ruby-Interface supports basic audit proofed transactions. Two specialized Database-Types are included:

  • Arcade::RevisionRecord – A document class, intended to be embedded in Revision-Records
  • Arcade::Revision – A vertex-class with specialized insert- and update- methods

If a vertex is based on Arcade::Revision, a protocol-property is included. Its initialised with a single Arcade::RevisionRecord Object. Each update adds an Arcade::RevisionRecord to the protocol stack.

  m= Member.insert( name: "Hubert", 
                 surname: "Hugo", 
                   birth: Date.new( 1976,3,15  ) ) { 'record initiated' }

  m.update( birth: Date.new( 1978,3,15  )  ) { "member provided correct date via mail"  }
    
  m.protocol  =>  Date    | User |  Action                                | old
             --------------------------------------------------------------------------------
             =>  1.1.2024 | root |  record initiated                      |
             =>  1.2.2024 | root |  member provided correct date via mail | birth: "1976-3-15"

Contributing

Bug reports and pull requests are welcome. This project is intended to be a safe, welcoming space for collaboration, and contributors are expected to adhere to the Contributor Covenant code of conduct.

Code of Conduct

Everyone interacting in the Core project’s codebases, issue trackers, chat rooms and mailing lists is expected to follow the code of conduct.

arcadedb's People

Contributors

topofocus avatar

Stargazers

 avatar  avatar  avatar  avatar  avatar  avatar  avatar

Watchers

 avatar  avatar

arcadedb's Issues

implement money

Need to implement handling of money (currency as decimal with four digits) and crypto

forcing of storage of deterministic digits:

"INSERT INTO Money (money) VALUES ('12131.2141'.as_decimal()")

Recommend Projects

  • React photo React

    A declarative, efficient, and flexible JavaScript library for building user interfaces.

  • Vue.js photo Vue.js

    🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.

  • Typescript photo Typescript

    TypeScript is a superset of JavaScript that compiles to clean JavaScript output.

  • TensorFlow photo TensorFlow

    An Open Source Machine Learning Framework for Everyone

  • Django photo Django

    The Web framework for perfectionists with deadlines.

  • D3 photo D3

    Bring data to life with SVG, Canvas and HTML. 📊📈🎉

Recommend Topics

  • javascript

    JavaScript (JS) is a lightweight interpreted programming language with first-class functions.

  • web

    Some thing interesting about web. New door for the world.

  • server

    A server is a program made to process requests and deliver data to clients.

  • Machine learning

    Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.

  • Game

    Some thing interesting about game, make everyone happy.

Recommend Org

  • Facebook photo Facebook

    We are working to build community through open source technology. NB: members must have two-factor auth.

  • Microsoft photo Microsoft

    Open source projects and samples from Microsoft.

  • Google photo Google

    Google ❤️ Open Source for everyone.

  • D3 photo D3

    Data-Driven Documents codes.