SUBQUERIES IN DISTRIBUTED ASYNCHRONOUS GRAPH QUERIES
A graph processing engine is provided for executing a graph query comprising a parent query and a subquery nested within the parent query. The subquery is an existential subquery, uses a reference to one or more correlated variables from the parent query, is inlined in the parent query pattern match...
Gespeichert in:
| Hauptverfasser: | , , , , , |
|---|---|
| Format: | Patent |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | |
| container_start_page | |
| container_title | |
| container_volume | |
| creator | Trigonakis, Vasileios Faltin, Tomas Hong, Sungpack Ragot, Anton Ez-zainabi, Yahya Chafi, Hassan |
| description | A graph processing engine is provided for executing a graph query comprising a parent query and a subquery nested within the parent query. The subquery is an existential subquery, uses a reference to one or more correlated variables from the parent query, is inlined in the parent query pattern matching, does not have a post-processing phase, does not contain any global aggregation operations, uses a reference to at most one non-correlated variable, and does not include any filters on a non-correlated variable. Executing the graph query comprises initiating execution of the parent query, responsive to the parent query matching the one or more correlated variables in an intermediate result set, executing the subquery by applying a neighbor pattern matching operator that checks for existence of an edge, and resuming execution of the parent query based on results of the neighbor pattern matching operation. |
| format | Patent |
| fullrecord | <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_US2024220496A1</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>US2024220496A1</sourcerecordid><originalsourceid>FETCH-epo_espacenet_US2024220496A13</originalsourceid><addsrcrecordid>eNrjZDAJDnUKDHUN8nQNVvD0U3DxDA4J8nQKDXF1UXAMjvRz9gjy9_MPDVZwD3IM8FCAquRhYE1LzClO5YXS3AzKbq4hzh66qQX58anFBYnJqXmpJfGhwUYGRiZGRgYmlmaOhsbEqQIAntkoyw</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>SUBQUERIES IN DISTRIBUTED ASYNCHRONOUS GRAPH QUERIES</title><source>esp@cenet</source><creator>Trigonakis, Vasileios ; Faltin, Tomas ; Hong, Sungpack ; Ragot, Anton ; Ez-zainabi, Yahya ; Chafi, Hassan</creator><creatorcontrib>Trigonakis, Vasileios ; Faltin, Tomas ; Hong, Sungpack ; Ragot, Anton ; Ez-zainabi, Yahya ; Chafi, Hassan</creatorcontrib><description>A graph processing engine is provided for executing a graph query comprising a parent query and a subquery nested within the parent query. The subquery is an existential subquery, uses a reference to one or more correlated variables from the parent query, is inlined in the parent query pattern matching, does not have a post-processing phase, does not contain any global aggregation operations, uses a reference to at most one non-correlated variable, and does not include any filters on a non-correlated variable. Executing the graph query comprises initiating execution of the parent query, responsive to the parent query matching the one or more correlated variables in an intermediate result set, executing the subquery by applying a neighbor pattern matching operator that checks for existence of an edge, and resuming execution of the parent query based on results of the neighbor pattern matching operation.</description><language>eng</language><subject>CALCULATING ; COMPUTING ; COUNTING ; ELECTRIC DIGITAL DATA PROCESSING ; PHYSICS</subject><creationdate>2024</creationdate><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&date=20240704&DB=EPODOC&CC=US&NR=2024220496A1$$EHTML$$P50$$Gepo$$Hfree_for_read</linktohtml><link.rule.ids>230,308,776,881,25542,76290</link.rule.ids><linktorsrc>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&date=20240704&DB=EPODOC&CC=US&NR=2024220496A1$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>Trigonakis, Vasileios</creatorcontrib><creatorcontrib>Faltin, Tomas</creatorcontrib><creatorcontrib>Hong, Sungpack</creatorcontrib><creatorcontrib>Ragot, Anton</creatorcontrib><creatorcontrib>Ez-zainabi, Yahya</creatorcontrib><creatorcontrib>Chafi, Hassan</creatorcontrib><title>SUBQUERIES IN DISTRIBUTED ASYNCHRONOUS GRAPH QUERIES</title><description>A graph processing engine is provided for executing a graph query comprising a parent query and a subquery nested within the parent query. The subquery is an existential subquery, uses a reference to one or more correlated variables from the parent query, is inlined in the parent query pattern matching, does not have a post-processing phase, does not contain any global aggregation operations, uses a reference to at most one non-correlated variable, and does not include any filters on a non-correlated variable. Executing the graph query comprises initiating execution of the parent query, responsive to the parent query matching the one or more correlated variables in an intermediate result set, executing the subquery by applying a neighbor pattern matching operator that checks for existence of an edge, and resuming execution of the parent query based on results of the neighbor pattern matching operation.</description><subject>CALCULATING</subject><subject>COMPUTING</subject><subject>COUNTING</subject><subject>ELECTRIC DIGITAL DATA PROCESSING</subject><subject>PHYSICS</subject><fulltext>true</fulltext><rsrctype>patent</rsrctype><creationdate>2024</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNrjZDAJDnUKDHUN8nQNVvD0U3DxDA4J8nQKDXF1UXAMjvRz9gjy9_MPDVZwD3IM8FCAquRhYE1LzClO5YXS3AzKbq4hzh66qQX58anFBYnJqXmpJfGhwUYGRiZGRgYmlmaOhsbEqQIAntkoyw</recordid><startdate>20240704</startdate><enddate>20240704</enddate><creator>Trigonakis, Vasileios</creator><creator>Faltin, Tomas</creator><creator>Hong, Sungpack</creator><creator>Ragot, Anton</creator><creator>Ez-zainabi, Yahya</creator><creator>Chafi, Hassan</creator><scope>EVB</scope></search><sort><creationdate>20240704</creationdate><title>SUBQUERIES IN DISTRIBUTED ASYNCHRONOUS GRAPH QUERIES</title><author>Trigonakis, Vasileios ; Faltin, Tomas ; Hong, Sungpack ; Ragot, Anton ; Ez-zainabi, Yahya ; Chafi, Hassan</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_US2024220496A13</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>eng</language><creationdate>2024</creationdate><topic>CALCULATING</topic><topic>COMPUTING</topic><topic>COUNTING</topic><topic>ELECTRIC DIGITAL DATA PROCESSING</topic><topic>PHYSICS</topic><toplevel>online_resources</toplevel><creatorcontrib>Trigonakis, Vasileios</creatorcontrib><creatorcontrib>Faltin, Tomas</creatorcontrib><creatorcontrib>Hong, Sungpack</creatorcontrib><creatorcontrib>Ragot, Anton</creatorcontrib><creatorcontrib>Ez-zainabi, Yahya</creatorcontrib><creatorcontrib>Chafi, Hassan</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Trigonakis, Vasileios</au><au>Faltin, Tomas</au><au>Hong, Sungpack</au><au>Ragot, Anton</au><au>Ez-zainabi, Yahya</au><au>Chafi, Hassan</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>SUBQUERIES IN DISTRIBUTED ASYNCHRONOUS GRAPH QUERIES</title><date>2024-07-04</date><risdate>2024</risdate><abstract>A graph processing engine is provided for executing a graph query comprising a parent query and a subquery nested within the parent query. The subquery is an existential subquery, uses a reference to one or more correlated variables from the parent query, is inlined in the parent query pattern matching, does not have a post-processing phase, does not contain any global aggregation operations, uses a reference to at most one non-correlated variable, and does not include any filters on a non-correlated variable. Executing the graph query comprises initiating execution of the parent query, responsive to the parent query matching the one or more correlated variables in an intermediate result set, executing the subquery by applying a neighbor pattern matching operator that checks for existence of an edge, and resuming execution of the parent query based on results of the neighbor pattern matching operation.</abstract><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | |
| ispartof | |
| issn | |
| language | eng |
| recordid | cdi_epo_espacenet_US2024220496A1 |
| source | esp@cenet |
| subjects | CALCULATING COMPUTING COUNTING ELECTRIC DIGITAL DATA PROCESSING PHYSICS |
| title | SUBQUERIES IN DISTRIBUTED ASYNCHRONOUS GRAPH QUERIES |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-30T03%3A23%3A06IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-epo_EVB&rft_val_fmt=info:ofi/fmt:kev:mtx:patent&rft.genre=patent&rft.au=Trigonakis,%20Vasileios&rft.date=2024-07-04&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3EUS2024220496A1%3C/epo_EVB%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |