{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:10:11Z","timestamp":1763467811281},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540725206"},{"type":"electronic","value":"9783540725213"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-72521-3_17","type":"book-chapter","created":{"date-parts":[[2007,6,10]],"date-time":"2007-06-10T16:53:29Z","timestamp":1181494409000},"page":"220-234","source":"Crossref","is-referenced-by-count":1,"title":["Tree-Traversal Orientation Analysis"],"prefix":"10.1007","author":[{"given":"Kevin","family":"Andrusky","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stephen","family":"Curial","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jos\u00e9 Nelson","family":"Amaral","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"unstructured":"Ailamaki, A., et al.: DBMSs on a modern processor: Where does time go? In: 25th Very Large Data Base (VLDB) Conference, Edinburgh, Scotland (1999)","key":"17_CR1"},{"key":"17_CR2","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1109\/PACT.2001.953309","volume-title":"10th International Conference on Parallel Architectures and Compilation Techniques (PACT \u201901)","author":"B. Cahoon","year":"2001","unstructured":"Cahoon, B., McKinley, K.S.: Data flow analysis for software prefetching linked data structures in Java. In: 10th International Conference on Parallel Architectures and Compilation Techniques (PACT \u201901), pp. 280\u2013291. IEEE Computer Society Press, Los Alamitos (2001)"},{"doi-asserted-by":"crossref","unstructured":"Calder, B., et al.: Cache-conscious data placement. In: Proceedings of the Eighth International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS-VIII), San Jose (1998)","key":"17_CR3","DOI":"10.1145\/291069.291036"},{"unstructured":"Carlisle, M., Rogers, A.: Olden web page. http:\/\/www.cs.princeton.edu\/~mcc\/olden.html","key":"17_CR4"},{"unstructured":"Chan, S., et al.: Web page: Open research compiler - aurora. http:\/\/sourceforge.net\/projects\/ipf-orc","key":"17_CR5"},{"key":"17_CR6","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1145\/301618.301635","volume-title":"PLDI \u201999: Proceedings of the ACM SIGPLAN 1999 conference on Programming Language Design and Implementation","author":"T.M. Chilimbi","year":"1999","unstructured":"Chilimbi, T.M., Davidson, B., Larus, J.R.: Cache-conscious structure definition. In: PLDI \u201999: Proceedings of the ACM SIGPLAN 1999 conference on Programming Language Design and Implementation, Atlanta, Georgia, United States, pp. 13\u201324. ACM Press, New York (1999)"},{"key":"17_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/301618.301633","volume-title":"PLDI \u201999: Proceedings of the ACM SIGPLAN 1999 conference on Programming Language Design and Implementation","author":"T.M. Chilimbi","year":"1999","unstructured":"Chilimbi, T.M., Hill, M.D., Larus, J.R.: Cache-conscious structure layout. In: PLDI \u201999: Proceedings of the ACM SIGPLAN 1999 conference on Programming Language Design and Implementation, Atlanta, Georgia, United States, pp. 1\u201312. ACM Press, New York (1999)"},{"key":"17_CR8","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1145\/512529.512554","volume-title":"PLDI \u201902: Proceedings of the ACM SIGPLAN 2002 conference on Programming Language Design and Implementation","author":"T.M. Chilimbi","year":"2002","unstructured":"Chilimbi, T.M., Hirzel, M.: Dynamic hot data stream prefetching for general-purpose programs. In: PLDI \u201902: Proceedings of the ACM SIGPLAN 2002 conference on Programming Language Design and Implementation, Berlin, Germany, pp. 199\u2013209. ACM Press, New York (2002)"},{"issue":"2","key":"17_CR9","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1145\/986533.986536","volume":"22","author":"S. Choi","year":"2004","unstructured":"Choi, S., et al.: A general framework for prefetch scheduling in linked data structures and its application to multi-chain prefetching. ACM Transactions on Computer Systems\u00a022(2), 214\u2013280 (2004)","journal-title":"ACM Transactions on Computer Systems"},{"doi-asserted-by":"crossref","unstructured":"Ghiya, R., Hendren, L.J.: Is it a tree, a DAG, or a cyclic graph? A shape analysis for heap-directed pointers in C. In: Symposium on Principles of Programming Languages (POPL), St. Petersburg, Florida, January, pp. 1\u201315 (1996)","key":"17_CR10","DOI":"10.1145\/237721.237724"},{"unstructured":"Ghoting, A., et al.: Cache-conscious frequent pattern mining on a modern processor. In: VLDB \u201905: Proceedings of the 31st international conference on Very large data bases, Trondheim, Norway, pp. 577\u2013588. VLDB Endowment (2005)","key":"17_CR11"},{"key":"17_CR12","volume-title":"SC \u201903: Proceedings of the 2003 ACM\/IEEE conference on Supercomputing","author":"M. Itzkowitz","year":"2003","unstructured":"Itzkowitz, M., et al.: Memory profiling using hardware counters. In: SC \u201903: Proceedings of the 2003 ACM\/IEEE conference on Supercomputing, IEEE Computer Society Press, Los Alamitos (2003)"},{"key":"17_CR13","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1145\/1065010.1065027","volume-title":"PLDI \u201905: Proceedings of the 2005 ACM SIGPLAN conference on Programming language design and implementation","author":"C. Lattner","year":"2005","unstructured":"Lattner, C., Adve, V.: Automatic pool allocation: Improving performance by controlling data structure layout in the heap. In: PLDI \u201905: Proceedings of the 2005 ACM SIGPLAN conference on Programming language design and implementation, Chicago, IL, USA, pp. 129\u2013142. ACM Press, New York (2005)"},{"key":"17_CR14","volume-title":"ACM SIGOPS Operating Systems Review","author":"C.K. Luk","year":"1996","unstructured":"Luk, C.K., Mowry, T.C.: Compiler-based prefetching for recursive data structures. In: ACM SIGOPS Operating Systems Review, ACM Press, New York (1996)"},{"unstructured":"Luk, C.K.: Web resource: Uniprocessor olden tarball. http:\/\/www.cs.cmu.edu\/~luk\/software\/olden_SGI.tar.gz","key":"17_CR15"},{"issue":"1.4","key":"17_CR16","first-page":"1","volume":"9","author":"R. Niewiadomski","year":"2004","unstructured":"Niewiadomski, R., Amaral, J.N., Holte, R.C.: A performance study of data layout techniques for improving data locality in refinement-based pathfinding. ACM Journal of Experimental Algorithmics\u00a09(1.4), 1\u201328 (2004)","journal-title":"ACM Journal of Experimental Algorithmics"},{"key":"17_CR17","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1145\/503272.503283","volume-title":"POPL \u201902: Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages","author":"E. Petrank","year":"2002","unstructured":"Petrank, E., Rawitz, D.: The hardness of cache conscious data placement. In: POPL \u201902: Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, Portland, Oregon, Jan. 2002, pp. 101\u2013112. ACM Press, New York (2002)"},{"key":"17_CR18","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1145\/342009.335449","volume-title":"SIGMOD \u201900: Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data","author":"J. Rao","year":"2000","unstructured":"Rao, J., Ross, K.A.: Making B+ Trees cache conscious in main memory. In: SIGMOD \u201900: Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data, Dallas, Texas, United States, pp. 475\u2013486. ACM Press, New York (2000)"},{"doi-asserted-by":"crossref","unstructured":"Truong, D.N., Bodin, F., Seznec, A.: Improving cache behavior of dynamically allocated data structures. In: Seventh International Conference on Parallel Architectures and Compilation Techniques (PACT\u201998), pp. 322\u2013329 (1998)","key":"17_CR19","DOI":"10.1109\/PACT.1998.727268"},{"doi-asserted-by":"crossref","unstructured":"Zhao, P., et al.: Forma: A framework for safe automatic array reshaping. ACM Transactions on Programming Languages and Systems (To Appear)","key":"17_CR20","DOI":"10.1145\/1290520.1290522"}],"container-title":["Lecture Notes in Computer Science","Languages and Compilers for Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72521-3_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:34:13Z","timestamp":1605764053000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72521-3_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540725206","9783540725213"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72521-3_17","relation":{},"subject":[]}}