477 search results - page 87 / 96 » Storing RDF as a Graph |
WWW
2003
ACM
14 years 10 months ago
2003
ACM
The computation of page importance in a huge dynamic graph has recently attracted a lot of attention because of the web. Page importance, or page rank is defined as the fixpoint o...
ICC
2008
IEEE
14 years 4 months ago
2008
IEEE
— Low-Density Parity-Check (LDPC) codes are typically characterized by a relatively high-complexity description, since a considerable amount of memory is required in order to sto...
INFOCOM
2007
IEEE
14 years 4 months ago
2007
IEEE
—Distributed storage systems provide reliable access to data through redundancy spread over individually unreliable nodes. Application scenarios include data centers, peer-to-pee...
ICALP
2000
Springer
14 years 1 months ago
2000
Springer
In this paper, we provide a method to safely store a document in perhaps the most challenging settings, a highly decentralized replicated storage system where up to half of the st...
APLAS
2010
ACM
13 years 8 months ago
2010
ACM
We consider programming language aspects of algorithms that operate on data too large to fit into memory. In previous work we have introduced IntML, a functional programming langu...