Sciweavers

11214 search results - page 56 / 2243
» Just-in-time data structures
Sort
View
ESOP
2008
Springer
13 years 11 months ago
Semi-persistent Data Structures
A data structure is said to be persistent when any update operation returns a new structure without altering the old version. This paper introduces a new notion of persistence, cal...
Sylvain Conchon, Jean-Christophe Filliâtre
FOCS
1996
IEEE
14 years 2 months ago
Fault Tolerant Data Structures
We study the tolerance of data structures to memory faults. We observe that many pointerbased data structures (e.g., linked lists, trees, etc.) are highly nonresilient to faults. ...
Yonatan Aumann, Michael A. Bender
DBPL
1999
Springer
98views Database» more  DBPL 1999»
14 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
ICALP
2004
Springer
14 years 3 months ago
A General Technique for Managing Strings in Comparison-Driven Data Structures
Abstract. This paper presents a general technique for optimally transforming any dynamic data structure D that operates on atomic and indivisible keys by constant-time comparisons,...
Gianni Franceschini, Roberto Grossi
ESA
2004
Springer
106views Algorithms» more  ESA 2004»
14 years 1 months ago
Efficient Tradeoff Schemes in Data Structures for Querying Moving Objects
The ability to represent and query continuously moving objects is important in many applications of spatio-temporal database systems. In this paper we develop data structures for ...
Pankaj K. Agarwal, Lars Arge, Jeff Erickson, Hai Y...