Sciweavers

11211 search results - page 38 / 2243
» Data Structures
Sort
View
WDAG
2004
Springer
88views Algorithms» more  WDAG 2004»
15 years 3 months ago
Nonblocking Concurrent Data Structures with Condition Synchronization
We apply the classic theory of linearizability to operations that must wait for some other thread to establish a precondition. We model such an operation as a request and a follow-...
William N. Scherer III, Michael L. Scott
DBPL
1999
Springer
98views Database» more  DBPL 1999»
15 years 2 months ago
Ozone: Integrating Structured and Semistructured Data
Applications have an increasing need to manage semistructured data such as data encoded in XML along with conventional structured data. We extend the structured object database ...
Tirthankar Lahiri, Serge Abiteboul, Jennifer Widom
ITNG
2007
IEEE
15 years 4 months ago
Super Iterator A design pattern for Algorithm and Data structure collections
The Super Iterator pattern, like the standard Iterator pattern, traverses an unknown data structure without exposing that structure. With the standard Iterator pattern, clients mu...
Andre Oboler, Charles Twardy, David W. Albrecht
PPOPP
2012
ACM
13 years 5 months ago
A methodology for creating fast wait-free data structures
Lock-freedom is a progress guarantee that ensures overall program progress. Wait-freedom is a stronger progress guarantee that ensures the progress of each thread in the program. ...
Alex Kogan, Erez Petrank
FSTTCS
2001
Springer
15 years 2 months ago
Computability and Complexity Results for a Spatial Assertion Language for Data Structures
Abstract. This paper studies a recently developed an approach to reasoning about mutable data structures, which uses an assertion language with spatial conjunction and implication ...
Cristiano Calcagno, Hongseok Yang, Peter W. O'Hear...