Sciweavers

565 search results - page 76 / 113
» Parallel Querying with Non-Dedicated Computers
Sort
View
ICDCS
1995
IEEE
13 years 11 months ago
Specifying Weak Sets
nt formal speci cations of a new abstraction, weak sets, which can be used to alleviate high latencies when retrieving data from a wide-area information system like the World Wide...
Jeannette M. Wing, David C. Steere
DASFAA
2008
IEEE
105views Database» more  DASFAA 2008»
14 years 2 months ago
Redundant Array of Inexpensive Nodes for DWS
The DWS (Data Warehouse Striping) technique is a round-robin data partitioning approach especially designed for distributed data warehousing environments. In DWS the fact tables ar...
Jorge Vieira, Marco Vieira, Marco Costa, Henrique ...
WEA
2010
Springer
245views Algorithms» more  WEA 2010»
14 years 2 months ago
Contraction of Timetable Networks with Realistic Transfers
We successfully contract timetable networks with realistic transfer times. Contraction gradually removes nodes from the graph and adds shortcuts to preserve shortest paths. This r...
Robert Geisberger
HIPC
2004
Springer
14 years 1 months ago
Design of a Robust Search Algorithm for P2P Networks
In this paper, we report a decentralized algorithm, termed ImmuneSearch, for searching p2p networks. ImmuneSearch avoids query message flooding; instead it uses an immune-systems-...
Niloy Ganguly, Geoffrey Canright, Andreas Deutsch
ICDCS
2010
IEEE
13 years 5 months ago
Secure Ranked Keyword Search over Encrypted Cloud Data
As Cloud Computing becomes prevalent, sensitive information are being increasingly centralized into the cloud. For the protection of data privacy, sensitive data has to be encrypte...
Cong Wang, Ning Cao, Jin Li, Kui Ren, Wenjing Lou