{"id":"https://openalex.org/W2041032862","doi":"https://doi.org/10.1145/1066157.1066260","title":"Optimizing recursive queries in SQL","display_name":"Optimizing recursive queries in SQL","publication_year":2005,"publication_date":"2005-06-14","ids":{"openalex":"https://openalex.org/W2041032862","doi":"https://doi.org/10.1145/1066157.1066260","mag":"2041032862"},"language":"en","primary_location":{"id":"doi:10.1145/1066157.1066260","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1066157.1066260","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2005 ACM SIGMOD 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/A5031610238","display_name":"Carlos Ordo\u0144\u1ebdz","orcid":"https://orcid.org/0009-0005-1135-9726"},"institutions":[{"id":"https://openalex.org/I108650528","display_name":"Teradata (United Kingdom)","ror":"https://ror.org/00gze1672","country_code":"GB","type":"company","lineage":["https://openalex.org/I108650528","https://openalex.org/I4210158714"]},{"id":"https://openalex.org/I4210158714","display_name":"Teradata (United States)","ror":"https://ror.org/04vkkat38","country_code":"US","type":"company","lineage":["https://openalex.org/I4210158714"]}],"countries":["GB","US"],"is_corresponding":true,"raw_author_name":"Carlos Ordonez","raw_affiliation_strings":["Teradata, NCR, San Diego, CA","Teradata (NCR), San Diego, CA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Teradata, NCR, San Diego, CA","institution_ids":["https://openalex.org/I4210158714"]},{"raw_affiliation_string":"Teradata (NCR), San Diego, CA","institution_ids":["https://openalex.org/I108650528"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5031610238"],"corresponding_institution_ids":["https://openalex.org/I108650528","https://openalex.org/I4210158714"],"apc_list":null,"apc_paid":null,"fwci":0.7847,"has_fulltext":false,"cited_by_count":32,"citation_normalized_percentile":{"value":0.72139741,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"834","last_page":"839"},"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.9998000264167786,"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.9998000264167786,"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/T11106","display_name":"Data Management and Algorithms","score":0.9991000294685364,"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/T10215","display_name":"Semantic Web and Ontologies","score":0.9925000071525574,"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/computer-science","display_name":"Computer science","score":0.8005561828613281},{"id":"https://openalex.org/keywords/transitive-closure","display_name":"Transitive closure","score":0.716534435749054},{"id":"https://openalex.org/keywords/sql","display_name":"SQL","score":0.49720385670661926},{"id":"https://openalex.org/keywords/recursion","display_name":"Recursion (computer science)","score":0.4830668568611145},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4465581178665161},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4399729371070862},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33546966314315796},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.19642183184623718},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.16509205102920532},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.13877719640731812}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8005561828613281},{"id":"https://openalex.org/C128896722","wikidata":"https://www.wikidata.org/wiki/Q1501387","display_name":"Transitive closure","level":2,"score":0.716534435749054},{"id":"https://openalex.org/C510870499","wikidata":"https://www.wikidata.org/wiki/Q47607","display_name":"SQL","level":2,"score":0.49720385670661926},{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.4830668568611145},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4465581178665161},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4399729371070862},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33546966314315796},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19642183184623718},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.16509205102920532},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.13877719640731812}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/1066157.1066260","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1066157.1066260","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2005 ACM SIGMOD international conference on Management of data","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.493.4882","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.493.4882","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.uiuc.edu/class/fa05/cs591han/sigmodpods05/sigmod/pdf/p834-ordonez.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.701.1680","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.701.1680","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www2.cs.uh.edu/%7Eordonez/w-pdf/w-2005-SIGMOD-rq.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W47515223","https://openalex.org/W147240463","https://openalex.org/W1523369418","https://openalex.org/W1993800075","https://openalex.org/W2004769865","https://openalex.org/W2012056301","https://openalex.org/W2019120929","https://openalex.org/W2020649320","https://openalex.org/W2053872400","https://openalex.org/W2121214732","https://openalex.org/W2140092107","https://openalex.org/W2545919726"],"related_works":["https://openalex.org/W2359423766","https://openalex.org/W1600485007","https://openalex.org/W2364216866","https://openalex.org/W2362009423","https://openalex.org/W2614633957","https://openalex.org/W2391894074","https://openalex.org/W2162904746","https://openalex.org/W1575529579","https://openalex.org/W3035035809","https://openalex.org/W145334972"],"abstract_inverted_index":{"Recursion":[0],"represents":[1],"an":[2,23,58,81,96],"important":[3],"addition":[4],"to":[5,61],"the":[6,13,32,110,118],"SQL":[7],"language.":[8],"This":[9],"work":[10],"focuses":[11],"on":[12,30,68],"optimization":[14],"of":[15,35,45,71,91,106,121],"linear":[16,89,104],"recursive":[17,122],"queries":[18],"in":[19,53,117],"SQL.":[20],"To":[21],"provide":[22],"abstract":[24],"framework":[25],"for":[26],"discussion,":[27],"we":[28],"focus":[29],"computing":[31],"transitive":[33],"closure":[34],"a":[36,88,103,114],"graph.":[37],"Three":[38],"optimizations":[39,112],"are":[40,66],"studied:":[41],"(1)":[42],"Early":[43],"evaluation":[44,119],"row":[46],"selection":[47],"conditions.":[48],"(2)":[49],"Eliminating":[50],"duplicate":[51],"rows":[52],"intermediate":[54],"tables.":[55],"(3)":[56],"Defining":[57],"enhanced":[59],"index":[60],"accelerate":[62],"join":[63],"computation.":[64],"Optimizations":[65],"evaluated":[67],"two":[69],"types":[70],"graphs:":[72],"binary":[73],"trees":[74,79],"and":[75,87,102],"sparse":[76],"graphs.":[77],"Binary":[78],"represent":[80,95],"ideal":[82],"graph":[83],"with":[84,99],"no":[85],"cycles":[86,101],"number":[90,105],"edges.":[92,107],"Sparse":[93],"graphs":[94],"average":[97],"case":[98],"some":[100],"In":[108],"general,":[109],"proposed":[111],"produce":[113],"significant":[115],"reduction":[116],"time":[120],"queries.":[123]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":3},{"year":2016,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":3}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}