|
||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||
public interface QPlannerAlgorithm
| Method Summary | |
|---|---|
void |
clear()
|
void |
constructSchema(java.util.Set keywords,
java.util.Map MCons,
java.util.Map Ranges)
Create a query schema from a keyword-based query |
boolean |
isStop()
Check whether the algorithm has stopped and result is ready to collect |
java.util.Set[] |
makeSchemaInstances(Graph schemaGraph,
java.util.Set keywords)
Generates schema instances from a schema graph |
java.util.Set[] |
plan(ASG q,
int length,
ReformulationConfiguration config)
Used by the general version which finds join paths up to a given length |
java.util.Set[] |
plan(ASG q,
ReformulationConfiguration config)
Used by the basic qplanner algorithm |
| Method Detail |
|---|
java.util.Set[] plan(ASG q,
ReformulationConfiguration config)
throws QProcException
q - config -
QProcException
java.util.Set[] plan(ASG q,
int length,
ReformulationConfiguration config)
throws QProcException
q - length - config -
QProcException
void constructSchema(java.util.Set keywords,
java.util.Map MCons,
java.util.Map Ranges)
throws QProcException
query - user queryMCons - a hash map [scheme -> Cons] of scheme constraintsRanges - a hash map [scheme -> range] of scheme ranges
QProcException
java.util.Set[] makeSchemaInstances(Graph schemaGraph,
java.util.Set keywords)
throws QProcException
schemaGraph - query -
QProcExceptionboolean isStop()
void clear()
|
||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||