{"id":"https://openalex.org/W2794919314","doi":"https://doi.org/10.5441/002/edbt.2017.47","title":"TASWEET: Optimizing Disjunctive Path Queries in Graph Databases","display_name":"TASWEET: Optimizing Disjunctive Path Queries in Graph Databases","publication_year":2017,"publication_date":"2017-01-01","ids":{"openalex":"https://openalex.org/W2794919314","doi":"https://doi.org/10.5441/002/edbt.2017.47","mag":"2794919314"},"language":"en","primary_location":{"id":"pmh:oai:pure.tue.nl:openaire/e225fd60-e048-4e6b-b4f1-c87df25c5a8e","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/e225fd60-e048-4e6b-b4f1-c87df25c5a8e","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Abul-Basher, Z, Yakovets, N, Godfrey, P, Ghajar-Khosravi, S & Chignell, M H 2017, TASWEET : optimizing disjunctive regular path queries in graph databases. in B Mitschang, V Markl, S Bress, P Andritsos, K-U Sattler & S Orlando (eds), 20th International Conference on Extending Database Technology, 21-24 march 2017, Venice, Italy. pp. 470-473, EDBT/ICDT 2017 Joint Conference 20th International Conference on Extending Database Technology, Venice, Italy, 21/03/17. https://doi.org/10.5441/002/edbt.2017.47","raw_type":"info:eu-repo/semantics/publishedVersion"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://research.tue.nl/en/publications/e225fd60-e048-4e6b-b4f1-c87df25c5a8e","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5070754459","display_name":"Zahid Abul-Basher","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Abul-Basher, Zahid","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5082856403","display_name":"Nikolay Yakovets","orcid":"https://orcid.org/0000-0002-1488-1414"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yakovets, Nikolay","raw_affiliation_strings":["Information Systems WSK&I"],"affiliations":[{"raw_affiliation_string":"Information Systems WSK&I","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5000797802","display_name":"Parke Godfrey","orcid":"https://orcid.org/0000-0002-2082-1864"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Godfrey, Parke","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5036382031","display_name":"Shadi Ghajar-Khosravi","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ghajar-Khosrav, Shadi","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5039024869","display_name":"Mark Chignell","orcid":"https://orcid.org/0000-0001-8120-6905"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Chignell, Mark","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5070754459"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":6,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"470","last_page":"473"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T11106","display_name":"Data Management and Algorithms","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9973000288009644,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9947999715805054,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.8304446935653687},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.615868330001831},{"id":"https://openalex.org/keywords/sparql","display_name":"SPARQL","score":0.6134048104286194},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5914329290390015},{"id":"https://openalex.org/keywords/query-plan","display_name":"Query plan","score":0.5731759071350098},{"id":"https://openalex.org/keywords/graph-database","display_name":"Graph database","score":0.5411121249198914},{"id":"https://openalex.org/keywords/materialized-view","display_name":"Materialized view","score":0.4776826500892639},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.47394588589668274},{"id":"https://openalex.org/keywords/query-language","display_name":"Query language","score":0.44796374440193176},{"id":"https://openalex.org/keywords/path-expression","display_name":"Path expression","score":0.420881986618042},{"id":"https://openalex.org/keywords/domain","display_name":"Domain (mathematical analysis)","score":0.41764718294143677},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.41284361481666565},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.397850900888443},{"id":"https://openalex.org/keywords/information-retrieval","display_name":"Information retrieval","score":0.301379919052124},{"id":"https://openalex.org/keywords/web-search-query","display_name":"Web search query","score":0.2234962284564972},{"id":"https://openalex.org/keywords/rdf","display_name":"RDF","score":0.16223570704460144},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.149857759475708},{"id":"https://openalex.org/keywords/view","display_name":"View","score":0.13811516761779785},{"id":"https://openalex.org/keywords/semantic-web","display_name":"Semantic Web","score":0.1201682984828949},{"id":"https://openalex.org/keywords/search-engine","display_name":"Search engine","score":0.11750778555870056},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.11435064673423767},{"id":"https://openalex.org/keywords/database-design","display_name":"Database design","score":0.10875862836837769},{"id":"https://openalex.org/keywords/sargable","display_name":"Sargable","score":0.10680252313613892},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.10146605968475342}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8304446935653687},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.615868330001831},{"id":"https://openalex.org/C41009113","wikidata":"https://www.wikidata.org/wiki/Q54871","display_name":"SPARQL","level":4,"score":0.6134048104286194},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5914329290390015},{"id":"https://openalex.org/C2779729312","wikidata":"https://www.wikidata.org/wiki/Q784232","display_name":"Query plan","level":5,"score":0.5731759071350098},{"id":"https://openalex.org/C176225458","wikidata":"https://www.wikidata.org/wiki/Q595971","display_name":"Graph database","level":3,"score":0.5411121249198914},{"id":"https://openalex.org/C98199447","wikidata":"https://www.wikidata.org/wiki/Q2445044","display_name":"Materialized view","level":4,"score":0.4776826500892639},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.47394588589668274},{"id":"https://openalex.org/C192028432","wikidata":"https://www.wikidata.org/wiki/Q845739","display_name":"Query language","level":2,"score":0.44796374440193176},{"id":"https://openalex.org/C61114434","wikidata":"https://www.wikidata.org/wiki/Q7144649","display_name":"Path expression","level":3,"score":0.420881986618042},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.41764718294143677},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.41284361481666565},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.397850900888443},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.301379919052124},{"id":"https://openalex.org/C164120249","wikidata":"https://www.wikidata.org/wiki/Q995982","display_name":"Web search query","level":3,"score":0.2234962284564972},{"id":"https://openalex.org/C147497476","wikidata":"https://www.wikidata.org/wiki/Q54872","display_name":"RDF","level":3,"score":0.16223570704460144},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.149857759475708},{"id":"https://openalex.org/C54239708","wikidata":"https://www.wikidata.org/wiki/Q1329910","display_name":"View","level":3,"score":0.13811516761779785},{"id":"https://openalex.org/C2129575","wikidata":"https://www.wikidata.org/wiki/Q54837","display_name":"Semantic Web","level":2,"score":0.1201682984828949},{"id":"https://openalex.org/C97854310","wikidata":"https://www.wikidata.org/wiki/Q19541","display_name":"Search engine","level":2,"score":0.11750778555870056},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.11435064673423767},{"id":"https://openalex.org/C148840519","wikidata":"https://www.wikidata.org/wiki/Q1049878","display_name":"Database design","level":2,"score":0.10875862836837769},{"id":"https://openalex.org/C192939062","wikidata":"https://www.wikidata.org/wiki/Q104840822","display_name":"Sargable","level":4,"score":0.10680252313613892},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.10146605968475342},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"pmh:oai:pure.tue.nl:openaire/e225fd60-e048-4e6b-b4f1-c87df25c5a8e","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/e225fd60-e048-4e6b-b4f1-c87df25c5a8e","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Abul-Basher, Z, Yakovets, N, Godfrey, P, Ghajar-Khosravi, S & Chignell, M H 2017, TASWEET : optimizing disjunctive regular path queries in graph databases. in B Mitschang, V Markl, S Bress, P Andritsos, K-U Sattler & S Orlando (eds), 20th International Conference on Extending Database Technology, 21-24 march 2017, Venice, Italy. pp. 470-473, EDBT/ICDT 2017 Joint Conference 20th International Conference on Extending Database Technology, Venice, Italy, 21/03/17. https://doi.org/10.5441/002/edbt.2017.47","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:tue:oai:pure.tue.nl:publications/e225fd60-e048-4e6b-b4f1-c87df25c5a8e","is_oa":true,"landing_page_url":"https://research.tue.nl/nl/publications/e225fd60-e048-4e6b-b4f1-c87df25c5a8e","pdf_url":"https://research.tue.nl/nl/publications/e225fd60-e048-4e6b-b4f1-c87df25c5a8e","source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"20th International Conference on Extending Database Technology, 21-24 march 2017, Venice, Italy, 470 - 473","raw_type":"info:eu-repo/semantics/conferencepaper"},{"id":"doi:10.5441/002/edbt.2017.47","is_oa":true,"landing_page_url":"https://doi.org/10.5441/002/edbt.2017.47","pdf_url":null,"source":{"id":"https://openalex.org/S7407053003","display_name":"Movebank","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"dataset"},{"id":"mag:2794919314","is_oa":false,"landing_page_url":"https://pure.tue.nl/ws/files/91614053/tasweet.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306418406","display_name":"Extending Database Technology","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"Extending Database Technology","raw_type":null}],"best_oa_location":{"id":"pmh:oai:pure.tue.nl:openaire/e225fd60-e048-4e6b-b4f1-c87df25c5a8e","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/e225fd60-e048-4e6b-b4f1-c87df25c5a8e","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Abul-Basher, Z, Yakovets, N, Godfrey, P, Ghajar-Khosravi, S & Chignell, M H 2017, TASWEET : optimizing disjunctive regular path queries in graph databases. in B Mitschang, V Markl, S Bress, P Andritsos, K-U Sattler & S Orlando (eds), 20th International Conference on Extending Database Technology, 21-24 march 2017, Venice, Italy. pp. 470-473, EDBT/ICDT 2017 Joint Conference 20th International Conference on Extending Database Technology, Venice, Italy, 21/03/17. https://doi.org/10.5441/002/edbt.2017.47","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2266730682","https://openalex.org/W2260928372","https://openalex.org/W581540525","https://openalex.org/W2562053008","https://openalex.org/W2505546651","https://openalex.org/W2983883085","https://openalex.org/W95813568","https://openalex.org/W72933480","https://openalex.org/W2922433192","https://openalex.org/W1709132509","https://openalex.org/W2626002822","https://openalex.org/W2279567417","https://openalex.org/W2126064871","https://openalex.org/W2757542261","https://openalex.org/W1649428069","https://openalex.org/W121900809","https://openalex.org/W2527917511","https://openalex.org/W2259181357","https://openalex.org/W2512120695","https://openalex.org/W2337199682"],"abstract_inverted_index":{"Regular":[0],"path":[1,55,73,109],"queries":[2,74,85,117],"(RPQs)":[3],"have":[4,64,91],"quickly":[5],"become":[6],"a":[7,25,104,120],"staple":[8],"to":[9,41,48,52,98,118],"explore":[10],"graph":[11],"databases.":[12],"SPARQL":[13],"1.1":[14],"includes":[15],"prop-":[16],"erty":[17],"paths,":[18],"and":[19],"so":[20],"now":[21],"encompasses":[22],"RPQs":[23],"as":[24],"fragment.":[26],"Despite":[27],"the":[28,69,81,113,116,127,131],"extreme":[29],"utility":[30],"of":[31,71,130,143],"RPQs,":[32],"it":[33],"can":[34,95],"be":[35,96],"exceedingly":[36],"difficult":[37],"for":[38,50,106],"even":[39],"experts":[40],"formulate":[42,53],"such":[43,54],"queries.":[44,56],"It":[45],"is":[46],"next":[47],"impossible":[49],"non-experts":[51],"As":[57],"such,":[58],"several":[59],"visual":[60,78],"query":[61],"systems":[62],"(VQSs)":[63],"been":[65],"proposed":[66],"which":[67,111],"simplify":[68],"task":[70],"constructing":[72],"by":[75,87],"directly":[76],"manipulating":[77],"objects":[79],"representing":[80],"domain":[82],"elements.":[83],"The":[84],"generated":[86],"VQSs":[88],"may,":[89],"however,":[90],"many":[92],"commonalities":[93,114],"that":[94],"exploited":[97],"optimize":[99],"globally.":[100],"We":[101],"introduce":[102],"Tasweet,":[103],"framework":[105],"optimizing":[107],"\u201cdisjunctive\u201d":[108],"queries,":[110],"detects":[112],"among":[115],"find":[119],"globally":[121],"opti-":[122],"mized":[123],"execution":[124],"plan":[125,128],"over":[126],"spaces":[129],"constituent":[132],"RPQs.":[133],"Our":[134],"results":[135],"show":[136],"savings":[137],"in":[138],"edge-walks":[139],"/":[140],"time-to-":[141],"completion":[142],"59%.":[144]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T06:51:31.235846","created_date":"2025-10-10T00:00:00"}