Representing and querying summarized XML data

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

Abstract

In the last few years several repositories for storing XML documents and languages for querying XML data have been studied and implemented. All the query languages proposed so far allow to obtain exact answers, but when applied to large XML repositories or warehouses, such precise queries may require high response times. To overcome this problem, in traditional relational warehouses fast approximate queries are supported, built on concise data statistics based on histograms or sampling techniques. In this paper we propose a novel approach to summarize an XML document collection taking into account the hierarchical structure of XML documents, which makes the summarization process substantially more difficult than in case of flat, relational data. © Springer-Verlag Berlin Heidelberg 2003.

Cite

CITATION STYLE

APA

Comai, S., Marrara, S., & Tanca, L. (2003). Representing and querying summarized XML data. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2736, 171–181. https://doi.org/10.1007/978-3-540-45227-0_18

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