Application of rUID in processing XML queries on structure and keyword

1Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Applying numbering schemes to simulate the structure of XML data is a promising technique for XML query processing. In this paper, we describe SKEYRUS, a system, which enables the integrated structure-keyword searches on XML data using the rUID numbering scheme. rUID has been designed to be robust in structural update and applicable to arbitrarily large XML documents. SKEYRUS accepts XPathexpressions containing word-containment predicates as the input, there-fore the query expressiveness is significantly extended. The structural feature and the ability to generate XPath axes of rUID are exploited in query processing. Preliminary performance results of SKEYRUS were also reported.

Cite

CITATION STYLE

APA

Kha, D. D., Yoshikawa, M., & Uemura, S. (2002). Application of rUID in processing XML queries on structure and keyword. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2453, pp. 279–289). Springer Verlag. https://doi.org/10.1007/3-540-46146-9_28

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free