Map
Index
Random
Help
th

Quote: criss-cross hash joins interleaves zoned partitions configured through page maps; low memory and I/O costs; even better if ordered

topics > all references > references g-h > QuoteRef: gopaRD7_2001 , p. 652



Topic:
hash table and hash functions
Topic:
database keys and indexing
Topic:
database queries, joins, and relational algebra

Quotation Skeleton

In cross-cross hashing, the partitioning of the relations … in the hashing effort needed. The interleaved hashing … in a paired zonewise manner. The configuration of … access to each relation, and hence, the criss-cross … The low memory requirements of the proposed algorithms … the proposed approach is guaranteed to incur a … Our results suggest that even a small increase … [over hybrid hashing]. The zoning strategy … captures and exploits the order, in whatever form …   Google-1   Google-2

Copyright clearance needed for quotation.


Related Topics up

Topic: hash table and hash functions (41 items)
Topic: database keys and indexing (18 items)
Topic: database queries, joins, and relational algebra (33 items)

Copyright © 2002-2008 by C. Bradford Barber. All rights reserved.
Thesa is a trademark of C. Bradford Barber.