An incremental algorithm for computing ranked full disjunctions (Q882441)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5156651
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An incremental algorithm for computing ranked full disjunctions |
scientific article; zbMATH DE number 5156651 |
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
0 references
0 references
0.8371809
0 references
0.83707124
0 references
0.8309269
0 references
0.8305701
0 references
