In this scheme, every server maintains an in-memory index for any connected user.
在此方案中，每个服务器维护任何连接用户的内存索引。
What I would like is a hybrid solution like a "in-memory index" and "disk-based storage" so I could use the 10go of RAM I have to speed up the process.
我想是一个混合的解决方案，如“记忆指数”和“基于磁盘的存储”，所以我可以使用RAM的10go我不得不加快进程。
Each server updates it's in-memory index on each of these events so at any given moment, every server has a live lookup table of where every user is currently connected.
每个服务器更新它在每个这些事件的内存索引，所以在任何给定时刻，每个服务器有一个实时查找表，每个用户当前连接在哪里。
Despite having a brain no bigger than the tip of your index finger, pigeons have a very impressive visual memory.
尽管鸽子的大脑只有人的食指尖那么大，但它们的视觉记忆力却非常惊人。
This instructs DB2 to pass the index keys to the sort program in memory, rather than having the keys written to and read once again from sort work files on DASD.
这将指示DB 2将索引键传递给内存中的排序程序，而不是再次将这些键写到DASD上的排序工作文件中，然后从中读取这些键。
A buffer pool is an area of storage in memory into which database pages (containing table rows or index entries) are temporarily read and changed.
缓冲池是内存中的一块存储区域，用于临时读入和更改数据库页(包含表行或索引项)。
It has two parts: a memory address and an index register.
它包括两个部分：一个内存地址以及一个索引寄存器。
Database performance plummets once index tables don't fit in memory anymore, so scale up memory as far as possible to hold tables.
一旦索引表再也无法装入内存，数据库的性能就会直线下降，所以应该尽量升级内存，以便存放那些表。
Also keep in mind that on AIX, there is approximately a Max of 250mb of private virtual memory for index key sorting in LOAD (this is a memory bottleneck).
还请记住，AIX上大约有最大为250MB的私有虚拟内存用于LOAD中的索引键排序(这是内存瓶颈)。
The size of the physical address (the address used by the processor to index physical RAM) limits the amount of memory that can be addressed.
物理地址(处理器用于索引物理ram的地址)的大小限制了可以寻址的内存。
This process can take a long time based on the size of the index, the CPU, and the amount of memory available.
根据索引、CPU以及可用内存的大小，这个过程可能需要较长的一段时间。
Since a DB2 buffer pool is a part of the main memory of the system, the DB2 database manager allocates it for caching tables and index data when it reads or writes to and from media disks.
因为db2缓冲池是系统主内存的一部分，DB 2数据库管理器在它读取或写入磁盘介质时将它分配给缓存表和索引数据。
The changes made to the index are initially buffered in the memory and periodically flushed to the index directory.
对索引所做的更改最初缓存在内存中，并周期性转储到索引目录。
HSQLDB keeps all table and index data in memory, saving all SQL statements issued into a file named database.script, which also ACTS as the transaction log.
HSQLDB将所有表和索引数据放在内存中，将所有发出的sql语句保存到一个名为database .script的文件中，该文件同时也充当着事务日志的角色。
Lucene stores the input data in a data structure called an inverted index, which is stored on the file system or memory as a set of index files.
Lucene将输入数据存储在名为逆序索引的数据结构中，该数据结构以索引文件集的形式存储在文件系统或内存中。
The Database creates further 16 KB Chunks as the index requires more memory.
当索引需要更多的内存，Database会创建另一个 16KB 的Chunk。
For instance, the more indexed Fields added, the greater the memory requirements, the larger the index, and the longer it takes to optimize the index.
比如，添加的已索引Field越多，对内存的需求就越多、索引就越大、优化该索引所需的时间也越长。
When a block of memory is returned to the free pool, the bucket index is calculated just like it is done with allocation.
当把内存块返回给空闲池时，像分配时一样计算bucket索引。
"Another definition would be a database whose index can no longer fit in physical memory-even the terabyte memory of a supercomputer or cluster of machines," he says.
“另一种定义是，如果一个数据库的索引即使是超级计算机或计算机集群的tb级物理内存都无法容纳，那么可以称之为超大数据库，”他说。
The researchers calculated that every extra point of body mass index (BMI – your weight in kilograms divided by the square of your height in metres) led to a 1-point drop in the memory test.
研究人员计算出在记忆测试里她们每超过一个身体质量系数（BMI——身高kg/体重m的平方）值，她们的记忆力就下降一个单位。
The index register is added to the specified address, and the result is used as the address for the memory access.
索引寄存器会与某个指定的地址相加，结果用作访问内存时使用的地址。
For example, a compiler may choose to optimize a loop index variable by storing it in a register, or the cache may delay flushing a new value of a variable to main memory until a more opportune time.
例如，编译器为了优化一个循环索引变量，可能会选择把它存储到一个寄存器中，或者缓存会延迟到一个更适合的时间，才把一个新的变量值存入主存。
The most common in-memory database index strategy is called T-tree.
最常见的内存中数据库索引策略是T -树。
Actually, a table scan of an in-memory table is much faster than searching the same table through an index, especially with the Informix light scan mechanism.
实际上，对内存中的表进行表扫描要比通过索引搜索同一表快得多，尤其是在使用 Informix轻型扫描机制时。
The index search and memory control were the key technology.
其关键技术在于索引查找和内存控制。
A Searcher loads into memory data concerning the contents of an index.
Searcher将索引内容相关的数据加载到内存中。
Added the sentence stating that the size of a full-text index is limited only by the available memory resources of the computer.
添加了说明全文索引大小仅受计算机的可用内存资源限制的内容。
For a long time researchers only focus on disk-based index, but research on memory-based index is of great value today because of the mass memory condition.
以往大部分学者都集中研究磁盘索引，但其实在目前大内存的环境下对内存索引的研究也是非常必要。
For a long time researchers only focus on disk-based index, but research on memory-based index is of great value today because of the mass memory condition.
以往大部分学者都集中研究磁盘索引，但其实在目前大内存的环境下对内存索引的研究也是非常必要。
应用推荐