7 using System.Collections.Generic;
193 public const string TRUE =
"true";
194 public const string FALSE =
"false";
199 public const string LIMIT =
"limit";
280 public IList<string>
queries {
get; set; } =
new List<string>();
437 public IDictionary<string, string>
options {
get; set; } =
new Dictionary<string, string>();
616 IDictionary<string, string>
options = null)
618 this.graph_name = graph_name ??
"";
619 this.queries = queries ??
new List<string>();
622 this.rings =
rings ?? 1;
623 this.options =
options ??
new Dictionary<string, string>();
659 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...
const string FIND_COMMON_LABELS
If set to true, for many-to-many queries or multi-level traversals, it lists the common labels betwee...
bool result
Indicates a successful query.
const string SERVER_ID
Indicates which graph server(s) to send the request to.
const string OUTPUT_CHARN_LENGTH
When specified (>0 and <=256), limits the number of char length on the output tables for string based...
IList< long > adjacency_list_int_array
The adjacency entity integer ID: either edge IDs per node requested (if using QUERY_EDGE_ID or QUERY_...
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.
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.
const string OUTPUT_WKT_PATH
If true then concatenated wkt line segments will be added as the WKT column of the adjacency table...
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, in [schema_name.
QueryGraphRequest()
Constructs a QueryGraphRequest object with default parameters.
const string LIMIT
When specified (>0), limits the number of query results.
Additional parameters FORCE_UNDIRECTED: If set to true, all inbound edges and outbound edges relative...