Please use this identifier to cite or link to this item:
http://hdl.handle.net/1942/30770
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | HELLINGS, Jelle | - |
dc.contributor.author | GYSSENS, Marc | - |
dc.contributor.author | Wu, Yuqing | - |
dc.contributor.author | Van Gucht, Dirk | - |
dc.contributor.author | VAN DEN BUSSCHE, Jan | - |
dc.contributor.author | VANSUMMEREN, Stijn | - |
dc.contributor.author | Fletcher, George H. L. | - |
dc.date.accessioned | 2020-03-11T15:43:44Z | - |
dc.date.available | 2020-03-11T15:43:44Z | - |
dc.date.issued | 2020 | - |
dc.date.submitted | 2020-03-11T11:07:00Z | - |
dc.identifier.citation | INFORMATION SYSTEMS, 89 (Art N° 101467) | - |
dc.identifier.uri | http://hdl.handle.net/1942/30770 | - |
dc.description.abstract | Motivated by the continuing interest in the tree data model, we study the expressive power of downward navigational query languages on trees and chains. Basic navigational queries are built from the identity relation and edge relations using composition and union. We study the effects on relative expressiveness when we add transitive closure, projections, coprojections, intersection, and difference; this for Boolean queries and path queries on labeled and unlabeled structures. In all cases, we present the complete Hasse diagram. In particular, we establish, for each query language fragment that we study on trees, whether it is closed under difference and intersection. (C) 2019 Elsevier Ltd. All rights reserved. | - |
dc.description.sponsorship | Yuqing Wu carried out part of her work during a sabbatical visit to Hasselt University with a Senior Visiting Postdoctoral Fellowship of the Research Foundation Flanders (FWO). | - |
dc.language.iso | en | - |
dc.publisher | PERGAMON-ELSEVIER SCIENCE LTD | - |
dc.rights | 2019 Elsevier Ltd. All rights reserved. | - |
dc.subject.other | Tree data model | - |
dc.subject.other | Relational calculus with transitive closure | - |
dc.subject.other | Downward query language fragments | - |
dc.subject.other | Path queries | - |
dc.subject.other | Boolean queries | - |
dc.subject.other | Relative expressive power | - |
dc.title | Comparing the expressiveness of downward fragments of the relation algebra with transitive closure on trees | - |
dc.type | Journal Contribution | - |
dc.identifier.volume | 89 | - |
local.format.pages | 16 | - |
local.bibliographicCitation.jcat | A1 | - |
dc.description.notes | Gyssens, M (reprint author), Hasselt Univ, Martelarenlaan 42, Hasselt, Belgium. | - |
dc.description.notes | jhellings@ucdavis.edu; marc.gyssens@uhasselt.be; melanie.wu@pomona.edu; | - |
dc.description.notes | vgucht@cs.indiana.edu; jan.vandenbussche@uhasselt.be; | - |
dc.description.notes | stijn.vansummeren@ulb.ac.be; g.h.l.fletcher@tue.nl | - |
dc.description.other | Gyssens, M (reprint author), Hasselt Univ, Martelarenlaan 42, Hasselt, Belgium. jhellings@ucdavis.edu; marc.gyssens@uhasselt.be; melanie.wu@pomona.edu; vgucht@cs.indiana.edu; jan.vandenbussche@uhasselt.be; stijn.vansummeren@ulb.ac.be; g.h.l.fletcher@tue.nl | - |
local.publisher.place | THE BOULEVARD, LANGFORD LANE, KIDLINGTON, OXFORD OX5 1GB, ENGLAND | - |
local.type.refereed | Refereed | - |
local.type.specified | Article | - |
local.bibliographicCitation.artnr | 101467 | - |
dc.identifier.doi | 10.1016/j.is.2019.101467 | - |
dc.identifier.isi | WOS:000514004100002 | - |
dc.identifier.eissn | 1873-6076 | - |
local.provider.type | wosris | - |
local.uhasselt.uhpub | yes | - |
local.uhasselt.international | yes | - |
item.contributor | HELLINGS, Jelle | - |
item.contributor | GYSSENS, Marc | - |
item.contributor | Wu, Yuqing | - |
item.contributor | Van Gucht, Dirk | - |
item.contributor | VAN DEN BUSSCHE, Jan | - |
item.contributor | VANSUMMEREN, Stijn | - |
item.contributor | Fletcher, George H. L. | - |
item.fullcitation | HELLINGS, Jelle; GYSSENS, Marc; Wu, Yuqing; Van Gucht, Dirk; VAN DEN BUSSCHE, Jan; VANSUMMEREN, Stijn & Fletcher, George H. L. (2020) Comparing the expressiveness of downward fragments of the relation algebra with transitive closure on trees. In: INFORMATION SYSTEMS, 89 (Art N° 101467). | - |
item.accessRights | Open Access | - |
item.fulltext | With Fulltext | - |
item.validation | ecoom 2021 | - |
crisitem.journal.issn | 0306-4379 | - |
crisitem.journal.eissn | 1873-6076 | - |
Appears in Collections: | Research publications |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
is2019_paper.pdf | Non Peer-reviewed author version | 470.65 kB | Adobe PDF | View/Open |
hellings.pdf Restricted Access | Published version | 740.55 kB | Adobe PDF | View/Open Request a copy |
WEB OF SCIENCETM
Citations
2
checked on May 1, 2024
Page view(s)
70
checked on Sep 7, 2022
Download(s)
16
checked on Sep 7, 2022
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.