In the environment of wide-area networks such as the Internet, distributed query processing becomes problematic due to the changing coming from both underlying networks and user...
We study the problem of continuous relational query processing in Internet-scale overlay networks realized by distributed hash tables. We concentrate on the case of continuous two...
We propose a new distributed, fault-tolerant peer-to-peer index structure called the P-tree. P-trees efficiently evaluate range queries in addition to equality queries.
Adina Crainiceanu, Prakash Linga, Johannes Gehrke,...
We introduce the concept of a trust network—a decentralized payment infrastructure in which payments are routed as IOUs between trusted entities. The trust network has directed ...
Arpita Ghosh, Mohammad Mahdian, Daniel M. Reeves, ...