{"id":"https://openalex.org/W2124186830","doi":null,"title":"Scheduling and Caching in Multi-Query Optimization","display_name":"Scheduling and Caching in Multi-Query Optimization","alternate_titles":[],"publication_year":2006,"publication_date":"2006-01-01","ids":{"openalex":"https://openalex.org/W2124186830","mag":"2124186830"},"language":"en","primary_location":{"id":"mag:2124186830","doi":null,"is_oa":false,"landing_page_url":"http://i.stanford.edu/~dilys/papers/mqo.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306418077","display_name":"Conference on Management of Data","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Conference on Management of Data","raw_type":null},"parent_works":[],"lineage":["https://openalex.org/W2124186830"],"child_works_count":0,"type":"conference-paper","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/A5041941673","display_name":"Ajit A. Diwan","orcid":"https://orcid.org/0000-0001-9381-7164","observed_orcids":["https://orcid.org/0000-0001-9381-7164"]},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ajit A. Diwan","raw_affiliation_strings":["Stanford University"],"raw_orcid":"https://orcid.org/0000-0001-9381-7164","affiliations":[{"raw_affiliation_string":"Stanford University","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5081847962","display_name":"S. Sudarshan","orcid":"https://orcid.org/0000-0002-6230-2288","observed_orcids":["https://orcid.org/0000-0002-6230-2288"]},"institutions":[{"id":"https://openalex.org/I162827531","display_name":"Indian Institute of Technology Bombay","ror":"https://ror.org/02qyf5152","country_code":"IN","type":"education","lineage":["https://openalex.org/I162827531"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"S. Sudarshan","raw_affiliation_strings":["Indian Inst. of Technology, Bombay"],"raw_orcid":"https://orcid.org/0000-0002-6230-2288","affiliations":[{"raw_affiliation_string":"Indian Inst. of Technology, Bombay","institution_ids":["https://openalex.org/I162827531"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5045549079","display_name":"Dilys Thomas","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I162827531","display_name":"Indian Institute of Technology Bombay","ror":"https://ror.org/02qyf5152","country_code":"IN","type":"education","lineage":["https://openalex.org/I162827531"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Dilys Thomas","raw_affiliation_strings":["Indian Inst. of Technology, Bombay"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Indian Inst. of Technology, Bombay","institution_ids":["https://openalex.org/I162827531"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.8365,"has_fulltext":false,"cited_by_count":28,"citation_normalized_percentile":{"value":0.68403556,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":87,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"150","last_page":"153"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10317","display_name":"Advanced Database Systems and Queries","score":0.9955999851226807,"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.9955999851226807,"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.0003000000142492354,"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/T11269","display_name":"Algorithms and Data Compression","score":0.0003000000142492354,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/multi-query-optimization","display_name":"multi-query optimization","score":1.0},{"id":"https://openalex.org/keywords/query-scheduling","display_name":"query scheduling","score":0.9950000047683716},{"id":"https://openalex.org/keywords/pipelining","display_name":"pipelining","score":0.9480000138282776},{"id":"https://openalex.org/keywords/main-memory","display_name":"main memory","score":0.6330000162124634},{"id":"https://openalex.org/keywords/np-completeness","display_name":"NP-completeness","score":0.9169999957084656},{"id":"https://openalex.org/keywords/approximation-algorithms","display_name":"approximation algorithms","score":0.4480000138282776}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.9046029448509216},{"id":"https://openalex.org/C157692150","wikidata":"https://www.wikidata.org/wiki/Q2919848","display_name":"Query optimization","level":2,"score":0.5857173204421997},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5521975755691528},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.5161657929420471},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.49289822578430176},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.48737531900405884},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4726749360561371},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.41157066822052},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.18536052107810974},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.1553252935409546},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.12164965271949768},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0686977207660675},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.06307271122932434},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"mag:2124186830","doi":null,"is_oa":false,"landing_page_url":"http://i.stanford.edu/~dilys/papers/mqo.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306418077","display_name":"Conference on Management of Data","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Conference on Management of Data","raw_type":null},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.100.6071","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.100.6071","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cse.iitb.ac.in/~sudarsha/Pubs-dir/comad06-dilys.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.73.7293","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.73.7293","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cse.iitb.ac.in/comad/2006/proceedings/150.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.92.6700","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.92.6700","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://i.stanford.edu/~dilys/papers/mqo.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1548134621","https://openalex.org/W1556920079","https://openalex.org/W1969937393","https://openalex.org/W1987175217","https://openalex.org/W1987605824","https://openalex.org/W2002823904","https://openalex.org/W2014250416","https://openalex.org/W2038176938","https://openalex.org/W2056304107","https://openalex.org/W2058978608","https://openalex.org/W2066623874","https://openalex.org/W2076322499","https://openalex.org/W2098416578","https://openalex.org/W2118049966","https://openalex.org/W2153329411","https://openalex.org/W2160091496","https://openalex.org/W2165286227"],"related_works":["https://openalex.org/W1969937393","https://openalex.org/W1539944119","https://openalex.org/W2259181357","https://openalex.org/W2002823904","https://openalex.org/W7098108227","https://openalex.org/W2118049966","https://openalex.org/W2075284083","https://openalex.org/W1963111396","https://openalex.org/W1984385885","https://openalex.org/W2586902511"],"abstract_inverted_index":{"Database":[0],"systems":[1],"frequently":[2],"have":[3],"to":[4,22,59,82],"execute":[5],"a":[6,75],"batch":[7],"of":[8,49,63,94,142],"related":[9],"queries.":[10],"Multi-query":[11],"optimization":[12,24,96],"exploits":[13],"evaluation":[14],"plans":[15],"that":[16,77,108],"share":[17],"common":[18],"results.":[19],"Current":[20],"approaches":[21],"multi-query":[23,95],"assume":[25],"there":[26],"is":[27,118],"infinite":[28],"disk":[29,45],"space,":[30],"and":[31,52,71,103,136,150,162],"very":[32],"limited":[33],"memory":[34,55,66],"space.":[35],"Pipelining":[36,80],"was":[37],"the":[38,57,86,92,123,128,140],"only":[39],"option":[40],"considered":[41],"for":[42,67,127,157],"avoiding":[43],"expensive":[44],"writes.":[46],"The":[47],"availability":[48],"fairly":[50],"large":[51],"inexpensive":[53],"main":[54,65],"motivates":[56],"need":[58],"make":[60],"best":[61],"use":[62],"available":[64],"caching":[68,102,117,135,161],"shared":[69],"results,":[70],"scheduling":[72,114,148],"queries":[73],"in":[74],"manner":[76],"facilitates":[78],"caching.":[79],"needs":[81],"be":[83],"exploited":[84],"at":[85,91],"same":[87],"time.":[88],"We":[89,105,120],"look":[90],"problem":[93,132,144],"taking":[97],"into":[98],"account":[99],"query":[100,113],"scheduling,":[101,134,160],"pipelining.":[104,137,163],"first":[106,124],"prove":[107],"MQO":[109,131,158],"with":[110,133,145,159],"either":[111],"just":[112,116],"or":[115],"NP-complete.":[119],"then":[121],"provide":[122],"known":[125],"algorithms":[126],"most":[129],"general":[130],"After":[138],"showing":[139],"connections":[141],"this":[143],"other":[146],"traditional":[147],"problems":[149,153],"graph":[151],"theoretic":[152],"we":[154],"outline":[155],"heuristics":[156],"1":[164]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2124186830","counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":4}],"updated_date":"2026-11-16T12:05:36.265796","created_date":"2016-06-24T00:00:00"}
