Hybrid in-memory BFS-DFS approach for computing graph queries against homogeneous graphs inside relational database systems

An in-memory graph query runtime is integrated inside a database management system and is capable of performing simple patter-matching queries against homogeneous graphs. The runtime efficiently combines breadth-first (BFS) and depth-first (DFS) neighbor traversal algorithms to achieve a hybrid runt...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Hauptverfasser:	Trigonakis, Vasileios, Arnaboldi, Marco, Hong, Sungpack, Chavan, Shasank K, Baetu, Ciprian, Haprian, Vlad, Daynes, Laurent, Lozi, Jean-Pierre
Format:	Patent
Sprache:	eng
Schlagworte:	CALCULATING COMPUTING COUNTING ELECTRIC DIGITAL DATA PROCESSING PHYSICS
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 Arnaboldi, Marco Hong, Sungpack Chavan, Shasank K Baetu, Ciprian Haprian, Vlad Daynes, Laurent Lozi, Jean-Pierre
description	An in-memory graph query runtime is integrated inside a database management system and is capable of performing simple patter-matching queries against homogeneous graphs. The runtime efficiently combines breadth-first (BFS) and depth-first (DFS) neighbor traversal algorithms to achieve a hybrid runtime that takes the best from both sides. As a result, the hybrid runtime is able to process arbitrarily large queries with a fixed amount of memory, optimizing for memory locality.
format	Patent
fullrecord	<record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_US11392624B2</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>US11392624B2</sourcerecordid><originalsourceid>FETCH-epo_espacenet_US11392624B23</originalsourceid><addsrcrecordid>eNqNzLEOgjAQgGEWB6O-w_kADIAxcUUl7OhMDjjaJrRXe2Ugvrwk-gBO__Ll3ybveumCGcC41JLlsEBZNemtagC9D4y9hpED9Gz9HI1ToAJ6Da-ZgiEBVGicRNBsWZEjnuUrZD2KGQgCTRgNO5xgwIgdCoEsEsnKPtmMOAkdft0lx-r-uNYpeW5JPPbrMbbPJsuKS37OT2Ve_GM-gHtHtg</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>Hybrid in-memory BFS-DFS approach for computing graph queries against homogeneous graphs inside relational database systems</title><source>esp@cenet</source><creator>Trigonakis, Vasileios ; Arnaboldi, Marco ; Hong, Sungpack ; Chavan, Shasank K ; Baetu, Ciprian ; Haprian, Vlad ; Daynes, Laurent ; Lozi, Jean-Pierre</creator><creatorcontrib>Trigonakis, Vasileios ; Arnaboldi, Marco ; Hong, Sungpack ; Chavan, Shasank K ; Baetu, Ciprian ; Haprian, Vlad ; Daynes, Laurent ; Lozi, Jean-Pierre</creatorcontrib><description>An in-memory graph query runtime is integrated inside a database management system and is capable of performing simple patter-matching queries against homogeneous graphs. The runtime efficiently combines breadth-first (BFS) and depth-first (DFS) neighbor traversal algorithms to achieve a hybrid runtime that takes the best from both sides. As a result, the hybrid runtime is able to process arbitrarily large queries with a fixed amount of memory, optimizing for memory locality.</description><language>eng</language><subject>CALCULATING ; COMPUTING ; COUNTING ; ELECTRIC DIGITAL DATA PROCESSING ; PHYSICS</subject><creationdate>2022</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=20220719&DB=EPODOC&CC=US&NR=11392624B2$$EHTML$$P50$$Gepo$$Hfree_for_read</linktohtml><link.rule.ids>230,308,776,881,25542,76289</link.rule.ids><linktorsrc>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&date=20220719&DB=EPODOC&CC=US&NR=11392624B2$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>Trigonakis, Vasileios</creatorcontrib><creatorcontrib>Arnaboldi, Marco</creatorcontrib><creatorcontrib>Hong, Sungpack</creatorcontrib><creatorcontrib>Chavan, Shasank K</creatorcontrib><creatorcontrib>Baetu, Ciprian</creatorcontrib><creatorcontrib>Haprian, Vlad</creatorcontrib><creatorcontrib>Daynes, Laurent</creatorcontrib><creatorcontrib>Lozi, Jean-Pierre</creatorcontrib><title>Hybrid in-memory BFS-DFS approach for computing graph queries against homogeneous graphs inside relational database systems</title><description>An in-memory graph query runtime is integrated inside a database management system and is capable of performing simple patter-matching queries against homogeneous graphs. The runtime efficiently combines breadth-first (BFS) and depth-first (DFS) neighbor traversal algorithms to achieve a hybrid runtime that takes the best from both sides. As a result, the hybrid runtime is able to process arbitrarily large queries with a fixed amount of memory, optimizing for memory locality.</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>2022</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNqNzLEOgjAQgGEWB6O-w_kADIAxcUUl7OhMDjjaJrRXe2Ugvrwk-gBO__Ll3ybveumCGcC41JLlsEBZNemtagC9D4y9hpED9Gz9HI1ToAJ6Da-ZgiEBVGicRNBsWZEjnuUrZD2KGQgCTRgNO5xgwIgdCoEsEsnKPtmMOAkdft0lx-r-uNYpeW5JPPbrMbbPJsuKS37OT2Ve_GM-gHtHtg</recordid><startdate>20220719</startdate><enddate>20220719</enddate><creator>Trigonakis, Vasileios</creator><creator>Arnaboldi, Marco</creator><creator>Hong, Sungpack</creator><creator>Chavan, Shasank K</creator><creator>Baetu, Ciprian</creator><creator>Haprian, Vlad</creator><creator>Daynes, Laurent</creator><creator>Lozi, Jean-Pierre</creator><scope>EVB</scope></search><sort><creationdate>20220719</creationdate><title>Hybrid in-memory BFS-DFS approach for computing graph queries against homogeneous graphs inside relational database systems</title><author>Trigonakis, Vasileios ; Arnaboldi, Marco ; Hong, Sungpack ; Chavan, Shasank K ; Baetu, Ciprian ; Haprian, Vlad ; Daynes, Laurent ; Lozi, Jean-Pierre</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_US11392624B23</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>eng</language><creationdate>2022</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>Arnaboldi, Marco</creatorcontrib><creatorcontrib>Hong, Sungpack</creatorcontrib><creatorcontrib>Chavan, Shasank K</creatorcontrib><creatorcontrib>Baetu, Ciprian</creatorcontrib><creatorcontrib>Haprian, Vlad</creatorcontrib><creatorcontrib>Daynes, Laurent</creatorcontrib><creatorcontrib>Lozi, Jean-Pierre</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Trigonakis, Vasileios</au><au>Arnaboldi, Marco</au><au>Hong, Sungpack</au><au>Chavan, Shasank K</au><au>Baetu, Ciprian</au><au>Haprian, Vlad</au><au>Daynes, Laurent</au><au>Lozi, Jean-Pierre</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>Hybrid in-memory BFS-DFS approach for computing graph queries against homogeneous graphs inside relational database systems</title><date>2022-07-19</date><risdate>2022</risdate><abstract>An in-memory graph query runtime is integrated inside a database management system and is capable of performing simple patter-matching queries against homogeneous graphs. The runtime efficiently combines breadth-first (BFS) and depth-first (DFS) neighbor traversal algorithms to achieve a hybrid runtime that takes the best from both sides. As a result, the hybrid runtime is able to process arbitrarily large queries with a fixed amount of memory, optimizing for memory locality.</abstract><oa>free_for_read</oa></addata></record>
fulltext	fulltext_linktorsrc
identifier
ispartof
issn
language	eng
recordid	cdi_epo_espacenet_US11392624B2
source	esp@cenet
subjects	CALCULATING COMPUTING COUNTING ELECTRIC DIGITAL DATA PROCESSING PHYSICS
title	Hybrid in-memory BFS-DFS approach for computing graph queries against homogeneous graphs inside relational database systems
url	https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-05T01%3A17%3A12IST&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=2022-07-19&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3EUS11392624B2%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