Titlebook: Database Programming Languages; 11th International S Marcelo Arenas,Michael I. Schwartzbach Conference proceedings 2007 Springer-Verlag Ber

衍生

冬眠

Efficient Algorithms for the Tree Homeomorphism Problemnt. The algorithm is in LOGCFL and space consumption is strongly bounded, while the running time is linear in the size of the data tree. This algorithm immediately generalizes to the problem of matching the tree pattern against all subtrees of the data tree, preserving the mentioned efficiency properties.

虛度

Repairing Inconsistent XML Write-Access Control Policiesast-privilege” consistent total policies. We also consider repair problems based on deleting privileges to restore consistency, show that finding minimal repairs is .-complete, and give heuristics for finding repairs.

happiness

Medley

高深莫測

A?Methodology?for?Coupling?Fragments?of?XPath with Structural Indexes for XML Documentss - namely, value indices on tags and text values - are first used, together with structural join algorithms [1, 2, 19]. This approach turns out to be simple and efficient. However, the structural containment relationships native to XML data are not directly captured by value indices.

Epidural-Space

A Theory of Stream Queriesues investigated include abstract definitions of computability of stream queries; the connection between abstract computability, continuity, monotonicity, and non-blocking operators; and bounded memory computability of stream queries using abstract state machines (ASMs).

GULF

掃興

https://doi.org/10.1007/978-1-349-05189-2t the color algebra is relationally complete: it is equivalent to the relational algebra on the explicit annotations. Our result extends a similar completeness result established for the query algebra of the MONDRIAN annotation system, from unions of conjunctive queries to the full relational algebra.

reptile

Conrad’s shorter fiction: 1901–1902dation for forms of provenance that are intended to show how (part of) the output of a query depends on (parts of) its input. We introduce a semantic characterization of such ., show that this form of provenance is not computable, and provide dynamic and static approximation techniques.