7 using System.Collections.Generic;
203 public const string TRUE =
"true";
204 public const string FALSE =
"false";
211 public const string LIMIT =
"limit";
305 public IList<string>
queries {
get; set; } =
new List<string>();
473 public IDictionary<string, string>
options {
get; set; } =
new Dictionary<string, string>();
663 IDictionary<string, string>
options = null)
665 this.graph_name = graph_name ??
"";
666 this.queries = queries ??
new List<string>();
669 this.rings =
rings ?? 1;
670 this.options =
options ??
new Dictionary<string, string>();
706 public IDictionary<string, string>
info {
get; set; } =
new Dictionary<string, string>();
const string AND_LABELS
If set to true, the result of the query has entities that satisfy all of the target labels...
bool result
Indicates a successful query.
const string TARGET_NODES_TABLE
Name of the table to store the list of the final nodes reached during the traversal.
IList< long > adjacency_list_int_array
The adjacency entity integer ID: either edge IDs per node requested (if using QUERY_EDGE_ID or QUERY_...
const string ENABLE_GRAPH_DRAW
If set to true, adds a WKT-type column named 'QUERY_EDGE_WKTLINE' to the given adjacency_table and in...
IList< string > adjacency_list_string_array
The adjacency entity string ID: either edge IDs per node requested (if using QUERY_EDGE_NAME or QUERY...
IList< string > restrictions
Additional restrictions to apply to the nodes/edges of an existing graph.
IDictionary< string, string > options
Additional parameters FORCE_UNDIRECTED: If set to true, all inbound edges and outbound edges relative...
string graph_name
Name of the graph resource to query.
IList< string > adjacency_list_wkt_array
The adjacency entity WKTPOINT or WKTLINE ID: either edge IDs per node requested (if using QUERY_EDGE_...
QueryGraphRequest(string graph_name, IList< string > queries, IList< string > restrictions=null, string adjacency_table=null, int?rings=null, IDictionary< string, string > options=null)
Constructs a QueryGraphRequest object with the specified parameters.
const string RESTRICTION_THRESHOLD_VALUE
Value-based restriction comparison.
const string EXPORT_QUERY_RESULTS
Returns query results in the response.
int rings
Sets the number of rings around the node to query for adjacency, with '1' being the edges directly at...
const string FORCE_UNDIRECTED
If set to true, all inbound edges and outbound edges relative to the node will be returned...
IDictionary< string, string > info
Additional information.
A set of parameters for Kinetica.queryGraph(string,IList{string},IList{string},string,int,IDictionary{string, string}).
KineticaData - class to help with Avro Encoding for Kinetica
A set of results returned by Kinetica.queryGraph(string,IList{string},IList{string},string,int,IDictionary{string, string}).
IList< string > queries
Nodes or edges to be queried specified using query identifiers.
string adjacency_table
Name of the table to store the resulting adjacencies.
QueryGraphRequest()
Constructs a QueryGraphRequest object with default parameters.
const string LIMIT
When specified, limits the number of query results.
Additional parameters FORCE_UNDIRECTED: If set to true, all inbound edges and outbound edges relative...