{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,8]],"date-time":"2026-02-08T07:54:45Z","timestamp":1770537285502,"version":"3.49.0"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2011,6,29]],"date-time":"2011-06-29T00:00:00Z","timestamp":1309305600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The VLDB Journal"],"published-print":{"date-parts":[[2012,2]]},"DOI":"10.1007\/s00778-011-0240-z","type":"journal-article","created":{"date-parts":[[2011,6,28]],"date-time":"2011-06-28T08:43:43Z","timestamp":1309250623000},"page":"145-165","source":"Crossref","is-referenced-by-count":2,"title":["Which sort orders are interesting?"],"prefix":"10.1007","volume":"21","author":[{"given":"Ravindra","family":"Guravannavar","sequence":"first","affiliation":[]},{"given":"S.","family":"Sudarshan","sequence":"additional","affiliation":[]},{"given":"Ajit A.","family":"Diwan","sequence":"additional","affiliation":[]},{"given":"Ch. Sobhan","family":"Babu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,6,29]]},"reference":[{"key":"240_CR1","doi-asserted-by":"crossref","unstructured":"Cao, Y., Bramandia, R., Chan, C.-Y., Kian-Lee, T.: Optimized query evaluation using cooperative sorts. In: International Conference on Data Engineering (2010)","DOI":"10.1109\/ICDE.2010.5447894"},{"issue":"3","key":"240_CR2","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1007\/s007780000030","volume":"9","author":"J. Claussen","year":"2000","unstructured":"Claussen J., Kemper A., Kossmann D., Wiesner C.: Exploiting early sorting and early partitioning for decision support query Processing. VLDB J. Very Large Data Bases 9(3), 190\u2013213 (2000)","journal-title":"VLDB J. Very Large Data Bases"},{"issue":"3","key":"240_CR3","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1145\/568522.568523","volume":"34","author":"J. Diaz","year":"2002","unstructured":"Diaz J., Petit J., Maria S.: A survey of graph layout problems. ACM Comput. Surv 34(3), 313\u2013356 (2002)","journal-title":"ACM Comput. Surv"},{"issue":"4","key":"240_CR4","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1145\/146370.146381","volume":"24","author":"V. Estivill-Castro","year":"1992","unstructured":"Estivill-Castro V., Derick W.: A survey of adaptive sorting algorithms. ACM Comput. Surv 24(4), 441\u2013476 (1992)","journal-title":"ACM Comput. Surv"},{"key":"240_CR5","doi-asserted-by":"crossref","unstructured":"Goetz, G.: Implementing sorting in database systems. ACM Comput. Surv. 38(3), (2006)","DOI":"10.1145\/1132960.1132964"},{"key":"240_CR6","unstructured":"Graefe, G., Bunker, R., Cooper, S.: Hash joins and hash teams in Microsoft SQL Server. In: International Conference on Very Large Databases, pp. 86\u201397 (1998)"},{"key":"240_CR7","unstructured":"Graefe, G., McKenna, W.J.: The volcano optimizer generator: extensibility and efficient search. In: International Conference on Data Engineering (1993)"},{"key":"240_CR8","doi-asserted-by":"crossref","unstructured":"Guravannavar, R., Sudarshan, S.: Reducing order enforcement cost in complex query plans. In: International Conferences on Data Engineering (2007)","DOI":"10.1109\/ICDE.2007.367931"},{"issue":"6","key":"240_CR9","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/j.ipl.2007.08.032","volume":"105","author":"S. Kenkre","year":"2008","unstructured":"Kenkre S., Vishwanathan S.: The common prefix problem on trees. Inf. Process. Lett. 105(6), 245\u2013248 (2008)","journal-title":"Inf. Process. Lett."},{"key":"240_CR10","volume-title":"The art of programming, vol. 3: sorting and searching","author":"D.E. Knuth","year":"1998","unstructured":"Knuth D.E.: The art of programming, vol. 3: sorting and searching. Addison Wesley Longman Publishing, Co. Inc., Redwood City (1998)"},{"issue":"4","key":"240_CR11","doi-asserted-by":"crossref","first-page":"961","DOI":"10.1109\/TKDE.2003.1209012","volume":"15","author":"P. Larson","year":"2003","unstructured":"Larson P.: External sorting: run formation revisited. IEEE Trans. Knowl. Data Eng 15(4), 961\u2013972 (2003)","journal-title":"IEEE Trans. Knowl. Data Eng"},{"key":"240_CR12","doi-asserted-by":"crossref","unstructured":"Neumann, T., Moerkotte, G.: A combined framework for grouping and order optimization. In: International Conference on Very Large Databases (2004)","DOI":"10.1016\/B978-012088469-8\/50084-X"},{"key":"240_CR13","unstructured":"Neumann, T., Moerkotte, G.: An efficient framework for order optimization. In: International Conference on Data Engineering (2004)"},{"key":"240_CR14","unstructured":"Roy, P.: Multi-query optimization and applications. PhD thesis, Indian Institute of Technology, Bombay, Department of Computer Science and Engineering (2001)"},{"key":"240_CR15","unstructured":"Griffiths, S.P., Astrahan, M.M., Chamberlin, D.D., Lorie, R.A., Price, T.G.: Access path selection in a relational database management system. In: ACM SIGMOD (1979)"},{"key":"240_CR16","doi-asserted-by":"crossref","unstructured":"Simmen, D., Shekita, E., Timothy, M.: Fundamental Techniques for Order Optimization. In ACM SIGMOD (1996)","DOI":"10.1145\/233269.233320"},{"key":"240_CR17","doi-asserted-by":"crossref","unstructured":"Wang, X., Cherniack, M.: Avoiding sorting and grouping in processing queries. In: International Conference on Very Large Databases (2003)","DOI":"10.1016\/B978-012722442-8\/50078-1"},{"key":"240_CR18","doi-asserted-by":"crossref","unstructured":"Zhou, J., Larson, P., Chaiken, R.: Incorporating partitioning and Parallel Plans into the SCOPE optimizer. In: International Conference on Data Engineering (2010)","DOI":"10.1109\/ICDE.2010.5447802"}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-011-0240-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00778-011-0240-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-011-0240-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,12]],"date-time":"2019-06-12T12:51:36Z","timestamp":1560343896000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00778-011-0240-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6,29]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,2]]}},"alternative-id":["240"],"URL":"https:\/\/doi.org\/10.1007\/s00778-011-0240-z","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"value":"1066-8888","type":"print"},{"value":"0949-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,6,29]]}}}