2124 search results - page 29 / 425 » Repairing Structurally Complex Data |
ICOODB
2010
13 years 6 months ago
2010
Abstract. New emerging applications including genomic, multimedia, and geospatial technologies have necessitated the handling of complex application objects that are highly structu...
ESOP
2008
Springer
13 years 9 months ago
2008
Springer
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...
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 ...
PPL
2008
13 years 7 months ago
2008
A functional data-parallel language called BSML has been designed for programming Bulk-Synchronous Parallel algorithms. Many sequential algorithms do not have parallel counterpart...
DMDW
2003
13 years 9 months ago
2003
: Two main problems arise in modelling data warehouse structures. The first consists in establishing an adequate representation of dimensions in order to facilitate and to control ...