Sciweavers

2157 search results - page 182 / 432
» Optimal Fast Hashing
Sort
View
SIGMOD
2008
ACM
140views Database» more  SIGMOD 2008»
16 years 4 months ago
Relational joins on graphics processors
We present a novel design and implementation of relational join algorithms for new-generation graphics processing units (GPUs). The most recent GPU features include support for wr...
Bingsheng He, Ke Yang, Rui Fang, Mian Lu, Naga K. ...
INFOCOM
2005
IEEE
15 years 10 months ago
FISSIONE: a scalable constant degree and low congestion DHT scheme based on Kautz graphs
Abstract— The distributed hash table (DHT) scheme has become the core component of many large-scale peer-to-peer networks. Degree, diameter, and congestion are important measures...
Dongsheng Li, Xicheng Lu, Jie Wu
ISPAN
2005
IEEE
15 years 10 months ago
Overlay networks with class
We define a family of Distributed Hash Table systems whose aim is to combine routing efficiency of the randomized networks — i.e. average path length O(log n/ log log n) vs. t...
Giovanni Chiola, Gennaro Cordasco, Luisa Gargano, ...
SIGMOD
2005
ACM
133views Database» more  SIGMOD 2005»
15 years 9 months ago
A Nested Relational Approach to Processing SQL Subqueries
One of the most powerful features of SQL is the use of nested queries. Most research work on the optimization of nested queries focuses on aggregate subqueries. However, the solut...
Bin Cao, Antonio Badia
CIKM
2004
Springer
15 years 9 months ago
Evaluating window joins over punctuated streams
We explore join optimizations in the presence of both timebased constraints (sliding windows) and value-based constraints (punctuations). We present the first join solution named...
Luping Ding, Elke A. Rundensteiner