Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies
if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the
same subfield and year (this is the minimum needed to enter the top 1%, not the average
within it), or reaches the top citation threshold in at least one of its specific research
topics.
The theory of relational databases
1984596 citationsMichel AdibaScience of Computer Programmingprofile →
Peers — A (Enhanced Table)
Peers by citation overlap · career bar shows stage (early→late)
cites ·
hero ref
This map shows the geographic impact of Michel Adiba's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Michel Adiba with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Michel Adiba more than expected).
This network shows the impact of papers produced by Michel Adiba. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Michel Adiba. The network helps show where Michel Adiba may publish in the future.
Co-authorship network of co-authors of Michel Adiba
This figure shows the co-authorship network connecting the top 25 collaborators of Michel Adiba.
A scholar is included among the top collaborators of Michel Adiba based on the total number of
citations received by their joint publications. Widths of edges
represent the number of papers authors have co-authored together.
Node borders
signify the number of papers an author published with Michel Adiba. Michel Adiba is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
All Works
20 of 20 papers shown
1.
Collet, Christine, et al.. (2003). Le système WHES pour l'évolution des entrepôts de données..
2.
Roncancio, Claudia, et al.. (2003). Adaptable Mobile Transactions..
Adiba, Michel, et al.. (1984). Information Processing for CAD/VLSI on a Generalized Data Management System. Very Large Data Bases. 371–374.4 indexed citations
13.
Adiba, Michel. (1984). The theory of relational databases. Science of Computer Programming. 4(1). 95–96.596 indexed citations breakdown →
14.
Adiba, Michel. (1982). Distributed Data Base Research at Grenoble University.. IEEE Data(base) Engineering Bulletin. 5. 2–8.
15.
Adiba, Michel & Juan Manuel Andrade Navia. (1981). Update Consistency and Parallelism in Distributed Databases.. International Conference on Distributed Computing Systems. 180–187.
16.
Adiba, Michel. (1981). Derived relations: a unified mechanism for views, snapshots, and distributed data. Very Large Data Bases. 293–305.18 indexed citations
17.
Adiba, Michel, et al.. (1980). An Overview of the Polypheme Distributed Database Management System.. IFIP Congress. 475–479.1 indexed citations
18.
Adiba, Michel, et al.. (1978). Issues in distributed data base management systems: a technical overview. Very Large Data Bases. 89–110.14 indexed citations
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive
bibliographic database. While OpenAlex provides broad and valuable coverage of the global
research landscape, it—like all bibliographic datasets—has inherent limitations. These include
incomplete records, variations in author disambiguation, differences in journal indexing, and
delays in data updates. As a result, some metrics and network relationships displayed in
Rankless may not fully capture the entirety of a scholar's output or impact.