乐胖代购免代理版

{"id":"https://openalex.org/W2153260071","doi":"https://doi.org/10.1109/icde.1993.344047","title":"A polynomial time algorithm for optimizing join queries","display_name":"A polynomial time algorithm for optimizing join queries","publication_year":2002,"publication_date":"2002-12-30","ids":{"openalex":"https://openalex.org/W2153260071","doi":"https://doi.org/10.1109/icde.1993.344047","mag":"2153260071"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/icde.1993.344047","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"proceedings-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/A5113690330","display_name":"A. Swami","orcid":null},"institutions":[{"id":"https://openalex.org/I4210085935","display_name":"IBM Research - Almaden","ror":"https://ror.org/005w8dd04","country_code":"US","type":"facility","lineage":["https://openalex.org/I1341412227","https://openalex.org/I4210085935","https://openalex.org/I4210114115"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"A.N. Swami","raw_affiliation_strings":["IBM Almaden Research Center, San Jose, CA, USA"],"affiliations":[{"raw_affiliation_string":"IBM Almaden Research Center, San Jose, CA, USA","institution_ids":["https://openalex.org/I4210085935"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5056782876","display_name":"Balakrishna R. Iyer","orcid":null},"institutions":[{"id":"https://openalex.org/I1341412227","display_name":"IBM (United States)","ror":"https://ror.org/05hh8d621","country_code":"US","type":"company","lineage":["https://openalex.org/I1341412227"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"B.R. Iyer","raw_affiliation_strings":["IBM Santa Teresa Laboratory, San Jose, CA, USA"],"affiliations":[{"raw_affiliation_string":"IBM Santa Teresa Laboratory, San Jose, CA, USA","institution_ids":["https://openalex.org/I1341412227"]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.346,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":56,"citation_normalized_percentile":{"value":0.902824,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":93,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"345","last_page":"354"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9998,"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.9998,"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.9998,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9986,"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/join","display_name":"Join (topology)","score":0.6444135}],"concepts":[{"id":"https://openalex.org/C2776124973","wikidata":"https://www.wikidata.org/wiki/Q3183033","display_name":"Join (topology)","level":2,"score":0.6444135},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6329241},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6246252},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5930411},{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.5835837},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.52385855},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4610739},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.42679748},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.33401877},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3297957},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.27917054},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.09616861},{"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":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/icde.1993.344047","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[],"grants":[],"datasets":[],"versions":[],"referenced_works_count":12,"referenced_works":["https://openalex.org/W1580108468","https://openalex.org/W166430344","https://openalex.org/W194587309","https://openalex.org/W1978220611","https://openalex.org/W1993291251","https://openalex.org/W2066623874","https://openalex.org/W2081579241","https://openalex.org/W2153329411","https://openalex.org/W2170918251","https://openalex.org/W34163137","https://openalex.org/W4238121600","https://openalex.org/W4244215662"],"related_works":["https://openalex.org/W4387497383","https://openalex.org/W3209920515","https://openalex.org/W3183948672","https://openalex.org/W3173606202","https://openalex.org/W3110381201","https://openalex.org/W2948807893","https://openalex.org/W2935909890","https://openalex.org/W2778153218","https://openalex.org/W2758277628","https://openalex.org/W1531601525"],"abstract_inverted_index":{"The":[0,41,56],"dynamic":[1,102],"programming":[2],"algorithm":[3,58],"for":[4],"query":[5],"optimization":[6],"has":[7,66],"exponential":[8],"complexity.":[9],"An":[10],"alternative":[11],"polynomial":[12,67],"time":[13,68],"algorithm,":[14,17,35,43,53],"the":[15,22,33,51,78,91],"IK-KBZ":[16,52],"is":[18,54,59],"severely":[19],"limited":[20],"in":[21,77],"queries":[23],"it":[24,87],"can":[25],"optimize.":[26],"Other":[27],"algorithms":[28,93],"have":[29],"been":[30],"proposed,":[31],"including":[32],"greedy":[34],"iterative":[36],"improvement,":[37],"and":[38,47,69,72],"simulated":[39],"annealing.":[40],"AB":[42,57],"which":[44],"combines":[45],"randomization":[46],"neighborhood":[48],"search":[49,100],"with":[50],"presented.":[55],"much":[60],"more":[61],"generally":[62],"applicable":[63],"than":[64,90],"IK-KBZ,":[65],"space":[70,79],"complexity,":[71],"produces":[73],"near":[74],"optimal":[75],"plans":[76],"of":[80],"outer":[81],"linear":[82],"join":[83],"trees.":[84],"On":[85],"average,":[86],"does":[88],"better":[89],"other":[92],"that":[94],"do":[95,97],"not":[96],"an":[98],"exhaustive":[99],"like":[101],"programming.<":[103],">":[106]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2153260071","counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":3}],"updated_date":"2025-01-22T10:24:25.277385","created_date":"2016-06-24"}