Sciweavers

12453 search results - page 28 / 2491
» Concurrent Data Structures
Sort
View
SPDP
1993
IEEE
15 years 4 months ago
How to Share an Object: A Fast Timing-Based Solution
We consider the problem of transforming a given sequential implementation of a data structure into a wait-free concurrent implementation. Given the code for different operations ...
Rajeev Alur, Gadi Taubenfeld
AOSD
2006
ACM
15 years 5 months ago
Reusable aspect-oriented implementations of concurrency patterns and mechanisms
In this paper, we present a collection of well-known high-level concurrency patterns and mechanisms, coded in AspectJ. We discuss benefits of these implementations relative to pla...
Carlos A. Cunha, João Luís Sobral, M...
ADC
2000
Springer
326views Database» more  ADC 2000»
15 years 4 months ago
T-Tree or B-Tree: Main Memory Database Index Structure Revisited
While the B-tree (or the B+ -tree) is the most popular index structure in disk-based relational database systems, the Ttree has been widely accepted as a promising index structure...
Hongjun Lu, Yuet Yeung Ng, Zengping Tian
VLDB
1993
ACM
73views Database» more  VLDB 1993»
15 years 4 months ago
A Model of Methods Access Authorization in Object-oriented Databases
Object-oriented databases are a recent and important development and many studies of them have been performed. These consider aspects such as data modeling, query languages, perfo...
Nurit Gal-Oz, Ehud Gudes, Eduardo B. Fernán...
ICLP
2010
Springer
15 years 3 months ago
Structured Interactive Musical Scores
Interactive Scores is a formalism for the design and performance of interactive scenarios that provides temporal relations (TRs) among the objects of the scenario. We can model TRs...
Mauricio Toro-Bermudez