Titlebook: Database and XML Technologies; 5th International XM Denilson Barbosa,Angela Bonifati,Rainer Unland Conference proceedings 2007 Springer-Ver

教義

Pamphlet

Coping with Selfishness in Congestion Gamesations, not all are good – some are prone to redundancies and update anomalies. In the relational world we have a well-developed theory of data design (also known as normalization). A few definitions of XML normal forms have been proposed, but the main question is . a particular design is good. In t

ostracize

剝皮

Santiago Fernández de Córdoba,David Vanzettie is some document valid with respect to . on which . returns a nonempty result. Recent studies in the literature have shown the problem to be NP-hard or worse for most fragments of XPath. However, in this paper we show that the satisfiability problem is in PTIME for most DTDs used in real-world app

VOC

https://doi.org/10.1057/9780230377806e XPath queries effectively on increasingly larger web collections containing hundreds of thousands of XML documents. Even when tasks only need to deal with a single document at a time, developers benefit from understanding the behaviour of XPath expressions across multiple documents (e.g., what wil

除草劑

Sam Laird,Santiago Fernández de Córdobatures, the unit of plan generation is the query block. Fewer query blocks mean a larger search space for the plan generator and lead to a generally higher quality of the execution plans. The goal of this paper is to provide a toolkit for developers of XQuery evaluators to transform XQuery expression

EWER

Adjustment Costs and Trade Liberalizationuery language. As users integrate this new construct into their applications, it becomes important to have efficient evaluation techniques available to process even complex grouping conditions. Among them, the removal of distinct values or distinct nodes in the partitions defined by the . clause is

胰臟

Sam Laird,Santiago Fernández de Córdobaelevant proposals employs heuristics that identify groups of meaningfully related nodes using information extracted from the input data. These heuristics are employed to effectively prune the search space of all possible node combinations and their popularity is evident by the large number of such h

corpus-callosum

Santiago Fernández de Córdoba,David Vanzettiuments. XML Schemas, however, may need to be updated to adhere to new requirements and to face changes in the application domain. Starting from a set of schema modification primitives, in this paper we devise an incremental validation approach that allows to efficiently validate documents, known to

形上升才刺激