Rank-aware XML data model and algebra: towards unifying exact match and similar match in XML

Authors:
Wang Ning;Xu De
Affiliations:
Computer Science Department, School of Computer Science & Information Technology, Beijing Jiaotong University, Beijing, China;Computer Science Department, School of Computer Science & Information Technology, Beijing Jiaotong University, Beijing, China
Venue:
MIV'07 Proceedings of the 7th Conference on 7th WSEAS International Conference on Multimedia, Internet & Video Technologies - Volume 7
Year:
2007

Citing 9
Cited 0

Minimal probing: supporting expensive predicates for top-k queries

Proceedings of the 2002 ACM SIGMOD international conference on Management of data
TAX: A Tree Algebra for XML

DBPL '01 Revised Papers from the 8th International Workshop on Database Programming Languages
Texquery: a full-text search extension to xquery

Proceedings of the 13th international conference on World Wide Web
Adaptive Processing of Top-k Queries in XML

ICDE '05 Proceedings of the 21st International Conference on Data Engineering
RankSQL: query algebra and optimization for relational top-k queries

Proceedings of the 2005 ACM SIGMOD international conference on Management of data
XML full-text search: challenges and opportunities

VLDB '05 Proceedings of the 31st international conference on Very large data bases
Report on the DB/IR panel at SIGMOD 2005

ACM SIGMOD Record
Boolean + ranking: querying a database by k-constrained optimization

Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Merging the results of approximate match operations

VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we present rank-aware XML data model and algebra, which aims at providing a seamless support and integration of ranked queries with precise queries. Our data model is based on ranked XML trees by extending the semantics of XML trees to be rank-aware. A collection of ranked XML trees which can be ordered by their ranks is modeled as a sequence, which is the basis for ranked XML operations. With ranked XML tree model, we extend XML algebra by introducing new ranking operator and extending ordinary XML operators to fully support top-k queries. A set of algebraic laws is also defined in this paper for rewriting and optimizing top-k queries.