An incremental algorithm for computing ranked full disjunctions (Q882441): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 16:49, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An incremental algorithm for computing ranked full disjunctions |
scientific article |
Statements
An incremental algorithm for computing ranked full disjunctions (English)
0 references
23 May 2007
0 references
incomplete information
0 references
query processing
0 references
full disjunction
0 references
null values
0 references
outer-join
0 references
ranking
0 references
approximate
0 references
