{"id":"https://openalex.org/W2613189058","doi":"https://doi.org/10.1145/3035918.3035955","title":"Landmark Indexing for Evaluation of Label-Constrained Reachability Queries","display_name":"Landmark Indexing for Evaluation of Label-Constrained Reachability Queries","publication_year":2017,"publication_date":"2017-05-09","ids":{"openalex":"https://openalex.org/W2613189058","doi":"https://doi.org/10.1145/3035918.3035955","mag":"2613189058"},"language":"en","primary_location":{"id":"doi:10.1145/3035918.3035955","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3035918.3035955","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2017 ACM International Conference on Management of Data","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/A5009979369","display_name":"Lucien D.J. Valstar","orcid":null},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Lucien D.J. Valstar","raw_affiliation_strings":["Eindhoven University of Technology, Eindhoven, Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Eindhoven University of Technology, Eindhoven, Netherlands","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5019818981","display_name":"George Fletcher","orcid":null},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"George H.L. Fletcher","raw_affiliation_strings":["Eindhoven University of Technology, Eindhoven, Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Eindhoven University of Technology, Eindhoven, Netherlands","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5038701345","display_name":"Yuichi Yoshida","orcid":"https://orcid.org/0000-0001-8919-8479"},"institutions":[{"id":"https://openalex.org/I184597095","display_name":"National Institute of Informatics","ror":"https://ror.org/04ksd4g47","country_code":"JP","type":"facility","lineage":["https://openalex.org/I1319490839","https://openalex.org/I184597095","https://openalex.org/I4210158934"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Yuichi Yoshida","raw_affiliation_strings":["National Institute of Informatics & Preferred Infrastructure, Inc., Tokyo, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"National Institute of Informatics & Preferred Infrastructure, Inc., Tokyo, Japan","institution_ids":["https://openalex.org/I184597095"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.4468,"has_fulltext":false,"cited_by_count":68,"citation_normalized_percentile":{"value":0.91621299,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"345","last_page":"358"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9998999834060669,"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.9998999834060669,"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.9991000294685364,"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.9984999895095825,"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.8091013431549072},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.731582522392273},{"id":"https://openalex.org/keywords/search-engine-indexing","display_name":"Search engine indexing","score":0.6772074103355408},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5487263798713684},{"id":"https://openalex.org/keywords/sparql","display_name":"SPARQL","score":0.530876874923706},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.507373034954071},{"id":"https://openalex.org/keywords/oracle","display_name":"Oracle","score":0.49259310960769653},{"id":"https://openalex.org/keywords/graph-database","display_name":"Graph database","score":0.43745455145835876},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.41799795627593994},{"id":"https://openalex.org/keywords/information-retrieval","display_name":"Information retrieval","score":0.299293577671051},{"id":"https://openalex.org/keywords/rdf","display_name":"RDF","score":0.2042885720729828},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.1208091676235199},{"id":"https://openalex.org/keywords/semantic-web","display_name":"Semantic Web","score":0.10798722505569458}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8091013431549072},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.731582522392273},{"id":"https://openalex.org/C75165309","wikidata":"https://www.wikidata.org/wiki/Q2258979","display_name":"Search engine indexing","level":2,"score":0.6772074103355408},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5487263798713684},{"id":"https://openalex.org/C41009113","wikidata":"https://www.wikidata.org/wiki/Q54871","display_name":"SPARQL","level":4,"score":0.530876874923706},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.507373034954071},{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.49259310960769653},{"id":"https://openalex.org/C176225458","wikidata":"https://www.wikidata.org/wiki/Q595971","display_name":"Graph database","level":3,"score":0.43745455145835876},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.41799795627593994},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.299293577671051},{"id":"https://openalex.org/C147497476","wikidata":"https://www.wikidata.org/wiki/Q54872","display_name":"RDF","level":3,"score":0.2042885720729828},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.1208091676235199},{"id":"https://openalex.org/C2129575","wikidata":"https://www.wikidata.org/wiki/Q54837","display_name":"Semantic Web","level":2,"score":0.10798722505569458}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/3035918.3035955","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3035918.3035955","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2017 ACM International Conference on Management of Data","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.tue.nl:openaire_cris_publications/5435282e-2645-48b4-9a01-2dcc7b9d594f","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/5435282e-2645-48b4-9a01-2dcc7b9d594f","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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Valstar, L D J, Fletcher, G H L & Yoshida, Y 2017, Landmark indexing for evaluation of label-constrained reachability queries. in Proceedings of the 2017 ACM SIGMOD International Conference on Management of Data (SIGMOD 2017) . Association for Computing Machinery, Inc., pp. 345-358, 2017 ACM SIGMOD International Conference on Management of Data (SIGMOD 2017), Chicago, Illinois, United States, 14/05/17. https://doi.org/10.1145/3035918.3035955","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:tue:oai:pure.tue.nl:publications/5435282e-2645-48b4-9a01-2dcc7b9d594f","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/5435282e-2645-48b4-9a01-2dcc7b9d594f","pdf_url":null,"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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Proceedings of the 2017 ACM SIGMOD International Conference on Management of Data (SIGMOD 2017), 345 - 358","raw_type":"info:eu-repo/semantics/conferencepaper"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/17","display_name":"Partnerships for the goals","score":0.49000000953674316}],"awards":[],"funders":[{"id":"https://openalex.org/F4320338112","display_name":"Exploratory Research for Advanced Technology","ror":null}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":39,"referenced_works":["https://openalex.org/W104377239","https://openalex.org/W131619556","https://openalex.org/W1421378112","https://openalex.org/W1502577746","https://openalex.org/W1553945535","https://openalex.org/W1968748479","https://openalex.org/W1971864278","https://openalex.org/W1977801463","https://openalex.org/W1984336731","https://openalex.org/W1988872756","https://openalex.org/W1994924587","https://openalex.org/W2005945380","https://openalex.org/W2011824721","https://openalex.org/W2017139167","https://openalex.org/W2018146256","https://openalex.org/W2021325937","https://openalex.org/W2059052871","https://openalex.org/W2059355721","https://openalex.org/W2061257729","https://openalex.org/W2078331965","https://openalex.org/W2087567316","https://openalex.org/W2097111141","https://openalex.org/W2121859659","https://openalex.org/W2131692673","https://openalex.org/W2142774324","https://openalex.org/W2148544545","https://openalex.org/W2152651944","https://openalex.org/W2296659056","https://openalex.org/W2442049918","https://openalex.org/W2469279958","https://openalex.org/W2474022715","https://openalex.org/W2493178615","https://openalex.org/W2532649759","https://openalex.org/W2573799103","https://openalex.org/W2755088640","https://openalex.org/W3013652274","https://openalex.org/W3099134950","https://openalex.org/W6697075189","https://openalex.org/W6728492374"],"related_works":["https://openalex.org/W2038821533","https://openalex.org/W2295889387","https://openalex.org/W76044956","https://openalex.org/W2786642168","https://openalex.org/W2951852920","https://openalex.org/W4302024884","https://openalex.org/W2784308500","https://openalex.org/W4385958747","https://openalex.org/W4362598466","https://openalex.org/W3095797869"],"abstract_inverted_index":{"Consider":[0],"a":[1,7,11,26,32,37,47,72,117],"directed":[2],"edge-labeled":[3],"graph,":[4],"such":[5,18,89],"as":[6,71,90,175],"social":[8],"network":[9],"or":[10],"citation":[12],"network.":[13],"A":[14],"fundamental":[15],"query":[16,87,166],"on":[17],"data":[19],"is":[20,25,173],"to":[21,36,109,161],"determine":[22],"if":[23],"there":[24],"path":[27,79],"in":[28,46,54,66,84,116],"the":[29,51,55,76,91,128],"graph":[30,67,86],"from":[31],"given":[33,38],"source":[34,177],"vertex":[35],"target":[39],"vertex,":[40],"using":[41],"only":[42],"edges":[43],"with":[44],"labels":[45,53],"restricted":[48],"subset":[49],"of":[50,75,120,163],"edge":[52],"graph.":[56],"Such":[57],"label-constrained":[58],"reachability":[59],"(LCR)":[60],"queries":[61,80],"play":[62],"an":[63],"important":[64],"role":[65],"analytics,":[68],"for":[69,102,132,139,178],"example,":[70],"core":[73],"fragment":[74],"so-called":[77],"regular":[78],"which":[81,112],"are":[82,113,150],"supported":[83],"practical":[85,130],"languages":[88],"W3C's":[92],"SPARQL":[93],"1.1,":[94],"Neo4j's":[95],"Cypher,":[96],"and":[97],"Oracle's":[98],"PGQL.":[99],"Current":[100],"solutions":[101],"LCR":[103,134,155],"evaluation,":[104,135],"however,":[105],"do":[106],"not":[107],"scale":[108],"large":[110,140],"graphs":[111],"increasingly":[114],"common":[115],"broad":[118],"range":[119],"application":[121],"domains.":[122],"In":[123],"this":[124],"paper":[125],"we":[126],"present":[127],"first":[129],"solution":[131],"efficient":[133],"leveraging":[136],"landmark-based":[137],"indexes":[138,149],"graphs.":[141],"We":[142],"show":[143],"through":[144],"extensive":[145],"experiments":[146],"that":[147],"our":[148],"significantly":[151],"smaller":[152],"than":[153],"state-of-the-art":[154],"indexing":[156],"techniques,":[157],"while":[158],"supporting":[159],"up":[160],"orders":[162],"magnitude":[164],"faster":[165],"evaluation":[167],"times.":[168],"Our":[169],"complete":[170],"C++":[171],"codebase":[172],"available":[174],"open":[176],"further":[179],"research.":[180]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":9},{"year":2023,"cited_by_count":13},{"year":2022,"cited_by_count":11},{"year":2021,"cited_by_count":16},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}