default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRima Bouchakri
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j4]Louis Mullie
, Jonathan Afilalo, Patrick M. Archambault, Rima Bouchakri, Kip Brown, David L. Buckeridge, Yiorgos Alexandros Cavayas, Alexis F. Turgeon, Denis Martineau, François Lamontagne, Martine Lebrasseur, Renald Lemieux, Jeffrey Li, Michaël Sauthier, Pascal St-Onge, An Tang, William Witteman, Michael Chassé:
CODA: an open-source platform for federated analysis and machine learning on distributed healthcare data. J. Am. Medical Informatics Assoc. 31(3): 651-665 (2024)
2010 – 2019
- 2015
- [b1]Rima Bouchakri:
Conception physique statique et dynamique des entrepôts de données. (Static and Dynamic Data Warehouses Design). École nationale supérieure de mécanique et d'aérotechnique, Chasseneuil-du-Poitou, Poitiers, France, 2015 - 2014
- [j3]Rima Bouchakri, Ladjel Bellatreche, Zoé Faget, Sebastian Breß:
A coding template for handling static and incremental horizontal partitioning in data warehouses. J. Decis. Syst. 23(4): 481-498 (2014) - [c9]Rima Bouchakri, Ladjel Bellatreche, Zoé Faget:
Algebra-Based Approach for Incremental Data Warehouse Partitioning. DEXA (2) 2014: 441-448 - 2013
- [c8]Ladjel Bellatreche, Rima Bouchakri, Alfredo Cuzzocrea, Sofian Maabout:
Incremental Algorithms for Selecting Horizontal Schemas of Data Warehouses: The Dynamic Case. Globe 2013: 13-25 - [c7]Ladjel Bellatreche, Rima Bouchakri, Alfredo Cuzzocrea, Sofian Maabout:
Horizontal partitioning of very-large data warehouses under dynamically-changing query workloads via incremental algorithms. SAC 2013: 208-210 - 2012
- [j2]Rima Bouchakri, Ladjel Bellatreche:
Sélection statique et incrémentale des Index de Jointure Binaire: concepts, algorithmes, étude de performance. J. Decis. Syst. 21(1): 51-70 (2012) - [c6]Rima Bouchakri, Ladjel Bellatreche, Khaled-Walid Hidouci:
Static and Incremental Selection of Multi-table Indexes for Very Large Join Queries. ADBIS 2012: 43-56 - [c5]Rima Bouchakri, Ladjel Bellatreche:
Sélection Incrémentale d'un Schéma de Fragmentation Horizontale d'un Entrepôt de Données Relationnel. EDA 2012: 2-16 - [c4]Ladjel Bellatreche, Selma Khouri, Ilyès Boukhari, Rima Bouchakri:
Using ontologies and requirements for constructing and optimizing data warehouses. MIPRO 2012: 1568-1573 - 2011
- [j1]Rima Bouchakri, Kamel Boukhalfa, Ladjel Bellatreche:
Algorithmes de sélection des index de jointure binaires mono et multi-attributs. Ingénierie des Systèmes d Inf. 16(6): 91-116 (2011) - [c3]Rima Bouchakri, Ladjel Bellatreche:
On Simplifying Integrated Physical Database Design. ADBIS 2011: 333-346 - [c2]Rym Bouchakri, Ladjel Bellatreche:
Sélection statique et incrémentale des index de jointure binaires multiples. EDA 2011: 171-186 - 2010
- [c1]Rym Bouchakri, Ladjel Bellatreche, Kamel Boukhalfa:
Une sélection multiple des structures d'optimisation dirigée par la méthode de classification K-means. EDA 2010: 207-222
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
