First Page | Document Content | |
---|---|---|
Date: 2015-08-14 19:41:23Information retrieval Information science Computing Hashing Sorting algorithms Search algorithms Database management systems Hash join Sort-merge join Hash function Merge algorithm Hash table | Memory Footprint Matters: Efficient Equi-Join Algorithms for Main Memory Data ProcessingAdd to Reading ListSource URL: web.cse.ohio-state.eduDownload Document from Source WebsiteFile Size: 223,16 KBShare Document on Facebook |
Memory Footprint Matters: Efficient Equi-Join Algorithms for Main Memory Data ProcessingDocID: 1rmpD - View Document | |
PDF DocumentDocID: 1j4MP - View Document | |
On Producing High and Early Result Throughput in Multi-join Query Plans Justin J. Levandoski, Member, IEEE, Mohamed E. Khalefa, Member, IEEE, and Mohamed F. Mokbel, Member, IEEE Abstract—This paper introduces an efficiDocID: 13X0y - View Document | |
Multi-Core, Main-Memory Joins: Sort vs. Hash Revisited Cagri Balkesen, Gustavo Alonso Jens Teubner ¨DocID: 1158a - View Document | |
Memory Footprint Matters: Efficient Equi-Join Algorithms for Main Memory Data Processing Spyros Blanas and Jignesh M. Patel University of Wisconsin–Madison {sblanas,jignesh}@cs.wisc.eduDocID: 114IE - View Document |