TherChenYang opened a new issue, #30253: URL: https://github.com/apache/shardingsphere/issues/30253
## Feature Request ### Is your feature request related to a problem? https://github.com/apache/shardingsphere/issues?q=is%3Aopen+is%3Aissue+label%3A%22in%3A+SQL+parse%22+label%3A%22db%3A+SQLServer%22 ### Describe the feature you would like. ShardingSphere currently unable to parse the "MATCH" clause in SQL Server. I am planning to enhance the support for SQL Server SQL parsing in ShardingSphere. The syntax of match in SQLServer is as follows [MATCH (Transact-SQL)](https://learn.microsoft.com/zh-cn/sql/t-sql/queries/match-sql-graph?view=sql-server-ver16) ```sql MATCH (<graph_search_pattern>) <graph_search_pattern>::= { <simple_match_pattern> | <arbitrary_length_match_pattern> | <arbitrary_length_match_last_node_predicate> } <simple_match_pattern>::= { LAST_NODE(<node_alias>) | <node_alias> { { <-( <edge_alias> )- } | { -( <edge_alias> )-> } <node_alias> | LAST_NODE(<node_alias>) } } [ { AND } { ( <simple_match_pattern> ) } ] [ ,...n ] <node_alias> ::= node_table_name | node_table_alias <edge_alias> ::= edge_table_name | edge_table_alias <arbitrary_length_match_pattern> ::= { SHORTEST_PATH( <arbitrary_length_pattern> [ { AND } { <arbitrary_length_pattern> } ] [ ,…n] ) } <arbitrary_length_match_last_node_predicate> ::= { LAST_NODE( <node_alias> ) = LAST_NODE( <node_alias> ) } <arbitrary_length_pattern> ::= { LAST_NODE( <node_alias> ) | <node_alias> ( <edge_first_al_pattern> [<edge_first_al_pattern>…,n] ) <al_pattern_quantifier> } | ( {<node_first_al_pattern> [<node_first_al_pattern> …,n] ) <al_pattern_quantifier> LAST_NODE( <node_alias> ) | <node_alias> } <edge_first_al_pattern> ::= { ( { -( <edge_alias> )-> } | { <-( <edge_alias> )- } <node_alias> ) } <node_first_al_pattern> ::= { ( <node_alias> { <-( <edge_alias> )- } | { -( <edge_alias> )-> } ) } <al_pattern_quantifier> ::= { + | { 1 , n } } n - positive integer only. ``` The following shows the steps required to complete the task: 1. Adjust antlr g4 file 2. Adjust sqlServer visitor After completion, the following sql parsing is supported ##### case1 ``` sql SELECT Person2.name AS FriendName FROM Person Person1, friend, Person Person2 WHERE MATCH(Person1-(friend)->Person2) AND Person1.name = 'Alice'; ``` [link](https://learn.microsoft.com/zh-cn/sql/t-sql/queries/match-sql-graph?view=sql-server-ver16) ##### case2 ```sql SELECT Person3.name AS FriendName FROM Person Person1, friend, Person Person2, friend friend2, Person Person3 WHERE MATCH(Person1-(friend)->Person2-(friend2)->Person3) AND Person1.name = 'Alice'; ``` [link](https://learn.microsoft.com/zh-cn/sql/t-sql/queries/match-sql-graph?view=sql-server-ver16) ##### case3 ```sql SELECT Person1.name AS Friend1, Person2.name AS Friend2 FROM Person Person1, friend friend1, Person Person2, friend friend2, Person Person0 WHERE MATCH(Person1-(friend1)->Person0 AND Person2-(friend2)->Person0); ``` [link](https://learn.microsoft.com/zh-cn/sql/t-sql/queries/match-sql-graph?view=sql-server-ver16) ##### case4 ```sql SELECT PersonName, Friends FROM ( SELECT Person1.name AS PersonName, STRING_AGG(Person2.name, '->') WITHIN GROUP (GRAPH PATH) AS Friends, LAST_VALUE(Person2.name) WITHIN GROUP (GRAPH PATH) AS LastNode FROM Person AS Person1, friendOf FOR PATH AS fo, Person FOR PATH AS Person2 WHERE MATCH(SHORTEST_PATH(Person1(-(fo)->Person2)+)) AND Person1.name = 'Jacob' ) AS Q WHERE Q.LastNode = 'Alice' ``` [link](https://learn.microsoft.com/zh-cn/sql/relational-databases/graphs/sql-graph-shortest-path?view=sql-server-ver16) ##### case5 ```sql SELECT Person1.name AS PersonName, STRING_AGG(Person2.name, '->') WITHIN GROUP (GRAPH PATH) AS Friends FROM Person AS Person1, friendOf FOR PATH AS fo, Person FOR PATH AS Person2 WHERE MATCH(SHORTEST_PATH(Person1(-(fo)->Person2){1,3})) AND Person1.name = 'Jacob' ``` [link](https://learn.microsoft.com/zh-cn/sql/relational-databases/graphs/sql-graph-shortest-path?view=sql-server-ver16) ##### case6 ```sql SELECT Person1.name AS PersonName, STRING_AGG(Person2.name, '->') WITHIN GROUP (GRAPH PATH) AS Friends, Restaurant.name FROM Person AS Person1, friendOf FOR PATH AS fo, Person FOR PATH AS Person2, likes, Restaurant WHERE MATCH(SHORTEST_PATH(Person1(-(fo)->Person2){1,3}) AND LAST_NODE(Person2)-(likes)->Restaurant ) AND Person1.name = 'Jacob' AND Restaurant.name = 'Ginger and Spice' ``` [link](https://learn.microsoft.com/zh-cn/sql/relational-databases/graphs/sql-graph-shortest-path?view=sql-server-ver16) -- This is an automated message from the Apache Git Service. To respond to the message, please log on to GitHub and use the URL above to go to the specific comment. To unsubscribe, e-mail: [email protected] For queries about this service, please contact Infrastructure at: [email protected]
