{"id":"https://openalex.org/W2622037077","doi":"https://doi.org/10.1145/3078447.3078458","title":"An Analysis of the Feasibility of Graph Compression Techniques for Indexing Regular Path Queries","display_name":"An Analysis of the Feasibility of Graph Compression Techniques for Indexing Regular Path Queries","publication_year":2017,"publication_date":"2017-05-19","ids":{"openalex":"https://openalex.org/W2622037077","doi":"https://doi.org/10.1145/3078447.3078458","mag":"2622037077"},"language":"en","primary_location":{"id":"doi:10.1145/3078447.3078458","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3078447.3078458","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Fifth International Workshop on Graph Data-management Experiences &amp; Systems","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://tud.qucosa.de/id/qucosa%3A79449","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5073059932","display_name":"Frank Tetzel","orcid":null},"institutions":[{"id":"https://openalex.org/I78650965","display_name":"TU Dresden","ror":"https://ror.org/042aqky30","country_code":"DE","type":"education","lineage":["https://openalex.org/I78650965"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Frank Tetzel","raw_affiliation_strings":["Dresden Database Systems Group, Technische Universit\u00e4t Dresden"],"affiliations":[{"raw_affiliation_string":"Dresden Database Systems Group, Technische Universit\u00e4t Dresden","institution_ids":["https://openalex.org/I78650965"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5045308974","display_name":"Hannes Voigt","orcid":"https://orcid.org/0000-0002-2148-9592"},"institutions":[{"id":"https://openalex.org/I78650965","display_name":"TU Dresden","ror":"https://ror.org/042aqky30","country_code":"DE","type":"education","lineage":["https://openalex.org/I78650965"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Hannes Voigt","raw_affiliation_strings":["Dresden Database Systems Group, Technische Universit\u00e4t Dresden"],"affiliations":[{"raw_affiliation_string":"Dresden Database Systems Group, Technische Universit\u00e4t Dresden","institution_ids":["https://openalex.org/I78650965"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5032969324","display_name":"Marcus Paradies","orcid":"https://orcid.org/0000-0002-5743-6580"},"institutions":[{"id":"https://openalex.org/I4210133614","display_name":"Systems, Applications & Products in Data Processing (United Kingdom)","ror":"https://ror.org/04k7gd586","country_code":"GB","type":"company","lineage":["https://openalex.org/I4210132444","https://openalex.org/I4210133614"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Marcus Paradies","raw_affiliation_strings":["SAP SE"],"affiliations":[{"raw_affiliation_string":"SAP SE","institution_ids":["https://openalex.org/I4210133614"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5063512642","display_name":"Wolfgang Lehner","orcid":"https://orcid.org/0000-0001-8107-2775"},"institutions":[{"id":"https://openalex.org/I78650965","display_name":"TU Dresden","ror":"https://ror.org/042aqky30","country_code":"DE","type":"education","lineage":["https://openalex.org/I78650965"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Wolfgang Lehner","raw_affiliation_strings":["Dresden Database Systems Group, Technische Universit\u00e4t Dresden"],"affiliations":[{"raw_affiliation_string":"Dresden Database Systems Group, Technische Universit\u00e4t Dresden","institution_ids":["https://openalex.org/I78650965"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5073059932"],"corresponding_institution_ids":["https://openalex.org/I78650965"],"apc_list":null,"apc_paid":null,"fwci":0.1847,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.55849953,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9994999766349792,"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.9994999766349792,"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.9990000128746033,"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"}},{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9987000226974487,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/search-engine-indexing","display_name":"Search engine indexing","score":0.7975489497184753},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7860903739929199},{"id":"https://openalex.org/keywords/path-expression","display_name":"Path expression","score":0.6572331786155701},{"id":"https://openalex.org/keywords/pattern-matching","display_name":"Pattern matching","score":0.535047173500061},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5156844854354858},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4990880489349365},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4657483994960785},{"id":"https://openalex.org/keywords/sparql","display_name":"SPARQL","score":0.45599454641342163},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.43513065576553345},{"id":"https://openalex.org/keywords/query-language","display_name":"Query language","score":0.366426557302475},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.2756170630455017},{"id":"https://openalex.org/keywords/information-retrieval","display_name":"Information retrieval","score":0.23493251204490662},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.16725489497184753},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.15833327174186707},{"id":"https://openalex.org/keywords/rdf","display_name":"RDF","score":0.1257190704345703},{"id":"https://openalex.org/keywords/semantic-web","display_name":"Semantic Web","score":0.0949150025844574},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.09141913056373596}],"concepts":[{"id":"https://openalex.org/C75165309","wikidata":"https://www.wikidata.org/wiki/Q2258979","display_name":"Search engine indexing","level":2,"score":0.7975489497184753},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7860903739929199},{"id":"https://openalex.org/C61114434","wikidata":"https://www.wikidata.org/wiki/Q7144649","display_name":"Path expression","level":3,"score":0.6572331786155701},{"id":"https://openalex.org/C68859911","wikidata":"https://www.wikidata.org/wiki/Q1503724","display_name":"Pattern matching","level":2,"score":0.535047173500061},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5156844854354858},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4990880489349365},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4657483994960785},{"id":"https://openalex.org/C41009113","wikidata":"https://www.wikidata.org/wiki/Q54871","display_name":"SPARQL","level":4,"score":0.45599454641342163},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.43513065576553345},{"id":"https://openalex.org/C192028432","wikidata":"https://www.wikidata.org/wiki/Q845739","display_name":"Query language","level":2,"score":0.366426557302475},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.2756170630455017},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.23493251204490662},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.16725489497184753},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.15833327174186707},{"id":"https://openalex.org/C147497476","wikidata":"https://www.wikidata.org/wiki/Q54872","display_name":"RDF","level":3,"score":0.1257190704345703},{"id":"https://openalex.org/C2129575","wikidata":"https://www.wikidata.org/wiki/Q54837","display_name":"Semantic Web","level":2,"score":0.0949150025844574},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.09141913056373596},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3078447.3078458","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3078447.3078458","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Fifth International Workshop on Graph Data-management Experiences &amp; Systems","raw_type":"proceedings-article"},{"id":"pmh:oai:qucosa:de:qucosa:79449","is_oa":true,"landing_page_url":"https://tud.qucosa.de/id/qucosa%3A79449","pdf_url":null,"source":{"id":"https://openalex.org/S4377196312","display_name":"Qucosa (Saxon State and University Library Dresden)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I3132420320","host_organization_name":"SLUB Dresden","host_organization_lineage":["https://openalex.org/I3132420320"],"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":null,"raw_type":"doc-type:Text"}],"best_oa_location":{"id":"pmh:oai:qucosa:de:qucosa:79449","is_oa":true,"landing_page_url":"https://tud.qucosa.de/id/qucosa%3A79449","pdf_url":null,"source":{"id":"https://openalex.org/S4377196312","display_name":"Qucosa (Saxon State and University Library Dresden)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I3132420320","host_organization_name":"SLUB Dresden","host_organization_lineage":["https://openalex.org/I3132420320"],"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":null,"raw_type":"doc-type:Text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W41893858","https://openalex.org/W1582690601","https://openalex.org/W1582803813","https://openalex.org/W1968748479","https://openalex.org/W2017333496","https://openalex.org/W2018900730","https://openalex.org/W2023810566","https://openalex.org/W2092860912","https://openalex.org/W2121859659","https://openalex.org/W2135282325","https://openalex.org/W2148544545","https://openalex.org/W2184625228","https://openalex.org/W2293524909","https://openalex.org/W2399656549","https://openalex.org/W2404490303","https://openalex.org/W2442049918","https://openalex.org/W2474022715","https://openalex.org/W2493178615","https://openalex.org/W2572635540","https://openalex.org/W2613189058","https://openalex.org/W3099134950"],"related_works":["https://openalex.org/W1574546694","https://openalex.org/W1821144310","https://openalex.org/W2614542053","https://openalex.org/W3193425175","https://openalex.org/W2494918970","https://openalex.org/W2098306546","https://openalex.org/W610744264","https://openalex.org/W2313707335","https://openalex.org/W3000294084","https://openalex.org/W2159845841"],"abstract_inverted_index":{"Regular":[0],"path":[1,23],"queries":[2],"(RPQs)":[3],"are":[4],"a":[5,29],"fundamental":[6],"part":[7],"of":[8,21,38,61],"recent":[9],"graph":[10,41],"query":[11],"languages":[12],"like":[13],"SPARQL":[14],"and":[15],"PGQL.":[16],"They":[17],"allow":[18],"the":[19,36,39,58],"definition":[20],"recursive":[22],"structures":[24],"through":[25],"regular":[26],"expressions":[27],"in":[28],"declarative":[30],"pattern":[31],"matching":[32],"environment.":[33],"We":[34],"study":[35],"use":[37],"K2-tree":[40],"compression":[42],"technique":[43],"to":[44],"materialize":[45],"RPQ":[46],"results":[47],"with":[48],"low":[49],"memory":[50],"consumption":[51],"for":[52,64],"indexing.":[53],"Compact":[54],"index":[55],"representations":[56],"enable":[57],"efficient":[59],"storage":[60],"multiple":[62],"indexes":[63],"varying":[65],"RPQs.":[66]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}
