An incremental algorithm for computing ranked full disjunctions (Q882441): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.jcss.2006.10.015 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1965761777 / rank | |||
Normal rank | |||
Revision as of 22:52, 19 March 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
