Titlebook: Database and XML Technologies; 6th International XM Zohra Bellahsène,Ela Hunt,Rainer Unland Conference proceedings 2009 Springer-Verlag Ber

OVER

persistence

XML Lossy Text Compression: A Preliminary Studyssion schemes. In this paper, we present a preliminary study on a set of lossy transformations for XML documents that preserve the semantics. Inspired by previous techniques, e.g. lossy text compression and literate programming, we apply a simple algorithm to XML syntactic constructs to loose superf

保守黨

XQuery Full Text Implementation in BaseXlly support the language extensions. The system’s data and index structures are described, and implementation details are given on the XQuery compiler, which supports sequential scanning, index-based, and hybrid processing of full-text queries. Experimental analysis and an insight into visual result

可用

Recommending XMLTable Views for XQuery Workloadst to choose the right configuration of these physical structures for a given database. In this paper, we discuss the types of materialized views that are suitable for an XML database. We then focus on XMLTable materialized views and present a procedure to recommend them given an XML database and a w

尋找

BACLE

Universal XForms for Dynamic XQuery GenerationThe forms are called the Universal XForms for XQuery, and abbreviated to the Universal XForms. The Universal XForms help users to construct XQueries through the provision of prompts, and do not require prior knowledge of the structure of the data to be queried. Sample XML documents from more than tw

characteristic

From Entity Relationship to XML Schema: A Graph-Theoretic Approachand integrity constraints are preserved, no redundance is introduced, different hierarchical views of the conceptual information are available, the resulting XML structure is highly connected, and the design is reversible. We investigate two different ways to nest the XML structure: a maximum connec

防水

Atomicity for XML Databases to expect from relational database systems. In this work, we discuss strategies to provide the transactional aspect of atomicity to XML databases. The main contribution of this paper is to propose a novel approach for performing updates-in-place on XML databases, with the undo statements stored in

explicit

Susan Panzarine,Arthur B. Elsterorithm uses a layered cache structure to systematically accumulate query results. Our experiments show that the new algorithm gains remarkable speed up over the existing algorithm without compromising on bufferspace requirement.

addict

Ordered Backward XPath Axis Processing against XML Streamsorithm uses a layered cache structure to systematically accumulate query results. Our experiments show that the new algorithm gains remarkable speed up over the existing algorithm without compromising on bufferspace requirement.