Please use this identifier to cite or link to this item:
http://hdl.handle.net/1942/10727
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | WU, Yuqing | - |
dc.contributor.author | VAN GUCHT, Dirk | - |
dc.contributor.author | GYSSENS, Marc | - |
dc.contributor.author | PAREDAENS, Marc | - |
dc.date.accessioned | 2010-03-18T10:32:35Z | - |
dc.date.available | 2010-03-18T10:32:35Z | - |
dc.date.issued | 2009 | - |
dc.identifier.citation | Sexton, Alan P. (Ed.) Dataspace: The Final Frontier, 26th British National Conference on Databases, BNCOD 26, Birmingham, UK, July 7-9, 2009. Proceedings. p. 133-145. | - |
dc.identifier.isbn | 978-3-642-02842-7 | - |
dc.identifier.issn | 0302-9743 | - |
dc.identifier.uri | http://hdl.handle.net/1942/10727 | - |
dc.description.abstract | We study the expressiveness of a positive fragment of path queries, denoted Path, on node-labeled trees documents. The expressiveness of Path is studied from two angles. First, we establish that Path is equivalent in expressive power to a particular sub-fragment as well as to the class of tree queries, a sub-class of the first-order conjunctive queries defined over label, parent-child, and child-parent predicates. The translation algorithm from tree queries to Path yields a normal form for Path queries. Using this normal form, we can decompose a Path query into sub-queries that can be expressed in a very small sub-fragment of Path for which efficient evaluation strategies are available. Second, we characterize the expressiveness of Path in terms of its ability to resolve nodes in a document. This result is used to show that each tree query can be translated to a unique, equivalent, and minimal tree query. The combination of these results yields an effective strategy to evaluate a large class of path queries on documents. | - |
dc.language.iso | en | - |
dc.publisher | Springer | - |
dc.relation.ispartofseries | Lecture Notes in Computer Science | - |
dc.title | A study of a positive fragment of path queries: expressiveness, normal form, and minimization | - |
dc.type | Proceedings Paper | - |
local.bibliographicCitation.authors | Sexton, Alan P. | - |
local.bibliographicCitation.conferencename | British National Conference on Databases | - |
dc.bibliographicCitation.conferencenr | 26 | - |
local.bibliographicCitation.conferenceplace | Birmingham, UK, July 7-9, 2009 | - |
dc.identifier.epage | 145 | - |
dc.identifier.spage | 133 | - |
local.bibliographicCitation.jcat | C1 | - |
local.type.specified | Proceedings Paper | - |
local.relation.ispartofseriesnr | 5588 | - |
dc.bibliographicCitation.oldjcat | C1 | - |
dc.identifier.doi | 10.1007/978-3-642-02843-4 | - |
local.bibliographicCitation.btitle | Dataspace: The Final Frontier, 26th British National Conference on Databases, BNCOD 26, Birmingham, UK, July 7-9, 2009. Proceedings | - |
item.fulltext | No Fulltext | - |
item.contributor | WU, Yuqing | - |
item.contributor | VAN GUCHT, Dirk | - |
item.contributor | GYSSENS, Marc | - |
item.contributor | PAREDAENS, Marc | - |
item.accessRights | Closed Access | - |
item.fullcitation | WU, Yuqing; VAN GUCHT, Dirk; GYSSENS, Marc & PAREDAENS, Marc (2009) A study of a positive fragment of path queries: expressiveness, normal form, and minimization. In: Sexton, Alan P. (Ed.) Dataspace: The Final Frontier, 26th British National Conference on Databases, BNCOD 26, Birmingham, UK, July 7-9, 2009. Proceedings. p. 133-145.. | - |
Appears in Collections: | Research publications |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.