Please use this identifier to cite or link to this item:
|Title:||A Prüfer based approach to process top-k queries in XML|
|Authors:||Li, L. |
|Source:||Li, L.,Lee, M.L.,Hsu, W.,Zhen, H. (2009). A Prüfer based approach to process top-k queries in XML. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 5690 LNCS : 348-355. ScholarBank@NUS Repository. https://doi.org/10.1007/978-3-642-03573-9_29|
|Abstract:||Top-k queries in XML involves retrieving approximate matching XML documents. Existing techniques process top-k queries in XML by applying one or more relaxations on the twig query. In this work, we investigate how Prüfer sequence can be utilized to process top-k queries in XML. We design a method called XPRAM that incorporates the relaxations into the sequence matching process. Experiment results indicate that the proposed approach is efficient and scalable. © 2009 Springer Berlin Heidelberg.|
|Source Title:||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jan 19, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.