{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T07:06:53Z","timestamp":1648796813454},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2007,3,1]],"date-time":"2007-03-01T00:00:00Z","timestamp":1172707200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comput Sci Technol"],"published-print":{"date-parts":[[2007,3]]},"DOI":"10.1007\/s11390-007-9034-6","type":"journal-article","created":{"date-parts":[[2007,4,18]],"date-time":"2007-04-18T18:54:08Z","timestamp":1176922448000},"page":"273-279","source":"Crossref","is-referenced-by-count":2,"title":["Efficient Execution of Multiple Queries on Deep Memory Hierarchy"],"prefix":"10.1007","volume":"22","author":[{"given":"Yan","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhi-Feng","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuan-Yuan","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,4,17]]},"reference":[{"key":"9034_CR1","first-page":"266","volume-title":"Proc. VLDB\u201999","author":"A Ailamaki","year":"1999","unstructured":"Ailamaki A, DeWitt D J, Hill M D et al. DBMSs on a modern processor: Where does time go? In Proc. VLDB\u201999, Edinburgh, Scotland, UK, 1999, pp.266\u2013277."},{"key":"9034_CR2","first-page":"39","volume-title":"Proc. ISCA\u201998, IEEE Computer Society","author":"J L Lo","year":"1998","unstructured":"Lo J L, Barroso L A, Eggers S J et al. An analysis of database workload performance on simultaneous multithreaded processors. In Proc. ISCA\u201998, IEEE Computer Society, Barcelona, Spain, 1998, pp.39\u201350."},{"key":"9034_CR3","doi-asserted-by":"crossref","unstructured":"Trancoso P, Larriba-Pey J L, Zhang Z et al. The memory performance of DSS commercial workloads in shared-memory multiprocessors. In Proc. HPCA\u201997, San Antonio, Texas, USA, 1997, pp.250\u2013260.","DOI":"10.1109\/HPCA.1997.569680"},{"issue":"3","key":"9034_CR4","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1007\/s00778-002-0074-9","volume":"11","author":"A Ailamaki","year":"2002","unstructured":"Ailamaki A, DeWitt D J, Hill M D. Data page layouts for relational databases on deep memory hierarchies. The VLDB Journal, 2002, 11(3): 198\u2013215.","journal-title":"The VLDB Journal"},{"key":"9034_CR5","doi-asserted-by":"crossref","unstructured":"Hankins R A, Patel J M. Data morphing: An adaptive, cache-conscious storage technique. In Proc. VLDB\u201903, Berlin, Germany, 2003, pp.417\u2013428.","DOI":"10.1016\/B978-012722442-8\/50044-6"},{"key":"9034_CR6","first-page":"235","volume-title":"Proc. SIGMOD\u201901","author":"S Chen","year":"2001","unstructured":"Chen S, Gibbons P B, Mowry T C. Improving index performance through prefetching. In Proc. SIGMOD\u201901, Santa Barbara, CA, USA, ACM Press, 2001, pp.235\u2013246."},{"key":"9034_CR7","doi-asserted-by":"crossref","unstructured":"Wolf M E, Lam M S. A data locality optimizing algorithm. In Proc. PLDI\u201991, Toronto, Ontario, Canada, 1991, pp.30\u201344.","DOI":"10.1145\/113446.113449"},{"key":"9034_CR8","first-page":"60","volume-title":"Proc. ASPLOS\u201996","author":"J Philbin","year":"1996","unstructured":"Philbin J, Edler J, Anshus O J et al. Thread scheduling for cache locality. In Proc. ASPLOS\u201996, Cambridge, Massachusetts, USA, ACM Press, 1996, pp.60\u201371."},{"key":"9034_CR9","first-page":"57","volume-title":"Proc. IOPADS\u201999","author":"Y Zhou","year":"1999","unstructured":"Zhou Y, Wang L, Clark D W et al. Thread scheduling for out-of-core applications with memory server on multicomputers. In Proc. IOPADS\u201999, Atlanta, GA, USA, ACM Press, 1999, pp.57\u201367."},{"key":"9034_CR10","unstructured":"IBM. Personal communication with IBM, Jan. 2005."},{"key":"9034_CR11","first-page":"235","volume-title":"Proc. SIGMOD\u201982","author":"S Finkelstein","year":"1982","unstructured":"Finkelstein S. Common expression analysis in database applications. In Proc. SIGMOD\u201982, Orlando, Florida, USA, ACM Press, 1982 pp.235\u2013245."},{"issue":"1","key":"9034_CR12","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1145\/42201.42203","volume":"13","author":"T K Sellis","year":"1998","unstructured":"Sellis T K. Multiple-query optimization. ACM Trans. Database Syst., 1998, 13(1): 23\u201352.","journal-title":"ACM Trans. Database Syst."},{"issue":"2","key":"9034_CR13","first-page":"262","volume":"2","author":"T K Sellis","year":"1990","unstructured":"Sellis T K, Ghosh S. On the multiple-query optimization problem. IEEE TKDE, 1990, 2(2): 262\u2013266.","journal-title":"IEEE TKDE"},{"key":"9034_CR14","first-page":"11","volume-title":"Proc. IDEAS\u201901","author":"A Gupta","year":"2001","unstructured":"Gupta A, Sudarshan S, Viswanathan S. Query scheduling in multi query optimization. In Proc. IDEAS\u201901, Grenoble, France, IEEE Computer Society, 2001, pp.11\u201319."},{"key":"9034_CR15","first-page":"383","volume-title":"Proc. SIGMOD\u201994","author":"MJ Carey","year":"1994","unstructured":"Carey M J, e David, J DeWitt. Shoring up persistent applications. In Proc. SIGMOD\u201994, Minneapolis, USA, ACM Press, 1994, pp.383\u2013394."},{"key":"9034_CR16","first-page":"311","volume-title":"Proc. ICDE\u201988","author":"J Park","year":"1988","unstructured":"Park J, Segev A. Using common subexpressions to optimize multiple queries. In Proc. ICDE\u201988, Los Angeles, CA, USA, IEEE Computer Society, 1988, pp.311\u2013319."},{"key":"9034_CR17","first-page":"59","volume-title":"Proc. PODS\u201901","author":"NN Dalvi","year":"2001","unstructured":"Dalvi N N, Sanghai S K, Roy P, Sudarshan S. Pipelining in multi-query optimization. In Proc. PODS\u201901, Santa Barbara, CA, USA, ACM Press, 2001, pp.59\u201370."},{"key":"9034_CR18","first-page":"249","volume-title":"Proc. SIGMOD\u201900","author":"P Roy","year":"2000","unstructured":"Roy P, Seshadri S, Sudarshan S, Bhobe S. Efficient and extensible algorithms for multi query optimization. In Proc. SIGMOD\u201900, Dallas, Texas, USA, ACM Press, 2000, pp.249\u2013260."},{"key":"9034_CR19","doi-asserted-by":"crossref","unstructured":"Harizopoulos S, Shkapenyuk V, Ailamaki A. Qpipe: A simultaneously pipelined relational query engine. In Proc. SIGMOD\u201905, Baltimore, Maryland, USA, 2005, pp.383\u2013394.","DOI":"10.1145\/1066157.1066201"},{"key":"9034_CR20","first-page":"274","volume-title":"Proc. ICDE02","author":"K O\u2019Gorman","year":"2002","unstructured":"O\u2019Gorman K, Agrawal D, Abbadi A E. Multiple query optimization by cache-aware middleware using query teamwork. In Proc. ICDE02, San Jose, CA, USA, IEEE Computer Society, 2002, p.274."},{"key":"9034_CR21","unstructured":"Boncz P A, Manegold S, Kersten M L. Database architecture optimized for the new bottleneck: Memory access. In Proc. VLDB\u201999, Edinburgh, Scotland, UK, 1999, pp.54\u201365."},{"key":"9034_CR22","first-page":"157","volume-title":"Proc. SIGMOD\u201902","author":"S Chen","year":"2002","unstructured":"Chen S, Gibbons P B, Mowry T C et al. Fractal prefetching B +-trees: Optimizing both cache and disk performance. In Proc. SIGMOD\u201902, Madison, USA, ACM Press, 2002, pp.157\u2013168."},{"key":"9034_CR23","first-page":"139","volume-title":"Proc. SIGMOD\u201901","author":"K Kim","year":"2001","unstructured":"Kim K, Cha S K, Kwon K. Optimizing multidimensional index trees for main memory access. In Proc. SIGMOD\u201901, Santa Barbara, CA, USA, ACM Press, 2001, pp.139\u2013150."},{"key":"9034_CR24","doi-asserted-by":"crossref","unstructured":"Ramamurthy R, DeWitt D J, Su Q. A case for fractured mirrors. In Proc. VLDB\u201902, Hong Kong, China, 2002, pp.430\u2013441.","DOI":"10.1016\/B978-155860869-6\/50045-7"},{"key":"9034_CR25","doi-asserted-by":"crossref","unstructured":"Zhou J, Ross K A. Buffering accesses to memory-resident index structures. In Proc. VLDB\u201903, Berlin, Germany, 2003, pp.405\u2013416.","DOI":"10.1016\/B978-012722442-8\/50043-4"},{"key":"9034_CR26","first-page":"475","volume-title":"Proc. SIGMOD\u201900","author":"J Rao","year":"2000","unstructured":"Rao J, Ross K A. Making B +-trees cache conscious in main memory. In Proc. SIGMOD\u201900, Dallas, Texas, USA, ACM Press, 2000, pp.475\u2013486."},{"key":"9034_CR27","unstructured":"Shatdal A, Kant C, Naughton J F. Cache conscious algorithms for relational query processing. In Proc. VLDB\u201994, Santiago de Chile, Chile, 1994, pp.510\u2013521."},{"key":"9034_CR28","unstructured":"Transaction processing performance council. http:\/\/www.tpc.org ."},{"key":"9034_CR29","unstructured":"Zhang Y, Chen Z, Zhou Y. Efficient execution of multiple queries on deep memory hierarchy (full version). http:\/\/www.cis.pku.edu.cn\/teacher\/system\/zhangyan\/paper \/jcst-full.pdf ."},{"key":"9034_CR30","unstructured":"Intel Corporation. Intel Vtune performance analyzer. http:\/\/www.intel.com\/software\/products\/vtune\/ , 2004."}],"container-title":["Journal of Computer Science and Technology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-007-9034-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11390-007-9034-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-007-9034-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T14:32:38Z","timestamp":1559399558000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11390-007-9034-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,3]]},"references-count":30,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2007,3]]}},"alternative-id":["9034"],"URL":"https:\/\/doi.org\/10.1007\/s11390-007-9034-6","relation":{},"ISSN":["1000-9000","1860-4749"],"issn-type":[{"value":"1000-9000","type":"print"},{"value":"1860-4749","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,3]]}}}