ACM SIGMOD Record · 1991 · 30 citations · 11 references
ComputingComputer ScienceDecision Support SystemsInformation RetrievalNatural Language ProcessingDecision TreesQuery Processing
article Free Access Share on Left-deep vs. bushy trees: an analysis of strategy spaces and its implications for query optimization Authors: Yannis E. Ioannidis Computer Sciences Department, University of Wisconsin, Madison, WI Computer Sciences Department, University of Wisconsin, Madison, WIView Profile , Younkyung Cha Kang Computer Sciences Department, University of Wisconsin, Madison, WI Computer Sciences Department, University of Wisconsin, Madison, WIView Profile Authors Info & Claims ACM SIGMOD RecordVolume 20Issue 2June 1991pp 168–177https://doi.org/10.1145/119995.115813Published:01 April 1991Publication History 112citation1,630DownloadsMetricsTotal Citations112Total Downloads1,630Last 12 Months193Last 6 weeks21 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF
11
Optimization by Simulated Annealing
Scott Kirkpatrick, C. D. Gelatt, M.P. Vecchi · Science · 1983 · 44.6K citations
Access path selection in a relational database management system
Patricia G. Selinger, M. M. Astrahan, Donald D. Chamberlin et al. · 1979 · 2.2K citations
Principles of Database Systems
John Kandiri · 2018 · 892 citations
Randomized algorithms for optimizing large join queries
Yannis Ioannidis, Younkyung Cha Kang · 1990 · 320 citations