{"id":"https://openalex.org/W3197639832","doi":"https://doi.org/10.1145/3472163.3472269","title":"On Efficiently Equi-Joining Graphs","display_name":"On Efficiently Equi-Joining Graphs","publication_year":2021,"publication_date":"2021-07-14","ids":{"openalex":"https://openalex.org/W3197639832","doi":"https://doi.org/10.1145/3472163.3472269","mag":"3197639832"},"language":"en","primary_location":{"id":"doi:10.1145/3472163.3472269","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3472163.3472269","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"25th International Database Engineering & Applications Symposium","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5015269262","display_name":"Giacomo Bergami","orcid":"https://orcid.org/0000-0002-1844-0851"},"institutions":[{"id":"https://openalex.org/I171543936","display_name":"Free University of Bozen-Bolzano","ror":"https://ror.org/012ajp527","country_code":"IT","type":"education","lineage":["https://openalex.org/I171543936"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Giacomo Bergami","raw_affiliation_strings":["Free University of Bozen-Bolzano, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Free University of Bozen-Bolzano, Italy","institution_ids":["https://openalex.org/I171543936"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5015269262"],"corresponding_institution_ids":["https://openalex.org/I171543936"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"222","last_page":"231"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11273","display_name":"Advanced Graph Neural Networks","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12016","display_name":"Web Data Mining and Analysis","score":0.9934999942779541,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8198182582855225},{"id":"https://openalex.org/keywords/joins","display_name":"Joins","score":0.7742756605148315},{"id":"https://openalex.org/keywords/sparql","display_name":"SPARQL","score":0.7171072959899902},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.6705933213233948},{"id":"https://openalex.org/keywords/graph-database","display_name":"Graph database","score":0.5836066603660583},{"id":"https://openalex.org/keywords/graph-traversal","display_name":"Graph traversal","score":0.5664253830909729},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5533369779586792},{"id":"https://openalex.org/keywords/automatic-summarization","display_name":"Automatic summarization","score":0.5173211097717285},{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.5073954463005066},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.47163769602775574},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4655158519744873},{"id":"https://openalex.org/keywords/join","display_name":"Join (topology)","score":0.4538577198982239},{"id":"https://openalex.org/keywords/rdf","display_name":"RDF","score":0.3243100047111511},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.23122459650039673},{"id":"https://openalex.org/keywords/information-retrieval","display_name":"Information retrieval","score":0.22645604610443115},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.20561736822128296},{"id":"https://openalex.org/keywords/semantic-web","display_name":"Semantic Web","score":0.13640925288200378},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.11491924524307251},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.10713091492652893}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8198182582855225},{"id":"https://openalex.org/C2778692605","wikidata":"https://www.wikidata.org/wiki/Q4041866","display_name":"Joins","level":2,"score":0.7742756605148315},{"id":"https://openalex.org/C41009113","wikidata":"https://www.wikidata.org/wiki/Q54871","display_name":"SPARQL","level":4,"score":0.7171072959899902},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6705933213233948},{"id":"https://openalex.org/C176225458","wikidata":"https://www.wikidata.org/wiki/Q595971","display_name":"Graph database","level":3,"score":0.5836066603660583},{"id":"https://openalex.org/C96333769","wikidata":"https://www.wikidata.org/wiki/Q907955","display_name":"Graph traversal","level":3,"score":0.5664253830909729},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5533369779586792},{"id":"https://openalex.org/C170858558","wikidata":"https://www.wikidata.org/wiki/Q1394144","display_name":"Automatic summarization","level":2,"score":0.5173211097717285},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.5073954463005066},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.47163769602775574},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4655158519744873},{"id":"https://openalex.org/C2776124973","wikidata":"https://www.wikidata.org/wiki/Q3183033","display_name":"Join (topology)","level":2,"score":0.4538577198982239},{"id":"https://openalex.org/C147497476","wikidata":"https://www.wikidata.org/wiki/Q54872","display_name":"RDF","level":3,"score":0.3243100047111511},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.23122459650039673},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.22645604610443115},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.20561736822128296},{"id":"https://openalex.org/C2129575","wikidata":"https://www.wikidata.org/wiki/Q54837","display_name":"Semantic Web","level":2,"score":0.13640925288200378},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.11491924524307251},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.10713091492652893}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3472163.3472269","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3472163.3472269","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"25th International Database Engineering & Applications Symposium","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W13682356","https://openalex.org/W125598877","https://openalex.org/W1903353709","https://openalex.org/W2012459404","https://openalex.org/W2022322548","https://openalex.org/W2048812944","https://openalex.org/W2059330764","https://openalex.org/W2067674168","https://openalex.org/W2068015060","https://openalex.org/W2135827982","https://openalex.org/W2375206141","https://openalex.org/W2490805901","https://openalex.org/W2537623931","https://openalex.org/W2564682724","https://openalex.org/W2613386233","https://openalex.org/W2620315948","https://openalex.org/W2753439427","https://openalex.org/W2803509652","https://openalex.org/W2889037731","https://openalex.org/W2912979784","https://openalex.org/W2963214303","https://openalex.org/W3004555699","https://openalex.org/W3105134183","https://openalex.org/W4247914182","https://openalex.org/W6662541620"],"related_works":["https://openalex.org/W90181605","https://openalex.org/W2786642168","https://openalex.org/W254087694","https://openalex.org/W1817956424","https://openalex.org/W2257872492","https://openalex.org/W2610945334","https://openalex.org/W2124426664","https://openalex.org/W3094989083","https://openalex.org/W1964226569","https://openalex.org/W3003227998"],"abstract_inverted_index":{"Despite":[0],"the":[1,18,21,37,74,86,89,103,120,128],"growing":[2],"popularity":[3],"of":[4,42,88],"techniques":[5],"related":[6],"to":[7,61],"graph":[8,46,76,129],"summarization,":[9],"a":[10,68],"general":[11],"operator":[12],"for":[13],"joining":[14],"graphs":[15],"on":[16,95,127],"both":[17],"vertices":[19],"and":[20,31,39,45,64,100,102,122],"edges":[22,115],"is":[23,59,77],"still":[24],"missing.":[25],"Current":[26],"languages":[27],"such":[28,97,106],"as":[29,98,107],"Cypher":[30],"SPARQL":[32],"express":[33],"binary":[34],"joins":[35,66],"through":[36],"non-scalable":[38],"inefficient":[40],"composition":[41],"multiple":[43],"traversal":[44],"creation":[47],"operations.":[48],"In":[49],"this":[50],"paper,":[51],"we":[52,110],"propose":[53,111],"an":[54],"efficient":[55],"equi-join":[56],"algorithm":[57],"that":[58,85,141],"able":[60],"perform":[62],"vertex":[63],"path":[65],"over":[67,147],"secondary":[69,80],"memory":[70],"indexed":[71],"graph,":[72],"also":[73,133],"resulting":[75],"serialised":[78],"in":[79],"memory.":[81],"The":[82],"results":[83],"show":[84],"implementation":[87],"proposed":[90],"model":[91],"outperforms":[92,144],"solutions":[93],"based":[94],"graphs,":[96],"Neo4J":[99],"Virtuoso,":[101],"relational":[104],"model,":[105],"PostgreSQL.":[108,148],"Moreover,":[109],"two":[112],"ways":[113],"how":[114],"can":[116],"be":[117],"combined,":[118],"namely":[119],"conjunctive":[121,130],"disjunctive":[123],"semantics,":[124],"Preliminary":[125],"experiments":[126],"join":[131],"are":[132],"carried":[134],"out":[135],"with":[136],"incremental":[137],"updates,":[138],"thus":[139],"suggesting":[140],"our":[142],"solution":[143],"materialized":[145],"views":[146]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}