{"id":"https://openalex.org/W194587309","doi":null,"title":"Randomized algorithms for query optimization","display_name":"Randomized algorithms for query optimization","publication_year":1991,"publication_date":"1991-05-01","ids":{"openalex":"https://openalex.org/W194587309","mag":"194587309"},"language":"en","primary_location":{"id":"pmh:oai:minds.wisc.edu:1793/59536","doi":null,"is_oa":false,"landing_page_url":"http://digital.library.wisc.edu/1793/59536","pdf_url":null,"source":{"id":"https://openalex.org/S4306401622","display_name":"Minds at UW (University of Wisconsin)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I135310074","host_organization_name":"University of Wisconsin\u2013Madison","host_organization_lineage":["https://openalex.org/I135310074"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Technical Report"},"volume":null,"type":"report","is_traditional":false,"indexed_in":[],"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/A5006921720","display_name":"Younkyung Cha Kang","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Younkyung Cha Kang","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5006921720"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"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.9887999892234802,"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"}},"topics":[{"id":"https://openalex.org/T10317","display_name":"Advanced Database Systems and Queries","score":0.9887999892234802,"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"}},{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.00139999995008111,"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"}},{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.0008999999845400453,"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/query-optimization","display_name":"query optimization","score":0.9879999756813049},{"id":"https://openalex.org/keywords/randomized-algorithms","display_name":"randomized algorithms","score":0.7639999985694885},{"id":"https://openalex.org/keywords/simulated-annealing","display_name":"simulated annealing","score":0.8410000205039978},{"id":"https://openalex.org/keywords/iterative-improvement","display_name":"iterative improvement","score":0.9959999918937683},{"id":"https://openalex.org/keywords/two-phase-optimization","display_name":"two-phase optimization","score":0.7459999918937683},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"combinatorial optimization","score":0.9290000200271606},{"id":"https://openalex.org/keywords/relational-databases","display_name":"relational databases","score":0.6290000081062317},{"id":"https://openalex.org/keywords/system-r","display_name":"System R","score":0.800000011920929}],"concepts":[{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.7488932013511658},{"id":"https://openalex.org/C157692150","wikidata":"https://www.wikidata.org/wiki/Q2919848","display_name":"Query optimization","level":2,"score":0.6174673438072205},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5430909395217896},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5334957242012024},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4930832087993622},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4571596682071686},{"id":"https://openalex.org/C2987595161","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Optimization algorithm","level":2,"score":0.4159466028213501},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3748919367790222},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.21408170461654663}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:minds.wisc.edu:1793/59536","doi":null,"is_oa":false,"landing_page_url":"http://digital.library.wisc.edu/1793/59536","pdf_url":null,"source":{"id":"https://openalex.org/S4306401622","display_name":"Minds at UW (University of Wisconsin)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I135310074","host_organization_name":"University of Wisconsin\u2013Madison","host_organization_lineage":["https://openalex.org/I135310074"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Technical Report"},{"id":"mag:194587309","doi":null,"is_oa":false,"landing_page_url":"http://dl.acm.org/citation.cfm?id=124357","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W4206294999","https://openalex.org/W7099206815","https://openalex.org/W2278532404","https://openalex.org/W7095319647","https://openalex.org/W7100593610","https://openalex.org/W1999689297","https://openalex.org/W2773689831","https://openalex.org/W4234577667","https://openalex.org/W2949928442","https://openalex.org/W7096413013"],"abstract_inverted_index":{"Query":[0],"optimization":[1,9,63,213,311],"for":[2,202,211,258,284],"relational":[3],"database":[4,216],"systems":[5],"is":[6,114,185,248,305],"a":[7,96,100,107,115,208,218,264,269],"combinatorial":[8],"problem,":[10],"which":[11,59,113],"makes":[12],"exhaustive":[13,34],"search":[14,324],"unacceptable":[15],"as":[16,24,199,207,322],"the":[17,47,50,54,60,69,77,89,135,142,146,150,158,166,193,200,221,235,240,253,272,285,295,298,317],"query":[18,62,212,259],"size":[19],"grows.":[20],"Randomized":[21],"algorithms,":[22],"such":[23],"Iterative":[25,121,125],"Improvement":[26],"and":[27,39,76,83,120,129,140,175,245,274,302,313],"Simulated":[28,118,127],"Annealing,":[29,128],"are":[30,68],"viable":[31],"alternatives":[32,279],"to":[33,234,249,309],"search.\r\nWe":[35],"present":[36],"several":[37],"analytical":[38],"experimental":[40],"results":[41,143,159],"that":[42,71,79,88,161,181,239,319],"shed":[43],"some":[44],"light":[45],"on":[46,134,145,149,189],"shape":[48,90,151,267],"of":[49,53,91,99,117,138,152,171,196,224,242,255,268,288,290,300,316],"cost":[51,154],"function":[52],"access":[55,292],"plan":[56],"spaces":[57,93,137,223],"with":[58,307],"randomized":[61],"algorithms":[64,168,318],"must":[65],"deal.":[66],"These":[67],"space":[70,78,241,254,299],"includes":[72,80,276],"only":[73],"left-deep":[74,256],"trees,":[75],"both":[81,92,172,243,310],"deep":[82,244,301],"bushy":[84,246,303],"trees.":[85],"We":[86],"conclude":[87],"essentially":[94],"forms":[95],"'well',":[97],"but":[98],"distinctly":[101],"different":[102],"quality.":[103],"This":[104],"has":[105,263],"inspired":[106],"new":[108],"algorithm,":[109],"Two":[110,130,162,182],"Phase":[111,131,163,183],"Optimization,":[112],"combination":[116],"Annealing":[119],"Improvement.\r\nWe":[122],"show":[123,160],"how":[124],"Improvement,":[126],"Optimization":[132,164,184],"perform":[133],"two":[136,222,296],"interest":[139,225],"explain":[141],"based":[144],"above":[147],"analysis":[148],"their":[153,227,323],"function.":[155],"In":[156],"particular,":[157],"outperforms":[165],"original":[167],"in":[169,214,226,230,280,294],"terms":[170],"output":[173,314],"quality":[174,315],"running":[176],"time.":[177],"Additional":[178],"experimentation":[179],"shows":[180],"also":[186,275],"very":[187],"effective":[188],"small":[190],"queries,":[191],"having":[192],"traditional":[194],"algorithm":[195],"System":[197],"R":[198],"basis":[201],"comparison.":[203],"Thus,":[204],"it":[205,321],"emerges":[206],"strong":[209],"candidate":[210],"future":[215],"systems.\r\nFinally,":[217],"comparison":[219],"between":[220],"form":[228],"used":[229],"this":[231],"work":[232],"leads":[233],"rather":[236],"surprising":[237],"conclusion":[238],"trees":[247,257,304],"be":[250],"preferred":[251],"over":[252],"optimization.":[260],"The":[261],"former":[262],"more":[265,277],"definite":[266],"'well'":[270],"than":[271],"latter":[273],"efficient":[278],"most":[281],"cases.":[282],"Hence,":[283],"specific":[286],"choices":[287],"connections":[289],"alternative":[291],"plans":[293],"spaces,":[297],"superior":[306],"respect":[308],"time":[312],"use":[320],"space.":[325]},"counts_by_year":[{"year":2013,"cited_by_count":1}],"updated_date":"2026-10-16T09:59:22.235173","created_date":"2016-06-24T00:00:00"}