On the study of tree pattern matching algorithms and applications
Solving Tree Pattern Query problem is the central part of XML database query. This thesis presents several new algorithms to solve Tree Pattern Query problem and its variations. All of them have better time complexity than any existing algorithms. This thesis also describes the design, implementatio...
| Main Author: | |
|---|---|
| Language: | English |
| Published: |
2010
|
| Online Access: | http://hdl.handle.net/2429/18318 |
| id |
ndltd-UBC-oai-circle.library.ubc.ca-2429-18318 |
|---|---|
| record_format |
oai_dc |
| spelling |
ndltd-UBC-oai-circle.library.ubc.ca-2429-183182018-01-05T17:39:17Z On the study of tree pattern matching algorithms and applications Ma, Fei Solving Tree Pattern Query problem is the central part of XML database query. This thesis presents several new algorithms to solve Tree Pattern Query problem and its variations. All of them have better time complexity than any existing algorithms. This thesis also describes the design, implementation, and application of two new algorithms to detect cloned code. The algorithms operate on the abstract syntax trees formed by many compilers as an intermediate representation. They extend prior work by identifying clones even when arbitrary subtrees have been changed. On a 440,000-line code corpus, 20-50% of the clones found eluded previous methods. Science, Faculty of Computer Science, Department of Graduate 2010-01-16T18:36:46Z 2010-01-16T18:36:46Z 2006 2006-11 Text Thesis/Dissertation http://hdl.handle.net/2429/18318 eng For non-commercial purposes only, such as research, private study and education. Additional conditions apply, see Terms of Use https://open.library.ubc.ca/terms_of_use. |
| collection |
NDLTD |
| language |
English |
| sources |
NDLTD |
| description |
Solving Tree Pattern Query problem is the central part of XML database query. This thesis presents several new algorithms to solve Tree Pattern Query problem and its variations. All of them have better time complexity than any existing algorithms. This thesis also describes the design, implementation, and application of two new algorithms to detect cloned code. The algorithms operate on the abstract syntax trees formed by many compilers as an intermediate representation. They extend prior work by identifying clones even when arbitrary subtrees have been changed. On a 440,000-line code corpus, 20-50% of the clones found eluded previous methods. === Science, Faculty of === Computer Science, Department of === Graduate |
| author |
Ma, Fei |
| spellingShingle |
Ma, Fei On the study of tree pattern matching algorithms and applications |
| author_facet |
Ma, Fei |
| author_sort |
Ma, Fei |
| title |
On the study of tree pattern matching algorithms and applications |
| title_short |
On the study of tree pattern matching algorithms and applications |
| title_full |
On the study of tree pattern matching algorithms and applications |
| title_fullStr |
On the study of tree pattern matching algorithms and applications |
| title_full_unstemmed |
On the study of tree pattern matching algorithms and applications |
| title_sort |
on the study of tree pattern matching algorithms and applications |
| publishDate |
2010 |
| url |
http://hdl.handle.net/2429/18318 |
| work_keys_str_mv |
AT mafei onthestudyoftreepatternmatchingalgorithmsandapplications |
| _version_ |
1718590796463079424 |