{"id":"https://openalex.org/W3144326055","doi":"https://doi.org/10.1109/ideas.2007.4318118","title":"Kruskal's Algorithm for Query Tree Optimization","display_name":"Kruskal's Algorithm for Query Tree Optimization","publication_year":2007,"publication_date":"2007-09-01","ids":{"openalex":"https://openalex.org/W3144326055","doi":"https://doi.org/10.1109/ideas.2007.4318118","mag":"3144326055"},"language":"en","primary_location":{"id":"doi:10.1109/ideas.2007.4318118","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ideas.2007.4318118","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/A5046927734","display_name":"Pryscila Barvik Guttoski","orcid":null},"institutions":[{"id":"https://openalex.org/I52418104","display_name":"Universidade Federal do Paran\u00e1","ror":"https://ror.org/05syd6y78","country_code":"BR","type":"education","lineage":["https://openalex.org/I52418104"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Pryscila Barvik Guttoski","raw_affiliation_strings":["Departamento de Informatica, Universidade Federal do Parana, Curitiba, Brazil"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Departamento de Informatica, Universidade Federal do Parana, Curitiba, Brazil","institution_ids":["https://openalex.org/I52418104"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5004821805","display_name":"Marcos Sfair Suny\u00e9","orcid":"https://orcid.org/0000-0002-2568-5697"},"institutions":[{"id":"https://openalex.org/I52418104","display_name":"Universidade Federal do Paran\u00e1","ror":"https://ror.org/05syd6y78","country_code":"BR","type":"education","lineage":["https://openalex.org/I52418104"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Marcos Sfair Sunye","raw_affiliation_strings":["Departamento de Informatica, Universidade Federal do Parana, Curitiba, Brazil"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Departamento de Informatica, Universidade Federal do Parana, Curitiba, Brazil","institution_ids":["https://openalex.org/I52418104"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5062054732","display_name":"Fabiano Silva","orcid":"https://orcid.org/0000-0001-5453-6175"},"institutions":[{"id":"https://openalex.org/I52418104","display_name":"Universidade Federal do Paran\u00e1","ror":"https://ror.org/05syd6y78","country_code":"BR","type":"education","lineage":["https://openalex.org/I52418104"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Fabiano Silva","raw_affiliation_strings":["Departamento de Informatica, Universidade Federal do Parana, Curitiba, Brazil"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Departamento de Informatica, Universidade Federal do Parana, Curitiba, Brazil","institution_ids":["https://openalex.org/I52418104"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.0106,"has_fulltext":false,"cited_by_count":23,"citation_normalized_percentile":{"value":0.81754522,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"296","last_page":"302"},"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.9987999796867371,"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.9987999796867371,"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.9984999895095825,"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/T10538","display_name":"Data Mining Algorithms and Applications","score":0.993399977684021,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/kruskals-algorithm","display_name":"Kruskal's algorithm","score":0.8527408838272095},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7825890779495239},{"id":"https://openalex.org/keywords/query-optimization","display_name":"Query optimization","score":0.7622939348220825},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4647606611251831},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4392443895339966},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4223329424858093},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.33848103880882263},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.2584807872772217},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.13380849361419678}],"concepts":[{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.8527408838272095},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7825890779495239},{"id":"https://openalex.org/C157692150","wikidata":"https://www.wikidata.org/wiki/Q2919848","display_name":"Query optimization","level":2,"score":0.7622939348220825},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4647606611251831},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4392443895339966},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4223329424858093},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.33848103880882263},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.2584807872772217},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.13380849361419678},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ideas.2007.4318118","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ideas.2007.4318118","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":5,"referenced_works":["https://openalex.org/W1777047301","https://openalex.org/W1945317942","https://openalex.org/W2066623874","https://openalex.org/W2143682328","https://openalex.org/W2144235399"],"related_works":["https://openalex.org/W2898459690","https://openalex.org/W3101457564","https://openalex.org/W2589768050","https://openalex.org/W4380840098","https://openalex.org/W2014815983","https://openalex.org/W4242086819","https://openalex.org/W2074214908","https://openalex.org/W4206043061","https://openalex.org/W2418231958","https://openalex.org/W2942013815"],"abstract_inverted_index":{"This":[0],"paper":[1],"describes":[2],"an":[3],"implementation":[4],"of":[5,14],"Kruskal's":[6,52,84,109],"algorithm":[7,53,85,110],"in":[8,29,90],"query":[9,19,34,73,116],"optimization":[10,35,103],"process":[11],"for":[12,115],"generation":[13],"a":[15,46,112],"near":[16],"optimal":[17,79],"execution":[18,63],"tree.":[20,80],"The":[21,105],"open":[22],"source":[23],"Post-":[24,101],"greSQL":[25],"DBMS":[26],"was":[27],"used":[28],"the":[30,65,78,87,92,96],"experiments":[31],"since":[32],"its":[33,58,61],"is":[36,111],"performed":[37],"by":[38,99],"dynamic":[39],"programming":[40],"and":[41,64],"genetic":[42],"algorithm,":[43],"which":[44],"allows":[45],"concrete":[47],"comparison":[48],"with":[49],"our":[50],"approach.":[51],"presents":[54],"some":[55],"advantages":[56],"like":[57],"simplified":[59],"code,":[60],"polynomial-time":[62],"reduced":[66],"search":[67],"space":[68],"to":[69],"generate":[70],"only":[71],"one":[72],"tree,":[74],"that":[75,108],"will":[76],"be":[77],"In":[81],"most":[82],"experiments,":[83],"got":[86],"expected":[88],"results":[89,97,106],"almost":[91],"same":[93],"time":[94],"as":[95],"achieved":[98],"default":[100],"greSQL's":[102],"algorithms.":[104],"confirm":[107],"feasible":[113],"method":[114],"optimization.":[117]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":4},{"year":2020,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}