<--- Back to Details
First PageDocument Content
Information retrieval / Data management / Information science / Hashing / Database theory / Hash join / Join / Relational database / Query optimization / Sort-merge join / Range query / Cartesian product
Date: 2004-07-02 22:35:31
Information retrieval
Data management
Information science
Hashing
Database theory
Hash join
Join
Relational database
Query optimization
Sort-merge join
Range query
Cartesian product

Add to Reading List

Source URL: cs.uwaterloo.ca

Download Document from Source Website

File Size: 213,70 KB

Share Document on Facebook

Similar Documents

Memory Footprint Matters: Efficient Equi-Join Algorithms for Main Memory Data Processing

Memory Footprint Matters: Efficient Equi-Join Algorithms for Main Memory Data Processing

DocID: 1rmpD - View Document

PDF Document

DocID: 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 effici

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 effici

DocID: 13X0y - View Document

Multi-Core, Main-Memory Joins: Sort vs. Hash Revisited Cagri Balkesen, Gustavo Alonso Jens Teubner  ¨

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.edu

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.edu

DocID: 114IE - View Document