RULE-BASED QUERY TREE EVALUATION OVER FRAGMENTED XML DOCUMENTS

Ron G. McFadyen, Yangjun Chen

2006

Abstract

XML documents are used to hold information and to make exchanges between systems. In this paper, we consider documents that embed knowledge and rules, which may contain considerable redundancy. To control redundancy and to provide for efficient execution of queries, documents are decomposed into fragments that are stored separately. Then, to materialize documents for end-users, they need to be dynamically constructed from their sources (separately stored fragments) by evaluating rules, which requires database queries to be executed according to the document structure.

Paper Citation

in Harvard Style

G. McFadyen R. and Chen Y. (2006). RULE-BASED QUERY TREE EVALUATION OVER FRAGMENTED XML DOCUMENTS . In Proceedings of WEBIST 2006 - Second International Conference on Web Information Systems and Technologies - Volume 1: WEBIST, ISBN 978-972-8865-46-7, pages 199-205. DOI: 10.5220/0001237501990205

in Bibtex Style

@conference{webist06,
author={Ron G. McFadyen and Yangjun Chen},
title={RULE-BASED QUERY TREE EVALUATION OVER FRAGMENTED XML DOCUMENTS},
booktitle={Proceedings of WEBIST 2006 - Second International Conference on Web Information Systems and Technologies - Volume 1: WEBIST,},
year={2006},
pages={199-205},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0001237501990205},
isbn={978-972-8865-46-7},
}

in EndNote Style

TY - CONF
JO - Proceedings of WEBIST 2006 - Second International Conference on Web Information Systems and Technologies - Volume 1: WEBIST,
TI - RULE-BASED QUERY TREE EVALUATION OVER FRAGMENTED XML DOCUMENTS
SN - 978-972-8865-46-7
AU - G. McFadyen R.
AU - Chen Y.
PY - 2006
SP - 199
EP - 205
DO - 10.5220/0001237501990205