A Prüfer Based Approach to Process Top-k Queries in XML
DATABASE AND EXPERT SYSTEMS APPLICATIONS, PROCEEDINGS（2009）
摘要
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.
更多查看译文
关键词
process top-k queries,fer sequence,top-k query,experiment result,twig query,approximate matching xml document,xml document
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要