Sciweavers

11212 search results - page 7 / 2243
» Semi-persistent Data Structures
Sort
View
DBPL
1999
Springer
98views Database» more  DBPL 1999»
13 years 11 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
ESA
2004
Springer
106views Algorithms» more  ESA 2004»
13 years 11 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...
RSA
2006
144views more  RSA 2006»
13 years 7 months ago
Data structures with dynamical random transitions
We present a (non-standard) probabilistic analysis of dynamic data structures whose sizes are considered as dynamic random walks. The basic operations (insertion, deletion, positi...
Clément Dombry, Nadine Guillotin-Plantard, ...
POPL
1998
ACM
13 years 11 months ago
A Functional Representation of Data Structures with a Hole
Data structures with a hole, in other words data structures with an uninitialized field, are useful to write efficient programs: they enable us to construct functional data stru...
Yasuhiko Minamide
DIMVA
2009
13 years 8 months ago
Polymorphing Software by Randomizing Data Structure Layout
Abstract. This paper introduces a new software polymorphism technique that randomizes program data structure layout. This technique will generate different data structure layouts f...
Zhiqiang Lin, Ryan Riley, Dongyan Xu