Lokasi ngalangkungan proxy:   [ UP ]  
[Ngawartoskeun bug]   [Panyetelan cookie]                
Skip to content

Commit 0535759

Browse files
Apply suggestions from code review
Co-authored-by: Randolph West MSFT <97149825+rwestMSFT@users.noreply.github.com>
1 parent 33d6470 commit 0535759

2 files changed

Lines changed: 2 additions & 2 deletions

File tree

docs/t-sql/functions/graph-id-from-edge-id-transact-sql.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -40,7 +40,7 @@ Returns the internal graph ID, which is a **bigint**.
4040

4141
## Remarks
4242

43-
- Due to the performance overhead of parsing and validating the supplied character representation (JSON) of edges, you should only use `GRAPH_ID_FROM_EDGE_ID` where needed. In most cases, [MATCH](../queries/match-sql-graph.md) should be sufficient for queries over graph tables.
43+
- Owing to the performance overhead of parsing and validating the supplied character representation (JSON) of edges, you should only use `GRAPH_ID_FROM_EDGE_ID` where needed. In most cases, [MATCH](../queries/match-sql-graph.md) should be sufficient for queries over graph tables.
4444
- For `GRAPH_ID_FROM_EDGE_ID` to return a value, the supplied character JSON must be valid and the named `schema.table` within the JSON, must be a valid edge table.
4545
- If a graph ID is returned by the function, it's only guaranteed that it will be a valid integer. No checks are made whether the graph ID is present in the edge table.
4646
- The data type and behavior of graph IDs are implementation specific details, and are subject to change. For example, you shouldn't assume that graph IDs in a given edge table are sequential.

docs/t-sql/functions/graph-id-from-node-id-transact-sql.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -44,7 +44,7 @@ Returns the internal graph ID, which is a **bigint**.
4444

4545
## Remarks
4646

47-
- Due to the performance overhead of parsing and validating the supplied character representation (JSON) of nodes, you should only use `GRAPH_ID_FROM_NODE_ID` where needed. In most cases, [MATCH](../queries/match-sql-graph.md) should be sufficient for queries over graph tables.
47+
- Owing to the performance overhead of parsing and validating the supplied character representation (JSON) of nodes, you should only use `GRAPH_ID_FROM_NODE_ID` where needed. In most cases, [MATCH](../queries/match-sql-graph.md) should be sufficient for queries over graph tables.
4848
- For `GRAPH_ID_FROM_NODE_ID` to return a value, the supplied character representation (JSON) must be valid and the named `schema.table` within the JSON, must be a valid node table.
4949
- If a graph ID is returned by the function, it's only guaranteed that it will be a valid integer. No checks are made whether the graph ID is present in the node table.
5050
- The data type and behavior of graph IDs are implementation specific details, and are subject to change. For example, you shouldn't assume that graph IDs in a given node table are sequential.

0 commit comments

Comments
 (0)