[{"_1":2,"_3":-5,"_4":-5},"loaderData",{"_5":6,"_7":8,"_9":10},"actionData","errors","root",{"_269":270},"routes/_layout",{"_11":196},"routes/entity.$type.$id",{"_11":12,"_13":14,"_15":16,"_17":18,"_19":20,"_21":22,"_23":24,"_25":26,"_27":28},"dehydratedState",{"_74":75,"_76":77},"type","paper","id","paper_W2066623874","section","technologies","entity",{"_15":16,"_29":30,"_31":-5,"_32":-5,"_33":-5,"_34":-5,"_35":36,"_37":38,"_39":-5,"_40":41,"_42":43,"_44":45,"_46":47,"_48":-5,"_49":50,"_51":30,"_52":53,"_54":55,"_56":57,"_58":59,"_60":61,"_62":-5,"_63":64,"_65":66,"_67":68,"_69":30,"_70":-5},"canonical","https://www.hugmap.com/entity/paper/paper_W2066623874/technologies","siteBaseUrl","https://www.hugmap.com","sectionCount",2,"jsonLd","{\"@context\":\"https://schema.org\",\"@graph\":[{\"name\":\"On the optimal nesting order for computing N -relational joins\",\"url\":\"https://www.hugmap.com/entity/paper/paper_W2066623874/technologies\",\"@type\":\"ScholarlyArticle\",\"headline\":\"On the optimal nesting order for computing N -relational joins\",\"datePublished\":\"1984-09-01\",\"isPartOf\":{\"@type\":\"Periodical\",\"name\":\"ACM Transactions on Database Systems\"}},{\"@type\":\"CollectionPage\",\"name\":\"On the optimal nesting order for computing N -relational joins 相关技术\",\"description\":\"On the optimal nesting order for computing N -relational joins 在 HugMap 中的相关技术，共 2 条，含结构化关联信息与详情链接。\",\"url\":\"https://www.hugmap.com/entity/paper/paper_W2066623874/technologies\",\"inLanguage\":\"zh-CN\"},{\"@type\":\"BreadcrumbList\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"首页\",\"item\":\"https://www.hugmap.com/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"论文\",\"item\":\"https://www.hugmap.com/search?type=paper\"},{\"@type\":\"ListItem\",\"position\":3,\"name\":\"On the optimal nesting order for computing N -relational joins\",\"item\":\"https://www.hugmap.com/entity/paper/paper_W2066623874\"},{\"@type\":\"ListItem\",\"position\":4,\"name\":\"相关技术\",\"item\":\"https://www.hugmap.com/entity/paper/paper_W2066623874/technologies\"}]}]}","name","On the optimal nesting order for computing N -relational joins","nameZh","aliases","description","descriptionZh","status","active","externalIds","{\"openalex\":\"W2066623874\",\"doi\":\"10.1145/1270.1498\"}","properties","source","openalex","createdAt","2026-05-23T01:04:36.285090084","updatedAt","2026-05-23T01:04:36.285091588","doi","10.1145/1270.1498","arxivId","openalexId","W2066623874","title","abstractText","Using the nested loops method, this paper addresses the problem of minimizing the number of page fetches necessary to evaluate a given query to a relational database. We first propose a data structure whereby the number of page fetches required for query evaluation is substantially reduced and then derive a formula for the expected number of page fetches. An optimal solution to our problem is the nesting order of relations in the evaluation program, which minimizes the number of page fetches. Since the minimization of the formula is NP-hard, as shown in the Appendix, we propose a heuristic algorithm which produces a good suboptimal solution in polynomial time. For the special case where the input query is a “tree query,” we present an efficient algorithm for finding an optimal nesting order.","publishedDate","1984-09-01","publishedYear",1984,"venue","ACM Transactions on Database Systems","citationCount",230,"authors","keywords",[71,72,73],"pdfUrl","https://dl.acm.org/doi/pdf/10.1145/1270.1498","topVenue",false,"displayName","displayDescription","Advanced Database Systems and Queries","Data Management and Algorithms","Data Mining Algorithms and Applications","mutations",[],"queries",[78],{"_79":80,"_81":82,"_83":84,"_85":86},"dehydratedAt",1780786887415,"state",{"_88":89,"_90":91,"_92":80,"_93":-5,"_94":95,"_96":95,"_97":95,"_98":-5,"_99":-5,"_100":68,"_35":101,"_102":103},"queryKey",[87,19,14,16],"queryHash","[\"portal\",\"entity\",\"paper\",\"paper_W2066623874\"]","portal","data",{"_19":20,"_104":105,"_106":107,"_108":109,"_110":111,"_18":112,"_62":113},"dataUpdateCount",1,"dataUpdatedAt","error","errorUpdateCount",0,"errorUpdatedAt","fetchFailureCount","fetchFailureReason","fetchMeta","isInvalidated","success","fetchStatus","idle","entityType","Paper","taxonomies",[155,156,157,158],"events",[],"articles",[],[135,136],[114,115],{"_15":130,"_29":131,"_31":-5,"_32":-5,"_33":-5,"_34":-5,"_35":36,"_37":132,"_39":-5,"_40":41,"_42":133,"_44":134,"_121":-5,"_51":-5,"_122":-5,"_123":-5,"_124":-5,"_60":-5,"_125":-5,"_126":-5,"_127":-5,"_128":-5,"_129":-5,"_69":131,"_70":-5},{"_15":116,"_29":117,"_31":-5,"_32":-5,"_33":-5,"_34":-5,"_35":36,"_37":118,"_39":-5,"_40":41,"_42":119,"_44":120,"_121":-5,"_51":-5,"_122":-5,"_123":-5,"_124":-5,"_60":-5,"_125":-5,"_126":-5,"_127":-5,"_128":-5,"_129":-5,"_69":117,"_70":-5},"person_A5113496426","Toshihide Ibaraki","{\"openalex\":\"A5113496426\"}","2026-05-19T13:13:40.177338598","2026-05-23T01:04:36.319918612","orcid","affiliation","researchArea","paperCount","homepage","linkedin","twitter","github","hindex","person_A5108356010","Tiko Kameda","{\"openalex\":\"A5108356010\"}","2026-05-23T01:04:38.176193632","2026-05-23T01:04:38.176195197",{"_15":151,"_29":72,"_31":-5,"_32":-5,"_33":-5,"_34":-5,"_35":36,"_37":152,"_39":-5,"_40":139,"_42":153,"_44":154,"_142":143,"_144":145,"_146":-5,"_147":148,"_149":-5,"_124":-5,"_150":-5,"_69":72,"_70":-5},{"_15":137,"_29":73,"_31":-5,"_32":-5,"_33":-5,"_34":-5,"_35":36,"_37":138,"_39":-5,"_40":139,"_42":140,"_44":141,"_142":143,"_144":145,"_146":-5,"_147":148,"_149":-5,"_124":-5,"_150":-5,"_69":73,"_70":-5},"tech_oa_T10538","{\"taxonomy_id\":\"tax_rd_T10538\"}","openalex_topics","2026-05-17T09:00:14.285190472","2026-05-17T09:00:14.285193432","techType","algorithm","domain","Physical Sciences","proposedYear","maturityLevel","growing","wikipediaUrl","patentCount","tech_oa_T11106","{\"taxonomy_id\":\"tax_rd_T11106\"}","2026-05-17T09:00:11.245194282","2026-05-17T09:00:11.245197583",{"_15":189,"_29":190,"_31":-5,"_32":-5,"_33":191,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":192,"_42":-5,"_44":-5,"_163":193,"_165":-5,"_166":91,"_168":194,"_170":195,"_172":95,"_173":68,"_175":95,"_176":-5,"_69":190,"_70":191},{"_15":183,"_29":72,"_31":-5,"_32":-5,"_33":-5,"_34":-5,"_35":36,"_37":184,"_39":-5,"_40":41,"_42":185,"_44":186,"_163":164,"_165":-5,"_166":167,"_168":187,"_170":188,"_172":95,"_173":174,"_175":95,"_176":-5,"_69":72,"_70":-5},{"_15":177,"_29":73,"_31":-5,"_32":-5,"_33":-5,"_34":-5,"_35":36,"_37":178,"_39":-5,"_40":41,"_42":179,"_44":180,"_163":164,"_165":-5,"_166":167,"_168":181,"_170":182,"_172":95,"_173":174,"_175":95,"_176":-5,"_69":73,"_70":-5},{"_15":159,"_29":71,"_31":-5,"_32":-5,"_33":-5,"_34":-5,"_35":36,"_37":160,"_39":-5,"_40":41,"_42":161,"_44":162,"_163":164,"_165":-5,"_166":167,"_168":169,"_170":171,"_172":95,"_173":174,"_175":95,"_176":-5,"_69":71,"_70":-5},"tax_rd_T10317","{\"openalex_topic\":\"T10317\"}","2026-05-14T00:29:44.682811103","2026-05-23T12:36:59.234266799","taxonomyType","RESEARCH_DOMAIN","code","level",3,"parentId","tax_rd_1705","path","Physical Sciences/Computer Science/Computer Networks and Communications/Advanced Database Systems and Queries","sortOrder","isLeaf",true,"entityCount","children","tax_rd_T10538","{\"openalex_topic\":\"T10538\"}","2026-05-14T00:29:44.667946447","2026-05-23T12:37:14.202243346","tax_rd_1710","Physical Sciences/Computer Science/Information Systems/Data Mining Algorithms and Applications","tax_rd_T11106","{\"openalex_topic\":\"T11106\"}","2026-05-14T00:29:16.292968991","2026-05-23T12:38:06.251863399","tax_rd_1711","Physical Sciences/Computer Science/Signal Processing/Data Management and Algorithms","tax_ind_enterprise","企业软件","Enterprise Software","manual","INDUSTRY","tax_ind_root","科技行业/企业软件",{"_74":197,"_76":198},[],[199],{"_79":200,"_81":201,"_83":202,"_85":203},1780786886613,{"_88":205,"_90":91,"_92":200,"_93":-5,"_94":95,"_96":95,"_97":95,"_98":-5,"_99":-5,"_100":68,"_35":101,"_102":103},[87,204],"[\"portal\",\"industries\"]","industries",[206,207,208,209,210,211,212,213,214,215,216,217],{"_15":262,"_29":263,"_31":-5,"_32":264,"_33":265,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":192,"_42":-5,"_44":-5,"_163":193,"_165":-5,"_166":91,"_168":194,"_170":266,"_172":95,"_173":68,"_175":95,"_176":-5,"_69":263,"_70":265},{"_15":258,"_29":259,"_31":-5,"_32":-5,"_33":260,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":192,"_42":-5,"_44":-5,"_163":193,"_165":-5,"_166":91,"_168":194,"_170":261,"_172":95,"_173":68,"_175":95,"_176":-5,"_69":259,"_70":260},{"_15":252,"_29":253,"_31":-5,"_32":254,"_33":255,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":192,"_42":-5,"_44":-5,"_163":193,"_165":-5,"_166":91,"_168":194,"_170":256,"_172":95,"_173":68,"_175":95,"_176":-5,"_69":253,"_70":255},{"_15":248,"_29":249,"_31":-5,"_32":-5,"_33":250,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":192,"_42":-5,"_44":-5,"_163":193,"_165":-5,"_166":91,"_168":194,"_170":251,"_172":95,"_173":68,"_175":95,"_176":-5,"_69":249,"_70":250},{"_15":189,"_29":190,"_31":-5,"_32":-5,"_33":191,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":192,"_42":-5,"_44":-5,"_163":193,"_165":-5,"_166":91,"_168":194,"_170":195,"_172":95,"_173":68,"_175":95,"_176":-5,"_69":190,"_70":191},{"_15":242,"_29":243,"_31":-5,"_32":244,"_33":245,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":192,"_42":-5,"_44":-5,"_163":193,"_165":-5,"_166":91,"_168":194,"_170":246,"_172":95,"_173":68,"_175":95,"_176":-5,"_69":243,"_70":245},{"_15":238,"_29":239,"_31":-5,"_32":-5,"_33":240,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":192,"_42":-5,"_44":-5,"_163":193,"_165":-5,"_166":91,"_168":194,"_170":241,"_172":95,"_173":174,"_175":95,"_176":-5,"_69":239,"_70":240},{"_15":234,"_29":235,"_31":-5,"_32":-5,"_33":236,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":192,"_42":-5,"_44":-5,"_163":193,"_165":-5,"_166":91,"_168":194,"_170":237,"_172":95,"_173":68,"_175":95,"_176":-5,"_69":235,"_70":236},{"_15":230,"_29":231,"_31":-5,"_32":-5,"_33":232,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":192,"_42":-5,"_44":-5,"_163":193,"_165":-5,"_166":91,"_168":194,"_170":233,"_172":95,"_173":68,"_175":95,"_176":-5,"_69":231,"_70":232},{"_15":226,"_29":227,"_31":-5,"_32":-5,"_33":228,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":192,"_42":-5,"_44":-5,"_163":193,"_165":-5,"_166":91,"_168":194,"_170":229,"_172":95,"_173":68,"_175":95,"_176":-5,"_69":227,"_70":228},{"_15":222,"_29":223,"_31":-5,"_32":-5,"_33":224,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":192,"_42":-5,"_44":-5,"_163":193,"_165":-5,"_166":91,"_168":194,"_170":225,"_172":95,"_173":68,"_175":95,"_176":-5,"_69":223,"_70":224},{"_15":218,"_29":219,"_31":-5,"_32":-5,"_33":220,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":192,"_42":-5,"_44":-5,"_163":193,"_165":-5,"_166":91,"_168":194,"_170":221,"_172":95,"_173":68,"_175":95,"_176":-5,"_69":219,"_70":220},"tax_ind_smartphone","智能手机","Smartphone","科技行业/智能手机","tax_ind_robot","机器人","Robotics","科技行业/机器人","tax_ind_wearable","智能穿戴","Smart Wearables","科技行业/智能穿戴","tax_ind_energy","新能源与智能制造","New Energy & Smart Manufacturing","科技行业/新能源与智能制造","tax_ind_biotech","生物科技","Biotech","科技行业/生物科技","tax_ind_quantum","量子计算","Quantum Computing","科技行业/量子计算","tax_ind_blockchain","区块链",[247],"Blockchain","科技行业/区块链","Web3","tax_ind_security","网络安全","Cybersecurity","科技行业/网络安全","tax_ind_semi","半导体",[257],"Semiconductor","科技行业/半导体","芯片","tax_ind_cloud","云计算","Cloud Computing","科技行业/云计算","tax_ind_ai","人工智能",[267,268],"Artificial Intelligence","科技行业/人工智能","AI","AI 技术","env",{"_271":24},"SITE_BASE_URL"]

On the optimal nesting order for computing <i>N</i> -relational joins 论文

On the optimal nesting order for computing <i>N</i> -relational joins · 相关技术

相关技术