Sciweavers

24 search results - page 3 / 5
» A note on the schemes of replacement and collection
Sort
View
78
Voted
VLDB
1990
ACM
86views Database» more  VLDB 1990»
15 years 2 months ago
How to Forget the Past Without Repeating It
Bottom-up evaluation of deductive database programs has the advantage that it avoids repeated computation by storing all intermediate results and replacing recomputation by table ...
Jeffrey F. Naughton, Raghu Ramakrishnan
FAST
2009
14 years 8 months ago
A Framework for Fine-grained Data Integration and Curation, with Provenance, in a Dataspace
Some tasks in a dataspace (a loose collection of heterogeneous data sources) require integration of fine-grained data from diverse sources. This work is often done by end users kn...
David W. Archer, Lois M. L. Delcambre, David Maier
NOCS
2007
IEEE
15 years 4 months ago
QNoC Asynchronous Router with Dynamic Virtual Channel Allocation
An asynchronous router for QNoC (Quality-of service NoC) is presented. It combines multiple service levels (SL) with multiple equal-priority virtual channels (VC) within each leve...
Rostislav (Reuven) Dobkin, Ran Ginosar, Israel Cid...
SIGCOMM
1998
ACM
15 years 2 months ago
Improving End-to-End Performance of the Web Using Server Volumes and Proxy Filters
The rapid growth of the World Wide Web has caused serious performance degradation on the Internet. This paper o ers an end-to-end approach to improving Web performance by collecti...
Edith Cohen, Balachander Krishnamurthy, Jennifer R...
JSAC
2007
116views more  JSAC 2007»
14 years 9 months ago
GroCoca: group-based peer-to-peer cooperative caching in mobile environment
— In a mobile cooperative caching environment, we observe the need for cooperating peers to cache useful data items together, so as to improve cache hit from peers. This could be...
Chi-Yin Chow, Hong Va Leong, Alvin T. S. Chan