Skip to main content
The Arize GraphQL API has limitations in place to protect against excessive or abusive calls to our servers.

ā€‹
Pagination enforcement

Certain connections require a first or last argument to be passed in to avoid massive fan-out queries. For these types of queries, you will encounter an error indicating that you must set a page size that is under a certain number. For more details about pagination and GraphQL, please consult this guide.

ā€‹
Rate limit

There are simple frequency limitations placed on the Arize GraphQL API to avoid abusive behavior. Limits apply per API key over a one-minute window, with queries and mutations counted separately. The exact limits depend on your account; contact support if your workload needs more. Self-hosted deployments set the limit with a single configuration value, described in Programmatic interface limits and capacity. When you exceed a limit the response is a GraphQL error with extensions.code set to TOO_MANY_REQUESTS. Rejected requests do not count against the window, so backing off and retrying loses nothing. A good rule of thumb is to spread requests evenly across the minute and to avoid massive parallel jobs.
Paging a connection to pull a whole projectā€™s worth of data works against these limits by design. For bulk span exports, warehouse replication, or backfills, use Arrow Flight, Data Fabric, or batch span logging instead; see Choosing an interface.

ā€‹
Complexity limit

With GraphQL, one query can replace multiple. A single complex GraphQL query could return data equivalent to thousands of REST requests. This means the query rate limit does not sufficiently represent the computational costs on our servers. To accurately represent the server cost of a query, the GraphQL API calculates a callā€™s complexity score based on the query itself. As long as your query falls under our complexity cost limit of 1000, you can execute this level of query. Check the complexity limit and cost for a given query in the explorer by specifying the rateLimit node.

ā€‹
Calculating complexity

Note: The minimum cost of a call to the GraphQL API is 1, representing a single request.
  • Each node equates to 1 complexity point. This includes the estimated nodes returned from connections.
  • Each node field defaults to 1 complexity point.
Below is an example query and complexity score calculation:
Calculation: 1 Space node + 1 Space field (name) + (50 Monitors X 5 Monitor Fields (name, threshold, status, edges, node ) 1+1+(50āˆ—5)=2521 + 1 + \left(\right. 50 * 5 \left.\right) = 252 Total Query Cost = 252

ā€‹
Returning a callā€™s complexity cost

With the GraphQL API, you can check the complexity cost for a given query by querying fields on the rateLimit object:
  • The limit field returns the maximum number of points the client is permitted to consume for a given call
  • The cost field returns the point cost for the current call
Having trouble? Reach out to us via email support@arize.com or Slack us in the #arize-support channel for more support.