Abstract. Defining persistence in terms of reachability is fundamental to achieving orthogonality of persistence. It is implicit to the principles of orthogonal persistence and is ...
John N. Zigman, Stephen Blackburn, J. Eliot B. Mos...
A new access method, called M-tree, is proposed to organize and search large data sets from a generic "metric space", i.e. where object proximity is only defined by a di...
Animportantgoalofvisualizationtechnologyistosupport the exploration and analysis of very large amounts of data. In this paper, we propose a new visualization technique called ‘r...
Daniel A. Keim, Mihael Ankerst, Hans-Peter Kriegel
The vision of dataspaces has been articulated as providing various of the benefits of classical data integration but with reduced up-front costs, which, combined with opportunitie...
Cornelia Hedeler, Khalid Belhajjame, Lu Mao, Norma...
Whereas traditional Desktop Grids rely on centralized servers for data management, some recent progress has been made to enable distributed, large input data, using to peer-to-peer...