Skip to main navigation
Skip to search
Skip to main content
The Hebrew University of Jerusalem Home
Approve / Request updates on publications
Home
Profiles
Research units
Research output
Prizes
Search by expertise, name or affiliation
An incremental algorithm for computing ranked full disjunctions
Sara Cohen
*
,
Yehoshua Sagiv
*
Corresponding author for this work
The Rachel and Selim Benin School of Engineering and Computer Science
Research output
:
Contribution to conference
›
Paper
›
peer-review
12
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'An incremental algorithm for computing ranked full disjunctions'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Incremental Algorithm
100%
Full Disjunction
100%
Tuple
60%
Rank Order
20%
Information Integration
20%
Join Operator
20%
Connection Relations
20%
Natural Class
20%
Ranking Function
20%
K-tuple
20%
Block-based
20%
Computer Science
Arbitrary Number
100%
Incremental Algorithm
100%
Ranking Function
100%
Information Integration
100%