520 search results - page 55 / 104 » Playing to Retain the Advantage |
VLDB
2004
ACM
14 years 2 months ago
2004
ACM
Large writes are beneficial both on individual disks and on disk arrays, e.g., RAID-5. The presented design enables large writes of internal B-tree nodes and leaves. It supports b...
DOLAP
2003
ACM
14 years 2 months ago
2003
ACM
The data cube operator exemplifies two of the most important aspects of OLAP queries: aggregation and dimension hierarchies. In earlier work we presented Dwarf, a highly compress...
IMC
2003
ACM
14 years 2 months ago
2003
ACM
In this paper, we consider the problem of how to represent the locations of Internet hosts in a Cartesian coordinate system to facilitate estimate of the network distance between ...
IWCMC
2010
ACM
14 years 2 months ago
2010
ACM
In reactive routing protocols, active routes for multihop connections retain their topological structure in spite of node movement over time. Unfortunately, node movements may mak...
SIGMOD
2010
ACM
14 years 1 months ago
2010
ACM
Maximal clique enumeration (MCE) is a fundamental problem in graph theory and has important applications in many areas such as social network analysis and bioinformatics. The prob...