{"id":"https://openalex.org/W3139741119","doi":"https://doi.org/10.1109/ideas.2007.4318092","title":"Boundedness of Regular Path Queries in Data Integration Systems","display_name":"Boundedness of Regular Path Queries in Data Integration Systems","publication_year":2007,"publication_date":"2007-09-01","ids":{"openalex":"https://openalex.org/W3139741119","doi":"https://doi.org/10.1109/ideas.2007.4318092","mag":"3139741119"},"language":"en","primary_location":{"id":"doi:10.1109/ideas.2007.4318092","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ideas.2007.4318092","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"11th International Database Engineering and Applications Symposium (IDEAS 2007)","raw_type":"proceedings-article"},"type":"article","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/A5005714968","display_name":"G\u00f6sta Grahne","orcid":null},"institutions":[{"id":"https://openalex.org/I60158472","display_name":"Concordia University","ror":"https://ror.org/0420zvk78","country_code":"CA","type":"education","lineage":["https://openalex.org/I60158472"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Gosta Grahne","raw_affiliation_strings":["Concordia University, QUE, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Concordia University, QUE, Canada","institution_ids":["https://openalex.org/I60158472"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5011013528","display_name":"Alex Thomo","orcid":"https://orcid.org/0000-0002-3020-2258"},"institutions":[{"id":"https://openalex.org/I212119943","display_name":"University of Victoria","ror":"https://ror.org/04s5mat29","country_code":"CA","type":"education","lineage":["https://openalex.org/I212119943"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Alex Thomo","raw_affiliation_strings":["University of Victoria, BC, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Victoria, BC, Canada","institution_ids":["https://openalex.org/I212119943"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.44285052,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"1","issue":null,"first_page":"85","last_page":"92"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10317","display_name":"Advanced Database Systems and Queries","score":0.9997000098228455,"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"}},"topics":[{"id":"https://openalex.org/T10317","display_name":"Advanced Database Systems and Queries","score":0.9997000098228455,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9983999729156494,"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/T11567","display_name":"semigroups and automata theory","score":0.9979000091552734,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/recursion","display_name":"Recursion (computer science)","score":0.8457108736038208},{"id":"https://openalex.org/keywords/constructive","display_name":"Constructive","score":0.6270604133605957},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.5798265933990479},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5609961748123169},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.49567949771881104},{"id":"https://openalex.org/keywords/p","display_name":"P","score":0.46344876289367676},{"id":"https://openalex.org/keywords/pspace","display_name":"PSPACE","score":0.45683521032333374},{"id":"https://openalex.org/keywords/query-language","display_name":"Query language","score":0.437447726726532},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.41568225622177124},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4047201871871948},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3409942090511322},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.33263254165649414},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.2789623737335205},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2442052662372589},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.1958605945110321},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.13308709859848022},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.09536439180374146},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.08973094820976257}],"concepts":[{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.8457108736038208},{"id":"https://openalex.org/C2778701210","wikidata":"https://www.wikidata.org/wiki/Q28130034","display_name":"Constructive","level":3,"score":0.6270604133605957},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.5798265933990479},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5609961748123169},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.49567949771881104},{"id":"https://openalex.org/C134026603","wikidata":"https://www.wikidata.org/wiki/Q846354","display_name":"P","level":3,"score":0.46344876289367676},{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.45683521032333374},{"id":"https://openalex.org/C192028432","wikidata":"https://www.wikidata.org/wiki/Q845739","display_name":"Query language","level":2,"score":0.437447726726532},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.41568225622177124},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4047201871871948},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3409942090511322},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.33263254165649414},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2789623737335205},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2442052662372589},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.1958605945110321},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.13308709859848022},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.09536439180374146},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.08973094820976257},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ideas.2007.4318092","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ideas.2007.4318092","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"11th International Database Engineering and Applications Symposium (IDEAS 2007)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W85883491","https://openalex.org/W1480292905","https://openalex.org/W1528804268","https://openalex.org/W1535627680","https://openalex.org/W1550673449","https://openalex.org/W1571593392","https://openalex.org/W1952678003","https://openalex.org/W1976580206","https://openalex.org/W1982206794","https://openalex.org/W1992673035","https://openalex.org/W2033147602","https://openalex.org/W2035641287","https://openalex.org/W2046829789","https://openalex.org/W2052596638","https://openalex.org/W2067210069","https://openalex.org/W2070999664","https://openalex.org/W2084532411","https://openalex.org/W2088360142","https://openalex.org/W2110616577","https://openalex.org/W2126004201","https://openalex.org/W2135282325","https://openalex.org/W2165854715","https://openalex.org/W2277019236","https://openalex.org/W2773069775","https://openalex.org/W3007065685","https://openalex.org/W4302339081","https://openalex.org/W6607705436","https://openalex.org/W6633933537","https://openalex.org/W6678760027"],"related_works":["https://openalex.org/W3204615532","https://openalex.org/W2026191634","https://openalex.org/W4211259775","https://openalex.org/W1536078516","https://openalex.org/W2404907747","https://openalex.org/W2270021366","https://openalex.org/W2027321599","https://openalex.org/W2162177529","https://openalex.org/W1984423678","https://openalex.org/W2299982751"],"abstract_inverted_index":{"In":[0],"this":[1],"paper":[2],"we":[3,57,81],"study":[4],"the":[5,29,38,55,76,87],"problem":[6,25,89],"of":[7,46,48,54,79,90],"deciding":[8],"whether":[9],"a":[10,64],"regular":[11,49,69],"path":[12,50,70],"query":[13,39],"over":[14],"views":[15,30],"in":[16,37,72,92],"data-integration":[17,73],"systems":[18],"can":[19],"be":[20],"re-expressed":[21],"without":[22],"recursion.":[23],"The":[24],"becomes":[26],"challenging":[27],"when":[28],"contain":[31],"recursion,":[32],"thereby":[33],"potentially":[34],"making":[35],"recursion":[36],"unecessary.":[40],"We":[41],"define":[42],"two":[43],"related":[44],"notions":[45,56],"boundedness":[47],"queries.":[51],"For":[52,75],"one":[53],"show":[58,82],"it":[59,83],"PSPACE":[60],"complete,":[61],"and":[62],"obtain":[63],"constructive":[65],"method":[66],"for":[67,95],"optimizing":[68],"queries":[71],"systems.":[74],"other":[77],"notion":[78],"boundedness,":[80],"PTIME":[84],"reducible":[85],"to":[86],"notorious":[88],"limitedness":[91],"distance":[93],"automata,":[94],"which":[96],"only":[97],"exponential":[98],"time":[99],"algorithms":[100],"are":[101],"currently":[102],"known.":[103]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}