Esther Pacitti

ORCID: 0000-0003-1370-9943
Publications
Citations
Views
---
Saved
---
About
Contact & Profiles
Research Areas
  • Peer-to-Peer Network Technologies
  • Distributed and Parallel Computing Systems
  • Caching and Content Delivery
  • Advanced Data Storage Technologies
  • Scientific Computing and Data Management
  • Cloud Computing and Resource Management
  • Advanced Database Systems and Queries
  • Data Management and Algorithms
  • Distributed systems and fault tolerance
  • Time Series Analysis and Forecasting
  • Recommender Systems and Techniques
  • Anomaly Detection Techniques and Applications
  • Graph Theory and Algorithms
  • Data Stream Mining Techniques
  • Data Mining Algorithms and Applications
  • Service-Oriented Architecture and Web Services
  • Data Quality and Management
  • Semantic Web and Ontologies
  • Matrix Theory and Algorithms
  • Web Data Mining and Analysis
  • Opportunistic and Delay-Tolerant Networks
  • Research Data Management Practices
  • Algorithms and Data Compression
  • Privacy-Preserving Technologies in Data
  • Big Data and Business Intelligence

Université de Montpellier
2015-2024

Institut national de recherche en informatique et en automatique
2015-2024

Laboratoire d'Informatique, de Robotique et de Microélectronique de Montpellier
2014-2024

Centre National de la Recherche Scientifique
2019-2024

Data Management (Italy)
2009-2020

Institut National Polytechnique de Toulouse
2009-2020

Nantes Université
2005-2018

Microsoft (France)
2016

Laboratoire d'informatique de Nantes Atlantique
1998-2009

Centre de Recherche en Informatique
2002

Distributed Hash Tables (DHTs) provide a scalable solution for data sharing in P2P systems. To ensure high availability, DHTs typically rely on replication, yet without currency guarantees. Supporting replicated is difficult as it requires the ability to return current replica despite peers leaving network or concurrent updates. In this paper, we give complete problem. We propose an Update Management Service (UMS) deal with availability and efficient retrieval of replicas based timestamping....

10.1145/1247480.1247506 article EN 2007-06-11

Workflows may be defined as abstractions used to model the coherent flow of activities in context an silico scientific experiment. They are employed many domains science such bioinf

10.2200/s00915ed1v01y201904dtm060 article EN Synthesis lectures on data management 2019-05-13

Large-scale, data-intensive scientific applications are often expressed as workflows (SWfs). In this paper, we consider the problem of efficient scheduling a large SWf in multisite cloud, i.e., cloud with geo-distributed data centers (sites). The reasons for using multiple sites to run that is already distributed, necessary resources exceed limits at single site, or monetary cost lower. metadata management has critical impact on efficiency it provides global view location and enables task...

10.1109/tkde.2018.2867857 article EN IEEE Transactions on Knowledge and Data Engineering 2018-08-30

Many websites with a large user base, e.g., of nonprofit organizations, do not have the financial means to install web-servers or use specialized content distribution networks such as Akamai. For those websites, we developed Flower-CDN, locality-aware P2P based content-distribution network (CDN) in which users that are interested website support its content. The idea is peers keep they retrieve and later serve it other close them locality. Our architecture hybrid between structured...

10.1145/1516360.1516410 article EN 2009-03-24

In a database cluster, preventive replication can provide strong consistency without the limitations of synchronous replication. However, original proposal (E. Pacitti et al., 2003) assumes full and has performance limitations. this paper, we address these two in order to scale up large cluster configurations. Our first contribution is refreshment algorithm that reduces delay introduced by prevents inconsistencies for partially replicated databases. second an optimization improves...

10.1109/icpads.2005.114 preprint EN 2005-11-15
Coming Soon ...