Sciweavers

2735 search results - page 428 / 547
» Comparing notions of randomness
Sort
View
HT
1991
ACM
15 years 4 months ago
Implementing Hypertext Database Relationships through Aggregations and Exceptions
In order to combine hypertext with database facilities, we show how to extract an effective storage structure from given instance relationships. The schema of the structure recogn...
Yoshinori Hara, Arthur M. Keller, Gio Wiederhold
113
Voted
EDBT
2009
ACM
131views Database» more  EDBT 2009»
15 years 4 months ago
Sample synopses for approximate answering of group-by queries
With the amount of data in current data warehouse databases growing steadily, random sampling is continuously gaining in importance. In particular, interactive analyses of large d...
Philipp Rösch, Wolfgang Lehner
100
Voted
FAST
2008
15 years 3 months ago
TaP: Table-based Prefetching for Storage Caches
TaP is a storage cache sequential prefetching and caching technique to improve the read-ahead cache hit rate and system response time. A unique feature of TaP is the use of a tabl...
Mingju Li, Elizabeth Varki, Swapnil Bhatia, Arif M...
USENIX
2008
15 years 3 months ago
Measurement and Analysis of Large-Scale Network File System Workloads
In this paper we present the analysis of two large-scale network file system workloads. We measured CIFS traffic for two enterprise-class file servers deployed in the NetApp data ...
Andrew W. Leung, Shankar Pasupathy, Garth R. Goods...
117
Voted
WSC
2008
15 years 3 months ago
Measuring the effectiveness of the s-metric to produce better network models
Recent research has shown that while many complex networks follow a power-law distribution for their node degrees, it is not sufficient to model these networks based only on their...
Isabel Beichl, Brian Cloteaux