An incremental algorithm for computing ranked full disjunctions (Q882441): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q1106047 |
ReferenceBot (talk | contribs) Changed an Item |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / author | |||
| Property / author: Sara A. Cohen / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| 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 | |||
| Property / cites work | |||
| Property / cites work: On the Complexity of Testing Implications of Functional and Join Dependencies / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On generating all maximal independent sets / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Database Theory - ICDT 2005 / rank | |||
Normal rank | |||
Latest revision as of 19:54, 25 June 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
