{"id":"https://openalex.org/W4299604338","doi":null,"title":"A query optimization in distributed database systems","display_name":"A query optimization in distributed database systems","publication_year":1983,"publication_date":"1983-01-01","ids":{"openalex":"https://openalex.org/W4299604338","mag":"62030474"},"language":"en","primary_location":{"id":"pmh:oai:deepblue.lib.umich.edu:2027.42/159357","doi":null,"is_oa":false,"landing_page_url":"https://hdl.handle.net/2027.42/159357","pdf_url":null,"source":{"id":"https://openalex.org/S4306400393","display_name":"Deep Blue (University of Michigan)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I27837315","host_organization_name":"University of Michigan","host_organization_lineage":["https://openalex.org/I27837315"],"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":"Thesis"},"volume":null,"type":"dissertation","is_traditional":true,"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/A5101705069","display_name":"Chin\u2010Wan Chung","orcid":"https://orcid.org/0000-0001-6892-1226","observed_orcids":["https://orcid.org/0000-0001-6892-1226"]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Chin\u2010Wan Chung","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0001-6892-1226","affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5101705069"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":2,"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.9984999895095825,"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.9984999895095825,"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.00019999999494757503,"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/T10715","display_name":"Distributed and Parallel Computing Systems","score":9.999999747378752e-05,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/query-optimization","display_name":"query optimization","score":0.9100000262260437},{"id":"https://openalex.org/keywords/distributed-databases","display_name":"distributed databases","score":0.7590000033378601},{"id":"https://openalex.org/keywords/distributed-query-processing","display_name":"distributed query processing","score":0.7739999890327454},{"id":"https://openalex.org/keywords/heuristic-algorithms","display_name":"heuristic algorithms","score":0.7839999794960022},{"id":"https://openalex.org/keywords/np-hardness","display_name":"NP-hardness","score":0.8349999785423279},{"id":"https://openalex.org/keywords/time-complexity-analysis","display_name":"time complexity analysis","score":0.5950000286102295},{"id":"https://openalex.org/keywords/relational-databases","display_name":"relational databases","score":0.32499998807907104}],"concepts":[{"id":"https://openalex.org/C157692150","wikidata":"https://www.wikidata.org/wiki/Q2919848","display_name":"Query optimization","level":2,"score":0.7145304083824158},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7104268074035645},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.578718364238739},{"id":"https://openalex.org/C70061542","wikidata":"https://www.wikidata.org/wiki/Q989016","display_name":"Distributed database","level":2,"score":0.5481860041618347},{"id":"https://openalex.org/C54239708","wikidata":"https://www.wikidata.org/wiki/Q1329910","display_name":"View","level":3,"score":0.42028194665908813},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.349459707736969},{"id":"https://openalex.org/C148840519","wikidata":"https://www.wikidata.org/wiki/Q1049878","display_name":"Database design","level":2,"score":0.2995338439941406}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:deepblue.lib.umich.edu:2027.42/159357","doi":null,"is_oa":false,"landing_page_url":"https://hdl.handle.net/2027.42/159357","pdf_url":null,"source":{"id":"https://openalex.org/S4306400393","display_name":"Deep Blue (University of Michigan)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I27837315","host_organization_name":"University of Michigan","host_organization_lineage":["https://openalex.org/I27837315"],"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":"Thesis"},{"id":"pmh:oai:deepblue.lib.umich.edu:2027.42/4190","doi":null,"is_oa":false,"landing_page_url":"https://hdl.handle.net/2027.42/4190","pdf_url":null,"source":{"id":"https://openalex.org/S4306400393","display_name":"Deep Blue (University of Michigan)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I27837315","host_organization_name":"University of Michigan","host_organization_lineage":["https://openalex.org/I27837315"],"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:62030474","doi":null,"is_oa":false,"landing_page_url":"http://deepblue.lib.umich.edu/bitstream/2027.42/4190/5/bac0406.0001.001.pdf","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/W4233735114","https://openalex.org/W1549051457","https://openalex.org/W7097030784","https://openalex.org/W2329269221","https://openalex.org/W1553428165","https://openalex.org/W2006117436","https://openalex.org/W7095486430","https://openalex.org/W2159447805","https://openalex.org/W2737179035","https://openalex.org/W1555314876"],"abstract_inverted_index":{"This":[0],"research":[1],"is":[2,109,155,178,275,283],"concerned":[3],"with":[4,230],"a":[5,8,18,29,38,70,101,110,124,139,142,160,168,197,210,218,266,271,286],"model":[6,81,108],"and":[7,114,189],"method":[9,111],"of":[10,42,64,72,90,106,119,123,138,144,171,175,184,217,240,244,268],"minimizing":[11],"the":[12,43,53,66,94,117,128,136,150,176,182,203,206,215,222,231,241,245,262,281],"inter-site":[13,96],"data":[14,33,97],"traffic":[15],"incurred":[16],"by":[17,141,180,196,220,285],"query":[19,30,61,140,152,219,274],"in":[20,37,99,256],"distributed":[21,60,102,151],"relational":[22],"database":[23,44],"systems.":[24],"In":[25,126],"order":[26],"to":[27,49,52,85,157,166],"process":[28],"which":[31,92,112],"references":[32],"from":[34],"multiple":[35],"sites":[36,47],"computer":[39],"network,":[40],"portions":[41],"at":[45],"other":[46],"have":[48,234],"be":[50,158],"transferred":[51],"user's":[54],"site.":[55],"The":[56,79,104,173,212,237,251,258],"usual":[57],"methodology":[58],"for":[59,265,270],"processing":[62,100,137],"consists":[63],"reducing":[65],"referenced":[67],"relations":[68],"using":[69],"sequence":[71,89,143,170,267],"semijoin":[73],"operations":[74],"after":[75],"initial":[76],"local":[77],"processing.":[78],"mathematical":[80],"has":[82,146,163,247,253],"been":[83,147,164,235,248,254],"developed":[84,165],"determine":[86,167],"an":[87,120],"optimal":[88],"semijoins":[91,145,204,226,269],"minimizes":[93],"total":[95],"flow":[98],"query.":[103,125],"core":[105],"this":[107],"efficiently":[113],"accurately":[115],"estimates":[116],"size":[118,273],"intermediate":[121],"result":[122],"particular,":[127],"assumption":[129],"that":[130,261],"joining":[131,185,207],"attributes":[132,186,208],"are":[133],"independent":[134],"during":[135],"relaxed.":[148],"Since":[149],"optimization":[153],"problem":[154],"known":[156],"NP-hard,":[159],"heuristic":[161],"algorithm":[162,177,213,246,252],"low-cost":[169],"semijoins.":[172],"efficiency":[174],"increased":[179],"partitioning":[181],"set":[183],"into":[187],"blocks":[188],"sequencing":[190,201],"these":[191],"blocks,":[192],"as":[193,195],"well":[194],"straightforward,":[198],"yet":[199],"effective":[200],"among":[202],"between":[205],"inside":[209],"block.":[211],"decreases":[214],"cost":[216],"selecting":[221],"low-cost,":[223],"highly":[224],"reductive":[225],"first.":[227],"Cost":[228],"comparisons":[229],"existing":[232],"algorithms":[233],"provided.":[236],"time":[238,264],"complexity":[239],"main":[242],"features":[243],"analytically":[249],"derived.":[250],"implemented":[255],"PASCAL.":[257],"tests":[259],"show":[260],"scheduling":[263],"reasonable":[272],"less":[276],"than":[277],"0.05":[278],"seconds":[279],"when":[280],"program":[282],"executed":[284],"main-frame":[287],"computer.":[288]},"counts_by_year":[],"updated_date":"2026-10-16T09:59:22.235173","created_date":"2022-10-02T00:00:00"}