| The Infinite graph implementation extends the Jena
in-memory model, the Jena RDB model, and, the Jena SDB model to give
the user an impression that memory is infinite. When we say memory is
infinite we mean that we have moved the problem from memory space to
disk space by making the disk space available to the application as
virtual memory. To make use of disk as virtual memory we take nodes in
the RDF graph and write them to disk in a lucene index. The nodes to be
written to disk are selected based on the common memory management
algorithms like FIFO, LIFO, LRU, and, MRU. Query retrieval times using
the lucene index are an order of magnitude slower than pure memory
solutions. |
