| RDF-Query documentation | Contained in the RDF-Query distribution. |
RDF::Query::Plan::ComputedStatement - Executable query plan for computed triples.
This document describes RDF::Query::Plan::ComputedStatement version 2.907.
Beyond the methods documented below, this class inherits methods from the RDF::Query::Plan class.
new ( @triple )execute ( $execution_context )nextclosenodesReturns a list of the three node objects that comprise the triple pattern this plan will return.
tripleReturns a RDF::Trine::Statement object representing the triple pattern this plan will return.
bf ()Returns a string representing the state of the nodes of the triple (bound or free).
distinctReturns true if the pattern is guaranteed to return distinct results.
orderedReturns true if the pattern is guaranteed to return ordered results.
plan_node_nameReturns the string name of this plan node, suitable for use in serialization.
plan_prototypeReturns a list of scalar identifiers for the type of the content (children) nodes of this plan node. See RDF::Query::Plan for a list of the allowable identifiers.
plan_node_dataReturns the data for this plan node that corresponds to the values described by
the signature returned by plan_prototype.
graph ( $g )Gregory Todd Williams <gwilliams@cpan.org>
| RDF-Query documentation | Contained in the RDF-Query distribution. |
# RDF::Query::Plan::ComputedStatement # -----------------------------------------------------------------------------
package RDF::Query::Plan::ComputedStatement; use strict; use warnings; use base qw(RDF::Query::Plan); use Log::Log4perl; use Scalar::Util qw(blessed); use Time::HiRes qw(gettimeofday tv_interval); use RDF::Query::ExecutionContext; use RDF::Query::VariableBindings; ###################################################################### our ($VERSION); BEGIN { $VERSION = '2.907'; } ######################################################################
sub new { my $class = shift; my @nodes = splice(@_, 0, 4); my $quad = shift; my $keys = shift || {}; my $self = $class->SUPER::new( \@nodes, $quad ); $self->[0]{logging_keys} = $keys; my %var_to_position; my @methodmap = qw(subject predicate object); my %counts; my $dup_var; foreach my $idx (0 .. 3) { my $node = $nodes[ $idx ]; if (blessed($node) and $node->isa('RDF::Trine::Node::Variable')) { my $name = $node->name; $var_to_position{ $name } = $methodmap[ $idx ]; $counts{ $name }++; if ($counts{ $name } >= 2) { $dup_var = $name; } } } $self->[0]{referenced_variables} = [ keys %counts ]; my @positions; if (defined($dup_var)) { foreach my $idx (0 .. 2) { my $var = $nodes[ $idx ]; if (blessed($var) and $var->isa('RDF::Trine::Node::Variable')) { my $name = $var->name; if ($name eq $dup_var) { push(@positions, $methodmap[ $idx ]); } } } } $self->[0]{mappings} = \%var_to_position; if (@positions) { $self->[0]{dups} = \@positions; } return $self; }
sub execute ($) { my $self = shift; my $context = shift; if ($self->state == $self->OPEN) { throw RDF::Query::Error::ExecutionError -text => "COMPUTEDSTATEMENT plan can't be executed while already open"; } my $l = Log::Log4perl->get_logger("rdf.query.plan.computedstatement"); $l->trace( "executing RDF::Query::Plan::ComputedStatement" ); $self->[0]{start_time} = [gettimeofday]; my @nodes = @{ $self->[1] }; unless ($self->[2]) { pop(@nodes); } my $bound = $context->bound; if (%$bound) { foreach my $i (0 .. $#nodes) { next unless ($nodes[$i]->isa('RDF::Trine::Node::Variable')); next unless (blessed($bound->{ $nodes[$i]->name })); $nodes[ $i ] = $bound->{ $nodes[$i]->name }; } } my $query = $context->query; my $csg = $query->get_computed_statement_generators( $nodes[1]->uri_value ); unless (scalar(@$csg)) { throw RDF::Query::Error::ExecutionError -text => "No computed statement generator found for predicate " . $nodes[1]->uri_value; } my $iter = $csg->[0]->( $query, $bound, @nodes ); if (blessed($iter)) { $self->[0]{iter} = $iter; $self->[0]{bound} = $bound; $self->[0]{logger} = $context->logger; $self->[0]{count} = 0; $self->state( $self->OPEN ); } else { warn "no iterator in execute()"; } $self; }
sub next { my $self = shift; unless ($self->state == $self->OPEN) { throw RDF::Query::Error::ExecutionError -text => "next() cannot be called on an un-open COMPUTEDSTATEMENT"; } my $l = Log::Log4perl->get_logger("rdf.query.plan.computedstatement"); my $iter = $self->[0]{iter}; LOOP: while (my $row = $iter->next) { if ($l->is_trace) { $l->trace( "- got triple from model: " . $row->as_string ); } if (my $pos = $self->[0]{dups}) { $l->trace( "- checking for duplicate variables in triple" ); my @pos = @$pos; my $first_method = shift(@pos); my $first = $row->$first_method(); foreach my $p (@pos) { unless ($first->equal( $row->$p() )) { next LOOP; } } } my $binding = {}; foreach my $key (keys %{ $self->[0]{mappings} }) { my $method = $self->[0]{mappings}{ $key }; $binding->{ $key } = $row->$method(); } my $pre_bound = $self->[0]{bound}; my $bindings = RDF::Query::VariableBindings->new( $binding ); if ($row->can('label')) { if (my $o = $row->label('origin')) { $bindings->label( origin => [ $o ] ); } } @{ $bindings }{ keys %$pre_bound } = values %$pre_bound; $self->[0]{count}++; return $bindings; } return; }
sub close { my $self = shift; unless ($self->state == $self->OPEN) { throw RDF::Query::Error::ExecutionError -text => "close() cannot be called on an un-open TRIPLE"; } # my $l = Log::Log4perl->get_logger("rdf.query.plan.computedstatement"); my $t0 = delete $self->[0]{start_time}; my $count = delete $self->[0]{count}; delete $self->[0]{iter}; $self->SUPER::close(); }
sub nodes { my $self = shift; if ($self->[2]) { return @{ $self->[1] }[0..3]; } else { return @{ $self->[1] }[0..2]; } }
sub triple { my $self = shift; my @nodes = $self->nodes; if ($self->[2]) { return RDF::Trine::Statement::Quad->new( @nodes ); } else { return RDF::Trine::Statement->new( @nodes ); } }
sub bf { my $self = shift; my $context = shift; my $bf = ''; my $bound = $context->bound; foreach my $n (@{ $self->[1] }[0..3]) { if ($n->isa('RDF::Trine::Node::Variable')) { if (my $b = $bound->{ $n->name }) { $bf .= 'b'; } else { $bf .= 'f'; } } else { $bf .= 'b'; } } return $bf; }
sub distinct { return 0; }
sub ordered { return []; }
sub plan_node_name { return 'computedstatement'; }
sub plan_prototype { my $self = shift; return qw(N N N N i); }
sub plan_node_data { my $self = shift; return ($self->nodes); }
sub graph { my $self = shift; my $g = shift; my $label = $self->graph_labels; $g->add_node( "$self", label => "Computed Statement" . $self->graph_labels ); my @names = qw(subject predicate object graph); foreach my $i (0 .. 3) { my $n = $self->[ $i + 1 ]; my $rel = $names[ $i ]; my $str = $n->sse( {}, '' ); $g->add_node( "${self}$n", label => $str ); $g->add_edge( "$self" => "${self}$n", label => $names[ $i ] ); } return "$self"; } 1; __END__