A Prüfer Based Approach to Process Top-k Queries in XML

Authors:
Ling Li;Mong Li Lee;Wynne Hsu;Han Zhen
Affiliations:
School of Computing, National University of Singapore,;School of Computing, National University of Singapore,;School of Computing, National University of Singapore,;School of Computing, National University of Singapore,
Venue:
DEXA '09 Proceedings of the 20th International Conference on Database and Expert Systems Applications
Year:
2009

Citing 9
Cited 0

Querying structured text in an XML database

Proceedings of the 2003 ACM SIGMOD international conference on Management of data
XRANK: ranked keyword search over XML documents

Proceedings of the 2003 ACM SIGMOD international conference on Management of data
PRIX: Indexing And Querying XML Using Prüfer Sequences

ICDE '04 Proceedings of the 20th International Conference on Data Engineering
FleXPath: flexible structure and full-text querying for XML

SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
On the integration of structure indexes and inverted lists

SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
A TeXQuery-based XML full-text search engine

SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Adaptive Processing of Top-k Queries in XML

ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Structure and content scoring for XML

VLDB '05 Proceedings of the 31st international conference on Very large data bases
LCS-TRIM: dynamic programming meets XML indexing and querying

VLDB '07 Proceedings of the 33rd international conference on Very large data bases

Quantified Score

Hi-index	0.00

Visualization

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.