نتایج جستجو برای: main memory
تعداد نتایج: 833499 فیلتر نتایج به سال:
Computer systems in the near future are expected to have NonVolatile Main Memory (NVMM), enabled by a new generation of Non-Volatile Memory (NVM) technologies, such as Phase Change Memory (PCM), STT-MRAM, and Memristor. The non-volatility property has the promise to persist in-memory data structures for instantaneous failure recovery. However, realizing such promise requires a careful design to...
Managing and accessing temporal data is of increasing importance for many applications in industry. Yet, even though there was a significant amount of research in academia during the 1990’s, temporal features were only recently included into the SQL:2011 standard. Therefore, only a few temporal operators and with rather poor performance are currently implemented by commercial database systems. ...
Modern computer systems rely extensively on dynamic random-access memory (DRAM) to bridge the performance gap between on-chip cache and secondary storage. However, continuous process scaling has exposed DRAM to high off-state leakage and excessive power consumption from frequent refresh operations. Spintransfer torque magnetoresistive RAM (STT-MRAM) is a plausible replacement for DRAM, given it...
This paper presents a simple and effective method to reduce the size of log data for recovery in main memory databases. Fuzzy checkpointing is known to be very efficient in main memory databases due to asynchronous backup activities. By this feature, most recovery works in the past have used only physical logging schemes. Since the size of physical log records is quite large, physical logging s...
Efficient evaluation of multi-dimensional range queries in a main-memory database is an important, but difficult task. State-of-the-art techniques rely on optimised sequential scans or tree-based structures. For range queries with small result sets, sequential scans exhibit poor asymptotic performance. Also, as the dimensionality of the data set increases, the performance of tree-based structur...
With the rapid decrease in the cost of random access memory (RAM), it will soon become economically feasible to place full-text indexes of a library in main memory. One essential component of the indexing system is a hashing algorithm, which maps a keyword into the memory address of the index information corresponding to that keyword. This thesis studies the application of the minimal perfect h...
represent its worthiness if it is completed before the deadline. For example, consider a stock trading system of an investment consulting company that allows customers to make their orders of the stocks, each customer may set a deadline for the completion of the order transaction. The commission of the company is a percent (say 3%) of the dealed stock price for each transaction. From the standp...
Several memory vendors are pursuing different kinds of memory cells that can offer high density, non-volatility, high performance, and high endurance. In this work, we focus on Memristor technology and identify some of the significant problems in state-of-the-art implementations. These problems include sneak currents during reads and non-uniformity in cell behavior within an array. These proble...
Database systems are currently being used as backbone to thousands of applications. Some of these have very high demands for high availability and fast real-time responses. Examples include telecommunication systems, trading systems, online gaming and sensor networks. Disk-based databases are too slow to facilitate the short response time requirements of these types of systems. Main-memory data...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید