-core and multiprocessing architectures, we propose a highly-concurrent nonblocking software implementation of krmw, which induces only constant space complexity overhead. Our algorithm ensures that two operations delay each other only if they are within distance O(k) in the conflict graph, dynamically induced

campaigns, and nd the most e ective logical structure for their Web space. This type of analysis involves the discovery of meaningful relationships from a large collection of primarily unstructured data, often stored in Web server access logs. We propose a framework for Web mining, the applications of data

(MMOGs) can include millions of concurrent players spread across the world and interacting with each other within a single session. Faced with high resource demand variability and with misfit resource renting policies, the current industry practice is to over-provision for each game tens of self

There has been a flurry of recent work on the design of high performance software and hybrid hardware/software transactional memories (STMs and HyTMs). This paper reexamines the design decisions behind several of these stateof-the-art algorithms, adopting some ideas, rejecting others, all

database. Log-structuring leverages the high random I/O rate of flash and automatically wear-levels it. Hyder uses a data-sharing architecture that scales out without partitioning the database or application. Each transac-tion executes on a snapshot, logs its updates in one record, and broadcasts the log

of concurrency. In this paper, we propose a dynamic index structure that is efficient in both of updates and query processing, and to mini-mize lock regions, we also present a new locking method, called adaptive granular locking, which utilizes hyper-rectangular locks in multidimensional space. In addition

Speculation is a well-known means of increasing parallelism among concurrent methods that are usually but not always independent. Traditional nonblocking data structures employ a particularly restrictive form of speculation. Software transactional memory (STM) systems employ a much more general

inexpensive archive media, and high insert and update rates. This paper introduces a new ac-cess method for transaction-time temporal data, called the Log-structured History Data Access Method (LHAM) that meets these demands. The basic principle of LHAM is to partition the data into successive components

-processor machines with no special IPC hardware support. (Some mainframes have hardware assistance where more than one address space can be accessed at the same time.) We are studying communication designs in the context of the Raid system, a robust and adaptable distributed database system for transaction

problem of concurrent source shcmea changes but also added benefit is more efficient than previous solutions from the literature. As foundation of our solution, we encapsulate the complete data warehouse maintenance process as a DWMS Transaction. We design a multiversion timestamp source wrapper