Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from EDBT 2026 / reviewers in the wild / expert

Adegbemiga Ola

dblp:64/1614 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
0since 2021 · last 1992
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 3 · 2 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
2 papers
Data models and query languages · 71% Database theory · 23% Indexing and storage engines · 6%

Topics — the 5 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Data models and query languages › uncertain data
disjunctive information		 0.011992
Relational Databases with Exclusive Disjunctions · ICDE 1992
Data models and query languages › relational algebra
extended relational algebra		 0.011992
Relational Databases with Exclusive Disjunctions · ICDE 1992
Database theory
incomplete information		 0.011992
Relational Databases with Exclusive Disjunctions · ICDE 1992
Data models and query languages
relational algebra		 0.011992
Relational Databases with Exclusive Disjunctions · ICDE 1992
Indexing and storage engines › storage management
storage structures		 0.011992
Relational Databases with Exclusive Disjunctions · ICDE 1992

Methods — techniques the papers use, named apart from their topics

tuple types · 0.0count range · 0.0
YearPublicationVenuePosition
1992 Relational Databases with Exclusive Disjunctions
abstract
The author presents a mechanism for representing exclusive disjunctive information in database tables using various tuple types and a range for the count of the number of tuples in the unknown relation denoted by a table. The relational algebra operators are extended to take the new tables as operands. Query evaluation in the extended model is sound and complete for relational algebra expressions consisting of projection, difference, Cartesian product, or selection operators. Possible storage structures for storing the base tables and algorithms for inserting tuples into a table are described.>
Adegbemiga Ola
 ICDE1
1990 Database Systems for Programmable Logic Controllers
Gultekin Özsoyoglu, Wen-Chi Hou, Adegbemiga Ola
 SSDBM3
1989 A Family of Incomplete Relational Database Models
Adegbemiga Ola, Gultekin Özsoyoglu
 VLDB1