Sciweavers

251 search results - page 32 / 51
» Transactions with isolation and cooperation
Sort
View
VLDB
2005
ACM
397views Database» more  VLDB 2005»
14 years 10 months ago
Concurrency control and recovery for balanced B-link trees
Abstract. In this paper we present new concurrent and recoverable B-link-tree algorithms. Unlike previous algorithms, ours maintain the balance of the B-link tree at all times, so ...
Ibrahim Jaluta, Seppo Sippu, Eljas Soisalon-Soinin...
MOBIHOC
2002
ACM
14 years 9 months ago
Performance analysis of the CONFIDANT protocol
: Mobile ad-hoc networking works properly only if the participating nodes cooperate in routing and forwarding. However, it may be advantageous for individual nodes not to cooperate...
Sonja Buchegger, Jean-Yves Le Boudec
COOPIS
1998
IEEE
14 years 2 months ago
A Generative Communication Service for Database Interoperability
Parallel and distributed programming is conceptually harder to undertake and to understand than sequential programming, because a programmer often has to manage the coexistence an...
Wilhelm Hasselbring, Mark Roantree
ATAL
2009
Springer
14 years 4 months ago
A memetic framework for describing and simulating spatial prisoner's dilemma with coalition formation
This paper presents a framework for describing the spatial distribution and the global frequency of agents who play the spatial prisoner’s dilemma with coalition formation. The ...
Juan C. Burguillo-Rial
SNAM
2011
246views more  SNAM 2011»
13 years 4 months ago
Market basket analysis with networks
The field of market basket analysis, the search for meaningful associations in customer purchase data, is one of the oldest areas of data mining. The typical solution involves th...
Troy Raeder, Nitesh V. Chawla