1381 search results - page 8 / 277 » Structural signatures for tree data structures |
FOCS
1996
IEEE
13 years 11 months ago
1996
IEEE
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. ...
DIMVA
2009
13 years 8 months ago
2009
Abstract. This paper introduces a new software polymorphism technique that randomizes program data structure layout. This technique will generate different data structure layouts f...
PODC
2010
ACM
13 years 11 months ago
2010
ACM
We show how to partition data structures representable by directed acyclic graphs, i.e. rooted trees, to allow for efficient complex operations, which lie beyond inserts, deletes ...
DAWAK
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We present a technique for discovering and representing changes between versions of data warehouse structures. We select a tree comparison algorithm, adapt it for the par...
SIGMOD
2003
ACM
14 years 7 months ago
2003
ACM
With the growing importance of XML in data exchange, much research has been done in providing flexible query facilities to extract data from structured XML documents. In this pape...