A number of algorithms of clustering spatial data for reducing the number of disk seeks required to process spatial queries have been developed. One of the algorithms is the scheme...
The dramatic proliferation of sophisticated networks has resulted in a growing need for supporting effective querying and mining methods over such large-scale graph-structured da...
In this paper, we propose an efficient algorithm, called MQSchange (changes of Music Query Streams), to detect the changes of maximal melody structures in user-centered music quer...
— In this paper we propose PARINET, a new access method to efficiently retrieve the trajectories of objects moving in networks. The structure of PARINET is based on a combination...
Iulian Sandu Popa, Karine Zeitouni, Vincent Oria, ...
Many aspects of the data integration problem have been considered in the literature: how to match schemas across different data sources, how to decide when different records refer...