Examples of com.dooapp.gaedo.blueprints.queries.executable.OptimizedGraphExecutableQuery

Package com.dooapp.gaedo.blueprints.queries.executable

Examples of com.dooapp.gaedo.blueprints.queries.executable.OptimizedGraphExecutableQuery

com.dooapp.gaedo.blueprints.queries.executable.OptimizedGraphExecutableQuery
Optimized executable query. How is it optimized ? Instead of simply searching through all vertices linked to class vertex (which always exist) through Object.classes edge, this one tries to find the vertex linked to the smallest solution space. How ? As an example, suppose one want to find, using our test beans, elements matching that query :
```
 AND Posts.note ==? 4.0 Posts.author.login ==? "user login" Object.classes contains Post.class 
```
This class will start by extracting query roots (vertices to which solutions of this query MUST be linked) by calling {@link #getPossibleRootsOf(VertexTest)}In this example, this method call will return
```
 4.0:long => { Property[note] } "user login":string => { Property[author], Property[login] } Post:class => { Property[class] } 
```
One question remain : from these three vertices, which one will be linked (through the given property path) to the smallest number of vertices ? To answer this question, the {@link #findBestRootIn(Map)} method creates a {@link VertexSet} object which can back-navigate the edges representing these propertiesand directly give us the best query root. @author ndx

  public GraphExecutableQuery getQuery(SortingExpression sortingExpression) {
    // At the end of the visit, there should be only one item in stack : the root one
    if(tests.size()!=1) {
      throw new InvalidTestStructureException(tests);
    }
    return new OptimizedGraphExecutableQuery(service, tests.peek(), sortingExpression);
//    return new BasicGraphExecutableQuery(service, tests.peek(), sortingExpression);
  }

View Full Code Here

    }
    return createExecutableQuery(service, tests.peek(), sortingExpression);
  }


  protected OptimizedGraphExecutableQuery createExecutableQuery(AbstractBluePrintsBackedFinderService<? extends IndexableGraph, DataType, InformerType> service, CompoundVertexTest vertextTest, SortingExpression sortingExpression) {
    return new OptimizedGraphExecutableQuery(service, vertextTest, sortingExpression);
//    return new BasicGraphExecutableQuery(service, tests.peek(), sortingExpression);
  }

View Full Code Here

    }
    return createExecutableQuery(service, tests.peek(), sortingExpression);
  }


  protected OptimizedGraphExecutableQuery createExecutableQuery(AbstractBluePrintsBackedFinderService<? extends IndexableGraph, DataType, InformerType> service, CompoundVertexTest vertextTest, SortingExpression sortingExpression) {
    return new OptimizedGraphExecutableQuery(service, vertextTest, sortingExpression);
//    return new BasicGraphExecutableQuery(service, tests.peek(), sortingExpression);
  }

View Full Code Here

  public GraphExecutableQuery getQuery(IndexableGraph database, SortingExpression sortingExpression) {
    // At the end of the visit, there should be only one item in stack : the root one
    if(tests.size()!=1) {
      throw new InvalidTestStructureException(tests);
    }
    return new OptimizedGraphExecutableQuery(service, tests.peek(), sortingExpression);
//    return new BasicGraphExecutableQuery(service, tests.peek(), sortingExpression);
  }

View Full Code Here

    }
    return createExecutableQuery(service, tests.peek(), sortingExpression);
  }


  protected OptimizedGraphExecutableQuery createExecutableQuery(AbstractBluePrintsBackedFinderService<? extends IndexableGraph, DataType, InformerType> service, CompoundVertexTest vertextTest, SortingExpression sortingExpression) {
    return new OptimizedGraphExecutableQuery(service, vertextTest, sortingExpression);
//    return new BasicGraphExecutableQuery(service, tests.peek(), sortingExpression);
  }

View Full Code Here

  public GraphExecutableQuery getQuery(SortingExpression sortingExpression) {
    // At the end of the visit, there should be only one item in stack : the root one
    if(tests.size()!=1) {
      throw new InvalidTestStructureException(tests);
    }
    return new OptimizedGraphExecutableQuery(service, tests.peek(), sortingExpression);
//    return new BasicGraphExecutableQuery(service, tests.peek(), sortingExpression);
  }

View Full Code Here

    }
    return createExecutableQuery(service, tests.peek(), sortingExpression);
  }


  protected OptimizedGraphExecutableQuery createExecutableQuery(AbstractBluePrintsBackedFinderService<?, DataType, InformerType> service, CompoundVertexTest vertextTest, SortingExpression sortingExpression) {
    return new OptimizedGraphExecutableQuery(service, vertextTest, sortingExpression);
//    return new BasicGraphExecutableQuery(service, tests.peek(), sortingExpression);
  }

View Full Code Here

  public GraphExecutableQuery getQuery(IndexableGraph database, SortingExpression sortingExpression) {
    // At the end of the visit, there should be only one item in stack : the root one
    if(tests.size()!=1) {
      throw new InvalidTestStructureException(tests);
    }
    return new OptimizedGraphExecutableQuery(service, tests.peek(), sortingExpression);
//    return new BasicGraphExecutableQuery(service, tests.peek(), sortingExpression);
  }

View Full Code Here

TOP

Related Classes of com.dooapp.gaedo.blueprints.queries.executable.OptimizedGraphExecutableQuery

com.dooapp.gaedo.blueprints.queries.BluePrintsQueryBuilder

com.dooapp.gaedo.blueprints.queries.tests.AndVertexTest

com.dooapp.gaedo.blueprints.queries.tests.CollectionContains

com.dooapp.gaedo.blueprints.queries.tests.VertexTest

com.dooapp.gaedo.properties.ClassCollectionProperty

com.tinkerpop.blueprints.pgm.Vertex

com.tinkerpop.blueprints.Vertex

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.