Please use this identifier to cite or link to this item:
https://doi.org/10.1145/1376616.1376678
DC Field | Value | |
---|---|---|
dc.title | Minimization of tree pattern queries with constraints | |
dc.contributor.author | Chen, D. | |
dc.contributor.author | Chan, C.-Y. | |
dc.date.accessioned | 2013-07-04T08:21:53Z | |
dc.date.available | 2013-07-04T08:21:53Z | |
dc.date.issued | 2008 | |
dc.identifier.citation | Chen, D.,Chan, C.-Y. (2008). Minimization of tree pattern queries with constraints. Proceedings of the ACM SIGMOD International Conference on Management of Data : 609-622. ScholarBank@NUS Repository. <a href="https://doi.org/10.1145/1376616.1376678" target="_blank">https://doi.org/10.1145/1376616.1376678</a> | |
dc.identifier.isbn | 9781605581026 | |
dc.identifier.issn | 07308078 | |
dc.identifier.uri | http://scholarbank.nus.edu.sg/handle/10635/41198 | |
dc.description.abstract | Tree pattern queries (TPQs) provide a natural and easy formalism to query tree-structured XML data, and the efficient processing of such queries has attracted a lot of attention. Since the size of a TPQ is a key determinant of its evaluation cost, recent research has focused on the problem of query minimization using integrity constraints to eliminate redundant query nodes; specifically, TPQ minimization has been studied for the class of forward and subtype constraints (FT-constraints). In this paper, we explore the TPQ minimization problem further for a richer class of FBST-constraints that includes not only FT-constraints but also backward and sibling constraints. By exploiting the properties of minimal queries under FBST-constraints, we propose efficient algorithms to both compute a single minimal query as well as enumerate all minimal queries. In addition, we also develop more efficient minimization algorithms for the previously studied class of FT-constraints. Our experimental study demonstrates the effectiveness and efficiency of query minimization using FBST-constraints. Copyright 2008 ACM. | |
dc.description.uri | http://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1145/1376616.1376678 | |
dc.source | Scopus | |
dc.subject | Chase | |
dc.subject | Integrity constraints | |
dc.subject | Query minimization | |
dc.subject | Simulation | |
dc.subject | Tree pattern queries | |
dc.subject | XML | |
dc.subject | Xpath | |
dc.type | Conference Paper | |
dc.contributor.department | COMPUTER SCIENCE | |
dc.description.doi | 10.1145/1376616.1376678 | |
dc.description.sourcetitle | Proceedings of the ACM SIGMOD International Conference on Management of Data | |
dc.description.page | 609-622 | |
dc.identifier.isiut | NOT_IN_WOS | |
Appears in Collections: | Staff Publications |
Show simple item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.