Please use this identifier to cite or link to this item:
http://hdl.handle.net/1942/4137
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | LEINDERS, Dirk | - |
dc.contributor.author | VAN DEN BUSSCHE, Jan | - |
dc.date.accessioned | 2007-12-11T08:40:40Z | - |
dc.date.available | 2007-12-11T08:40:40Z | - |
dc.date.issued | 2007 | - |
dc.identifier.citation | JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 73(4). p. 538-549 | - |
dc.identifier.issn | 0022-0000 | - |
dc.identifier.uri | http://hdl.handle.net/1942/4137 | - |
dc.description.abstract | We show that any expression of the relational division operator in the relational algebra with union, difference, projection, selection, constant-tagging, and joins, must produce intermediate results of quadratic size. To prove this result, we show a dichotomy theorem about intermediate sizes of relational algebra expressions (they are either all linear, or at least one is quadratic), and we link linear relational algebra expressions to expressions using only semijoins instead of joins. (c) 2006 Elsevier Inc. All rights reserved. | - |
dc.language.iso | en | - |
dc.publisher | ACADEMIC PRESS INC ELSEVIER SCIENCE | - |
dc.subject.other | database; relational algebra; Semijoin algebra; complexity | - |
dc.title | On the complexity of division and set joins in the relational algebra | - |
dc.type | Journal Contribution | - |
dc.identifier.epage | 549 | - |
dc.identifier.issue | 4 | - |
dc.identifier.spage | 538 | - |
dc.identifier.volume | 73 | - |
local.format.pages | 12 | - |
local.bibliographicCitation.jcat | A1 | - |
dc.description.notes | Hasselt Univ, B-3590 Diepenbeek, Belgium. Transnatl Univ Limburg, B-3590 Diepenbeek, Belgium.LEINDERS, D, Hasselt Univ, B-3590 Diepenbeek, Belgium.dirk.leinders@uhasselt.be | - |
local.type.refereed | Refereed | - |
local.type.specified | Article | - |
dc.bibliographicCitation.oldjcat | A1 | - |
dc.identifier.doi | 10.1016/j.jcss.2006.10.011 | - |
dc.identifier.isi | 000246813700002 | - |
item.fullcitation | LEINDERS, Dirk & VAN DEN BUSSCHE, Jan (2007) On the complexity of division and set joins in the relational algebra. In: JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 73(4). p. 538-549. | - |
item.accessRights | Closed Access | - |
item.contributor | LEINDERS, Dirk | - |
item.contributor | VAN DEN BUSSCHE, Jan | - |
item.fulltext | No Fulltext | - |
item.validation | ecoom 2008 | - |
crisitem.journal.issn | 0022-0000 | - |
crisitem.journal.eissn | 1090-2724 | - |
Appears in Collections: | Research publications |
SCOPUSTM
Citations
11
checked on Sep 2, 2020
WEB OF SCIENCETM
Citations
8
checked on Apr 14, 2024
Page view(s)
72
checked on Jul 31, 2023
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.