Riad Mokadem

Learn More
We propose a novel string search algorithm for data stored once and read many times. Our search method combines the sublinear traversal of the record (as in Boyer Moore or Knuth-Morris-Pratt) with the agglomeration of parts of the record and search pattern into a single character – the algebraic signature – in the manner of Karp-Rabin. Our experiments show(More)
We propose to encode records of a Scalable Distributed Data Structure (SDDS) using precomputed algebraic signatures. The partly pre-computed algebraic signature of a string encodes each symbol into its contribution to the algebraic signature of the string. The cumulative pre-computed algebraic signature encodes each symbol with the signature of the string(More)
Using Distributed Hash Tables (DHT) for resource discovery in large-scale systems generates considerable maintenance overhead. This not only increases the bandwidth consumption but also affect the routing efficiency. In this paper, we deal with resource discovery while minimizing maintenance overhead in hierarchical DHT systems. The considered resources are(More)
Replicating for performance constitutes an important issue in large-scale data management systems. In this context, a significant number of replication strategies have been proposed for data grid systems. Some works classified these strategies into static vs. dynamic or centralised vs. decentralised or client vs. server initiated strategies. Very few works(More)
Scalable distributed data structures (SDDSs) store large scalable files over a distributed RAM of nodes in a grid or a P2P network. The files scale transparently for the applications. The prototype system was designed by CERIA, experiments with this technology for Wintel multicomputers. The application may manipulate data much faster than on local disks. We(More)
Privacy is among the key challenges to data integration in many sectors, including healthcare, e-government, etc. The PAIRSE project aims at providing a flexible, looselycoupled and privacy-preserving data integration system in P2P environments. The project exploits recent Web standards and technologies such asWeb services and ontologies to export data from(More)
Scalable Distributed Data Structures (SDDS) are a class of data structures for multicomputers (a distributed system of networked computers) that allow data access by key in constant time (independent of the number of nodes in the multicomputer) and parallel search of the data. In order to speed up the parallel search of the data fields of the records, we(More)
In data grid systems, data replication aims to increase availability, fault tolerance, load balancing and scalability while reducing bandwidth consumption, and job execution time. Several classification schemes for data replication were proposed in the literature, (i) static vs. dynamic, (ii) centralized vs. decentralized, (iii) push vs. pull, and (iv)(More)