Sciweavers

37 search results - page 4 / 8
» Where the Typical Set Partitions Meet and Join
Sort
View
VLDB
2005
ACM
117views Database» more  VLDB 2005»
14 years 24 days ago
Parallel Querying with Non-Dedicated Computers
We present DITN, a new method of parallel querying based on dynamic outsourcing of join processing tasks to non-dedicated, heterogeneous computers. In DITN, partitioning is not th...
Vijayshankar Raman, Wei Han, Inderpal Narang
PPOPP
2003
ACM
14 years 17 days ago
Optimizing data aggregation for cluster-based internet services
Large-scale cluster-based Internet services often host partitioned datasets to provide incremental scalability. The aggregation of results produced from multiple partitions is a f...
Lingkun Chu, Hong Tang, Tao Yang, Kai Shen
ICPP
2007
IEEE
14 years 1 months ago
Incentive-Driven P2P Anonymity System: A Game-Theoretic Approach
– Anonymous communication systems built on P2P infrastructures using anonymity forwarders are frequently affected by the churn problem, i.e. frequent joins and leaves of nodes. T...
Souvik Ray, Giora Slutzki, Zhao Zhang
PVLDB
2011
12 years 10 months ago
CoHadoop: Flexible Data Placement and Its Exploitation in Hadoop
Hadoop has become an attractive platform for large-scale data analytics. In this paper, we identify a major performance bottleneck of Hadoop: its lack of ability to colocate relat...
Mohamed Y. Eltabakh, Yuanyuan Tian, Fatma Özc...
INTENV
2010
13 years 2 months ago
Online Social Networks for the Elderly - Acceptable Interfaces for People with Serious Impairments
Today's Web 2.0 is a place, where people express themselves, interact share their lives, socialize. Thousands of elderly people join various social networking sites or use the...
David Zejda